./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f509ea043fca36ef43b47e8e4046575373359a8f764b4f176c2773bac324a507 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:02:07,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:02:07,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:02:07,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:02:07,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:02:07,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:02:07,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:02:07,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:02:07,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:02:07,224 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:02:07,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:02:07,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:02:07,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:02:07,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:02:07,227 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:02:07,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:02:07,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:02:07,228 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:02:07,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:02:07,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:02:07,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:02:07,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:02:07,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:02:07,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:02:07,232 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:02:07,232 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:02:07,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:02:07,233 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:02:07,233 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:02:07,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:02:07,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:02:07,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:02:07,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:02:07,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:02:07,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:02:07,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:02:07,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:02:07,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:02:07,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:02:07,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:02:07,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:02:07,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:02:07,237 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f509ea043fca36ef43b47e8e4046575373359a8f764b4f176c2773bac324a507 [2024-10-11 11:02:07,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:02:07,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:02:07,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:02:07,498 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:02:07,498 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:02:07,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-1.i [2024-10-11 11:02:08,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:02:09,016 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:02:09,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-1.i [2024-10-11 11:02:09,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/577d467a5/9b95d78965a64442bce29ca8a3ddf811/FLAGd05c55aff [2024-10-11 11:02:09,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/577d467a5/9b95d78965a64442bce29ca8a3ddf811 [2024-10-11 11:02:09,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:02:09,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:02:09,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:02:09,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:02:09,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:02:09,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:02:09" (1/1) ... [2024-10-11 11:02:09,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6ae511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:02:09, skipping insertion in model container [2024-10-11 11:02:09,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:02:09" (1/1) ... [2024-10-11 11:02:09,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:02:09,233 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-1.i[915,928] [2024-10-11 11:02:09,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:02:09,347 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:02:09,396 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-1.i[915,928] [2024-10-11 11:02:09,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:02:09,470 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:02:09,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:02:09 WrapperNode [2024-10-11 11:02:09,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:02:09,473 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:02:09,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:02:09,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:02:09,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:02:09" (1/1) ... [2024-10-11 11:02:09,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:02:09" (1/1) ... [2024-10-11 11:02:09,532 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 265 [2024-10-11 11:02:09,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:02:09,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:02:09,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:02:09,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:02:09,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:02:09" (1/1) ... [2024-10-11 11:02:09,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:02:09" (1/1) ... [2024-10-11 11:02:09,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:02:09" (1/1) ... [2024-10-11 11:02:09,563 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:02:09,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:02:09" (1/1) ... [2024-10-11 11:02:09,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:02:09" (1/1) ... [2024-10-11 11:02:09,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:02:09" (1/1) ... [2024-10-11 11:02:09,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:02:09" (1/1) ... [2024-10-11 11:02:09,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:02:09" (1/1) ... [2024-10-11 11:02:09,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:02:09" (1/1) ... [2024-10-11 11:02:09,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:02:09,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:02:09,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:02:09,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:02:09,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:02:09" (1/1) ... [2024-10-11 11:02:09,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:02:09,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:02:09,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:02:09,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:02:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:02:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:02:09,705 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:02:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:02:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:02:09,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:02:09,796 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:02:09,797 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:02:10,318 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-11 11:02:10,318 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:02:10,365 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:02:10,367 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:02:10,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:02:10 BoogieIcfgContainer [2024-10-11 11:02:10,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:02:10,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:02:10,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:02:10,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:02:10,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:02:09" (1/3) ... [2024-10-11 11:02:10,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d8441d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:02:10, skipping insertion in model container [2024-10-11 11:02:10,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:02:09" (2/3) ... [2024-10-11 11:02:10,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d8441d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:02:10, skipping insertion in model container [2024-10-11 11:02:10,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:02:10" (3/3) ... [2024-10-11 11:02:10,376 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-1.i [2024-10-11 11:02:10,389 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:02:10,390 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:02:10,454 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:02:10,460 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@797d06cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:02:10,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:02:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 11:02:10,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-11 11:02:10,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:02:10,481 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:02:10,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:02:10,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:02:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash -985805795, now seen corresponding path program 1 times [2024-10-11 11:02:10,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:02:10,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243011970] [2024-10-11 11:02:10,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:02:10,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:02:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:02:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:02:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:02:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:02:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:02:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:02:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:02:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:02:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:02:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:02:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 11:02:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:02:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 11:02:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:02:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:02:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:02:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:02:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:02:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:02:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:02:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:02:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:02:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:02:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:02:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:02:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:02:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:02:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:10,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:02:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 11:02:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 11:02:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:02:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 11:02:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 11:02:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 11:02:11,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:02:11,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243011970] [2024-10-11 11:02:11,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243011970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:02:11,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:02:11,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:02:11,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062892421] [2024-10-11 11:02:11,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:02:11,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:02:11,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:02:11,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:02:11,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:02:11,071 INFO L87 Difference]: Start difference. First operand has 110 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 11:02:11,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:02:11,129 INFO L93 Difference]: Finished difference Result 219 states and 386 transitions. [2024-10-11 11:02:11,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:02:11,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 209 [2024-10-11 11:02:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:02:11,141 INFO L225 Difference]: With dead ends: 219 [2024-10-11 11:02:11,141 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 11:02:11,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:02:11,150 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:02:11,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:02:11,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 11:02:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-11 11:02:11,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.452054794520548) internal successors, (106), 73 states have internal predecessors, (106), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 11:02:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 172 transitions. [2024-10-11 11:02:11,197 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 172 transitions. Word has length 209 [2024-10-11 11:02:11,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:02:11,197 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 172 transitions. [2024-10-11 11:02:11,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 11:02:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 172 transitions. [2024-10-11 11:02:11,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-11 11:02:11,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:02:11,204 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:02:11,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:02:11,204 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:02:11,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:02:11,205 INFO L85 PathProgramCache]: Analyzing trace with hash -781812533, now seen corresponding path program 1 times [2024-10-11 11:02:11,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:02:11,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601553998] [2024-10-11 11:02:11,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:02:11,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:02:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:02:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:02:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:02:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:02:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:02:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:02:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:02:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:02:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:02:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:02:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 11:02:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:02:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 11:02:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:02:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:02:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:02:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:02:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:02:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:02:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:02:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:02:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:02:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:02:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:02:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:02:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:02:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:02:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:02:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 11:02:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 11:02:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:02:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 11:02:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 11:02:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 11:02:11,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:02:11,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601553998] [2024-10-11 11:02:11,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601553998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:02:11,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:02:11,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:02:11,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919785388] [2024-10-11 11:02:11,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:02:11,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:02:11,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:02:11,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:02:11,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:02:11,852 INFO L87 Difference]: Start difference. First operand 108 states and 172 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 11:02:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:02:11,946 INFO L93 Difference]: Finished difference Result 322 states and 514 transitions. [2024-10-11 11:02:11,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:02:11,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-10-11 11:02:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:02:11,953 INFO L225 Difference]: With dead ends: 322 [2024-10-11 11:02:11,953 INFO L226 Difference]: Without dead ends: 215 [2024-10-11 11:02:11,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:02:11,957 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 104 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:02:11,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 494 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:02:11,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-11 11:02:12,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2024-10-11 11:02:12,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 144 states have (on average 1.4513888888888888) internal successors, (209), 144 states have internal predecessors, (209), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-11 11:02:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 341 transitions. [2024-10-11 11:02:12,006 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 341 transitions. Word has length 209 [2024-10-11 11:02:12,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:02:12,007 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 341 transitions. [2024-10-11 11:02:12,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 11:02:12,008 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 341 transitions. [2024-10-11 11:02:12,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 11:02:12,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:02:12,010 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:02:12,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:02:12,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:02:12,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:02:12,011 INFO L85 PathProgramCache]: Analyzing trace with hash -326415757, now seen corresponding path program 1 times [2024-10-11 11:02:12,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:02:12,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962668337] [2024-10-11 11:02:12,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:02:12,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:02:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:02:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:02:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:02:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:02:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:02:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:02:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:02:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:02:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:02:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:02:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 11:02:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:02:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 11:02:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:02:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:02:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:02:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:02:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:02:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:02:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:02:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:02:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:02:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:02:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:02:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:02:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:02:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:02:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:02:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 11:02:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 11:02:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:02:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 11:02:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 11:02:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 11:02:13,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:02:13,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962668337] [2024-10-11 11:02:13,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962668337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:02:13,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:02:13,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:02:13,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112449545] [2024-10-11 11:02:13,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:02:13,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:02:13,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:02:13,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:02:13,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:02:13,062 INFO L87 Difference]: Start difference. First operand 213 states and 341 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 11:02:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:02:13,292 INFO L93 Difference]: Finished difference Result 533 states and 846 transitions. [2024-10-11 11:02:13,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:02:13,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-10-11 11:02:13,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:02:13,295 INFO L225 Difference]: With dead ends: 533 [2024-10-11 11:02:13,295 INFO L226 Difference]: Without dead ends: 321 [2024-10-11 11:02:13,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:02:13,297 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 80 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:02:13,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 348 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:02:13,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-11 11:02:13,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 317. [2024-10-11 11:02:13,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 224 states have (on average 1.4508928571428572) internal successors, (325), 226 states have internal predecessors, (325), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-11 11:02:13,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 501 transitions. [2024-10-11 11:02:13,349 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 501 transitions. Word has length 210 [2024-10-11 11:02:13,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:02:13,349 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 501 transitions. [2024-10-11 11:02:13,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 11:02:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 501 transitions. [2024-10-11 11:02:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 11:02:13,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:02:13,352 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:02:13,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:02:13,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:02:13,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:02:13,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1006474127, now seen corresponding path program 1 times [2024-10-11 11:02:13,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:02:13,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399889607] [2024-10-11 11:02:13,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:02:13,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:02:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:02:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:02:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:02:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:02:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:02:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:02:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:02:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:02:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:02:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:02:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 11:02:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:02:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 11:02:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:02:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:02:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:02:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:02:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:02:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:02:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:02:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:02:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:02:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:02:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:02:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:02:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:02:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:02:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:02:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 11:02:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 11:02:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:02:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 11:02:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 11:02:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 261 proven. 225 refuted. 0 times theorem prover too weak. 1626 trivial. 0 not checked. [2024-10-11 11:02:18,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:02:18,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399889607] [2024-10-11 11:02:18,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399889607] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:02:18,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164074602] [2024-10-11 11:02:18,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:02:18,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:02:18,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:02:18,902 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:02:18,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:02:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:02:19,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 11:02:19,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:02:27,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1563 proven. 243 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-10-11 11:02:27,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:02:47,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164074602] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:02:47,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:02:47,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25] total 39 [2024-10-11 11:02:47,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751297985] [2024-10-11 11:02:47,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:02:47,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-11 11:02:47,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:02:47,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-11 11:02:47,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1966, Unknown=6, NotChecked=0, Total=2256 [2024-10-11 11:02:47,805 INFO L87 Difference]: Start difference. First operand 317 states and 501 transitions. Second operand has 39 states, 38 states have (on average 3.210526315789474) internal successors, (122), 38 states have internal predecessors, (122), 15 states have call successors, (66), 8 states have call predecessors, (66), 14 states have return successors, (66), 15 states have call predecessors, (66), 15 states have call successors, (66) [2024-10-11 11:03:03,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 11:03:07,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 11:03:15,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 11:03:24,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 11:03:28,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 11:03:32,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 11:03:40,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 11:03:44,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]