./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_fillercode_fillercodestructure_filler-ps-ci_file-10.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_fillercode_fillercodestructure_filler-ps-ci_file-10.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 f438dca2376e7c8417e397f8c4e8905746bba2e764fb7eae58181fb192c76381 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:57:33,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:57:33,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:57:33,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:57:33,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:57:33,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:57:33,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:57:33,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:57:33,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:57:33,277 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:57:33,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:57:33,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:57:33,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:57:33,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:57:33,279 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:57:33,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:57:33,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:57:33,280 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:57:33,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:57:33,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:57:33,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:57:33,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:57:33,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:57:33,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:57:33,282 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:57:33,282 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:57:33,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:57:33,283 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:57:33,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:57:33,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:57:33,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:57:33,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:57:33,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:57:33,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:57:33,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:57:33,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:57:33,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:57:33,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:57:33,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:57:33,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:57:33,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:57:33,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:57:33,286 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 -> f438dca2376e7c8417e397f8c4e8905746bba2e764fb7eae58181fb192c76381 [2024-10-11 09:57:33,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:57:33,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:57:33,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:57:33,501 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:57:33,502 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:57:33,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-10.i [2024-10-11 09:57:34,742 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:57:34,920 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:57:34,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-10.i [2024-10-11 09:57:34,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/65bdd6401/3d82791db12a44a4813114ce902ddeb7/FLAG7adf26a05 [2024-10-11 09:57:35,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/65bdd6401/3d82791db12a44a4813114ce902ddeb7 [2024-10-11 09:57:35,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:57:35,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:57:35,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:57:35,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:57:35,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:57:35,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:57:35" (1/1) ... [2024-10-11 09:57:35,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cce4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:35, skipping insertion in model container [2024-10-11 09:57:35,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:57:35" (1/1) ... [2024-10-11 09:57:35,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:57:35,469 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_fillercode_fillercodestructure_filler-ps-ci_file-10.i[919,932] [2024-10-11 09:57:35,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:57:35,560 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:57:35,572 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_fillercode_fillercodestructure_filler-ps-ci_file-10.i[919,932] [2024-10-11 09:57:35,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:57:35,611 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:57:35,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:35 WrapperNode [2024-10-11 09:57:35,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:57:35,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:57:35,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:57:35,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:57:35,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:35" (1/1) ... [2024-10-11 09:57:35,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:35" (1/1) ... [2024-10-11 09:57:35,667 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 298 [2024-10-11 09:57:35,668 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:57:35,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:57:35,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:57:35,669 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:57:35,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:35" (1/1) ... [2024-10-11 09:57:35,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:35" (1/1) ... [2024-10-11 09:57:35,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:35" (1/1) ... [2024-10-11 09:57:35,708 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 09:57:35,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:35" (1/1) ... [2024-10-11 09:57:35,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:35" (1/1) ... [2024-10-11 09:57:35,722 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:35" (1/1) ... [2024-10-11 09:57:35,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:35" (1/1) ... [2024-10-11 09:57:35,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:35" (1/1) ... [2024-10-11 09:57:35,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:35" (1/1) ... [2024-10-11 09:57:35,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:57:35,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:57:35,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:57:35,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:57:35,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:35" (1/1) ... [2024-10-11 09:57:35,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:57:35,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:57:35,787 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 09:57:35,789 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 09:57:35,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:57:35,825 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:57:35,825 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:57:35,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:57:35,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:57:35,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:57:35,905 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:57:35,907 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:57:36,392 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-11 09:57:36,393 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:57:36,418 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:57:36,420 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:57:36,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:57:36 BoogieIcfgContainer [2024-10-11 09:57:36,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:57:36,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:57:36,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:57:36,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:57:36,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:57:35" (1/3) ... [2024-10-11 09:57:36,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597dafd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:57:36, skipping insertion in model container [2024-10-11 09:57:36,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:35" (2/3) ... [2024-10-11 09:57:36,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597dafd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:57:36, skipping insertion in model container [2024-10-11 09:57:36,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:57:36" (3/3) ... [2024-10-11 09:57:36,429 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-10.i [2024-10-11 09:57:36,441 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:57:36,441 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:57:36,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:57:36,496 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;@20a90ee1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:57:36,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:57:36,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 86 states have internal predecessors, (125), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 09:57:36,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 09:57:36,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:57:36,511 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:57:36,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:57:36,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:57:36,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1509450666, now seen corresponding path program 1 times [2024-10-11 09:57:36,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:57:36,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69680799] [2024-10-11 09:57:36,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:57:36,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:57:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:57:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:57:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:57:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:57:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:57:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:57:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:57:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:57:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:57:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:57:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:57:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:57:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:57:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:57:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:57:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:57:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:57:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:57:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:57:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:57:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:57:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:57:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:57:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:57:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:57:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:57:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:57:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:57:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 09:57:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:57:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 09:57:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:57:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 09:57:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:57:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:57:36,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:57:36,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69680799] [2024-10-11 09:57:36,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69680799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:57:36,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:57:36,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:57:36,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428798689] [2024-10-11 09:57:36,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:57:36,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:57:36,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:57:36,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:57:36,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:57:36,932 INFO L87 Difference]: Start difference. First operand has 122 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 86 states have internal predecessors, (125), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:57:36,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:57:36,971 INFO L93 Difference]: Finished difference Result 241 states and 418 transitions. [2024-10-11 09:57:36,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:57:36,975 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 216 [2024-10-11 09:57:36,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:57:36,984 INFO L225 Difference]: With dead ends: 241 [2024-10-11 09:57:36,984 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 09:57:36,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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 09:57:36,989 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:57:36,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:57:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 09:57:37,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-11 09:57:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 84 states have internal predecessors, (120), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 09:57:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 188 transitions. [2024-10-11 09:57:37,031 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 188 transitions. Word has length 216 [2024-10-11 09:57:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:57:37,032 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 188 transitions. [2024-10-11 09:57:37,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:57:37,032 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 188 transitions. [2024-10-11 09:57:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 09:57:37,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:57:37,040 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:57:37,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:57:37,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:57:37,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:57:37,041 INFO L85 PathProgramCache]: Analyzing trace with hash -210720654, now seen corresponding path program 1 times [2024-10-11 09:57:37,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:57:37,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874915219] [2024-10-11 09:57:37,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:57:37,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:57:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:57:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:57:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:57:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:57:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:57:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:57:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:57:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:57:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:57:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:57:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:57:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:57:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:57:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:57:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:57:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:57:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:57:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:57:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:57:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:57:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:57:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:57:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:57:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:57:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:57:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:57:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:57:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:57:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 09:57:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:57:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 09:57:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:57:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 09:57:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:57:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:37,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:57:37,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:57:37,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874915219] [2024-10-11 09:57:37,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874915219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:57:37,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:57:37,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:57:37,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76769182] [2024-10-11 09:57:37,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:57:37,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:57:37,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:57:37,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:57:37,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:57:37,569 INFO L87 Difference]: Start difference. First operand 120 states and 188 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:57:37,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:57:37,753 INFO L93 Difference]: Finished difference Result 359 states and 563 transitions. [2024-10-11 09:57:37,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:57:37,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2024-10-11 09:57:37,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:57:37,757 INFO L225 Difference]: With dead ends: 359 [2024-10-11 09:57:37,757 INFO L226 Difference]: Without dead ends: 240 [2024-10-11 09:57:37,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 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 09:57:37,759 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 163 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:57:37,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 542 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:57:37,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-11 09:57:37,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 207. [2024-10-11 09:57:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 136 states have internal predecessors, (191), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 09:57:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 327 transitions. [2024-10-11 09:57:37,792 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 327 transitions. Word has length 216 [2024-10-11 09:57:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:57:37,793 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 327 transitions. [2024-10-11 09:57:37,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:57:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 327 transitions. [2024-10-11 09:57:37,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 09:57:37,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:57:37,795 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:57:37,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:57:37,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:57:37,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:57:37,796 INFO L85 PathProgramCache]: Analyzing trace with hash 351888086, now seen corresponding path program 1 times [2024-10-11 09:57:37,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:57:37,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539839044] [2024-10-11 09:57:37,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:57:37,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:57:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:57:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:57:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:57:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:57:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:57:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:57:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:57:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:57:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:57:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:57:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:57:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:57:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:57:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:57:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:57:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:57:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:57:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:57:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:57:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:57:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:57:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:57:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:57:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:57:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:57:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:57:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:57:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:57:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 09:57:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:57:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 09:57:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:57:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 09:57:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:57:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:57:55,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:57:55,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539839044] [2024-10-11 09:57:55,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539839044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:57:55,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:57:55,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 09:57:55,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704707452] [2024-10-11 09:57:55,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:57:55,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 09:57:55,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:57:55,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 09:57:55,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:57:55,732 INFO L87 Difference]: Start difference. First operand 207 states and 327 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:57:56,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:57:56,450 INFO L93 Difference]: Finished difference Result 468 states and 717 transitions. [2024-10-11 09:57:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 09:57:56,451 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2024-10-11 09:57:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:57:56,453 INFO L225 Difference]: With dead ends: 468 [2024-10-11 09:57:56,453 INFO L226 Difference]: Without dead ends: 331 [2024-10-11 09:57:56,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-10-11 09:57:56,455 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 393 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:57:56,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 857 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 09:57:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-11 09:57:56,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 250. [2024-10-11 09:57:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 178 states have (on average 1.398876404494382) internal successors, (249), 178 states have internal predecessors, (249), 68 states have call successors, (68), 3 states have call predecessors, (68), 3 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 09:57:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 385 transitions. [2024-10-11 09:57:56,474 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 385 transitions. Word has length 217 [2024-10-11 09:57:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:57:56,474 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 385 transitions. [2024-10-11 09:57:56,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:57:56,475 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 385 transitions. [2024-10-11 09:57:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 09:57:56,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:57:56,477 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:57:56,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:57:56,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:57:56,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:57:56,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1236459816, now seen corresponding path program 1 times [2024-10-11 09:57:56,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:57:56,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008987329] [2024-10-11 09:57:56,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:57:56,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:57:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:58:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:58:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:58:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:58:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:58:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:58:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:58:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:58:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:58:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:58:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:58:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:58:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:58:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:58:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:58:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:58:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:58:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:58:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:58:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:58:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:58:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:58:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:58:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:58:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:58:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:58:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:58:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:58:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 09:58:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:58:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 09:58:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:58:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 09:58:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:58:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:13,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:58:13,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:58:13,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008987329] [2024-10-11 09:58:13,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008987329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:58:13,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:58:13,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 09:58:13,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540543733] [2024-10-11 09:58:13,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:58:13,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 09:58:13,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:58:13,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 09:58:13,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-11 09:58:13,411 INFO L87 Difference]: Start difference. First operand 250 states and 385 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:58:15,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:58:15,305 INFO L93 Difference]: Finished difference Result 520 states and 776 transitions. [2024-10-11 09:58:15,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 09:58:15,305 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 217 [2024-10-11 09:58:15,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:58:15,308 INFO L225 Difference]: With dead ends: 520 [2024-10-11 09:58:15,308 INFO L226 Difference]: Without dead ends: 390 [2024-10-11 09:58:15,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-10-11 09:58:15,311 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 459 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:58:15,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1222 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 09:58:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-11 09:58:15,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 245. [2024-10-11 09:58:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 171 states have (on average 1.3801169590643274) internal successors, (236), 171 states have internal predecessors, (236), 68 states have call successors, (68), 5 states have call predecessors, (68), 5 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 09:58:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 372 transitions. [2024-10-11 09:58:15,347 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 372 transitions. Word has length 217 [2024-10-11 09:58:15,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:58:15,347 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 372 transitions. [2024-10-11 09:58:15,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:58:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 372 transitions. [2024-10-11 09:58:15,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 09:58:15,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:58:15,350 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:58:15,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:58:15,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:58:15,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:58:15,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1587563754, now seen corresponding path program 1 times [2024-10-11 09:58:15,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:58:15,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213057644] [2024-10-11 09:58:15,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:58:15,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:58:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:58:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:58:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:58:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:58:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:58:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:58:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:58:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:58:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:58:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:58:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:58:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:58:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:58:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:58:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:58:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:58:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:58:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:58:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:58:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:58:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:58:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:58:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:58:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:58:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:58:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:58:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:58:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:58:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 09:58:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:58:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 09:58:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:58:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 09:58:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:58:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:58:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:58:15,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:58:15,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213057644] [2024-10-11 09:58:15,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213057644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:58:15,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:58:15,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:58:15,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830968786] [2024-10-11 09:58:15,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:58:15,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:58:15,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:58:15,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:58:15,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:58:15,448 INFO L87 Difference]: Start difference. First operand 245 states and 372 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:58:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:58:15,495 INFO L93 Difference]: Finished difference Result 445 states and 676 transitions. [2024-10-11 09:58:15,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:58:15,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2024-10-11 09:58:15,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:58:15,498 INFO L225 Difference]: With dead ends: 445 [2024-10-11 09:58:15,499 INFO L226 Difference]: Without dead ends: 301 [2024-10-11 09:58:15,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:58:15,500 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 90 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:58:15,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 393 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:58:15,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-11 09:58:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 298. [2024-10-11 09:58:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 215 states have (on average 1.3767441860465117) internal successors, (296), 216 states have internal predecessors, (296), 76 states have call successors, (76), 6 states have call predecessors, (76), 6 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-11 09:58:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 448 transitions. [2024-10-11 09:58:15,528 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 448 transitions. Word has length 217 [2024-10-11 09:58:15,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:58:15,528 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 448 transitions. [2024-10-11 09:58:15,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:58:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 448 transitions. [2024-10-11 09:58:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 09:58:15,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:58:15,531 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:58:15,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 09:58:15,531 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:58:15,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:58:15,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1898056916, now seen corresponding path program 1 times [2024-10-11 09:58:15,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:58:15,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112327682] [2024-10-11 09:58:15,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:58:15,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:58:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat