./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e9518b729fb33f0de408129e2e0e3cb97ea8e11de366001cefdd2574471f584b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:09:41,275 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:09:41,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:09:41,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:09:41,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:09:41,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:09:41,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:09:41,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:09:41,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:09:41,421 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:09:41,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:09:41,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:09:41,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:09:41,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:09:41,424 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:09:41,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:09:41,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:09:41,427 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:09:41,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:09:41,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:09:41,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:09:41,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:09:41,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:09:41,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:09:41,433 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:09:41,434 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:09:41,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:09:41,434 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:09:41,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:09:41,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:09:41,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:09:41,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:09:41,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:09:41,436 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:09:41,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:09:41,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:09:41,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:09:41,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:09:41,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:09:41,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:09:41,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:09:41,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:09:41,442 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/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/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 -> e9518b729fb33f0de408129e2e0e3cb97ea8e11de366001cefdd2574471f584b [2024-11-12 06:09:41,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:09:41,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:09:41,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:09:41,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:09:41,779 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:09:41,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.i [2024-11-12 06:09:43,301 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:09:43,582 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:09:43,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.i [2024-11-12 06:09:43,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7924b340/277cf5719d4448a1b2f5e8e8fcd58406/FLAG48dcc0716 [2024-11-12 06:09:43,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7924b340/277cf5719d4448a1b2f5e8e8fcd58406 [2024-11-12 06:09:43,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:09:43,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:09:43,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:09:43,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:09:43,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:09:43,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:09:43" (1/1) ... [2024-11-12 06:09:43,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd85ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:09:43, skipping insertion in model container [2024-11-12 06:09:43,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:09:43" (1/1) ... [2024-11-12 06:09:43,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:09:43,865 WARN L250 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_operatoramount_amount100_file-92.i[916,929] [2024-11-12 06:09:44,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:09:44,025 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:09:44,041 WARN L250 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_operatoramount_amount100_file-92.i[916,929] [2024-11-12 06:09:44,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:09:44,138 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:09:44,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:09:44 WrapperNode [2024-11-12 06:09:44,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:09:44,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:09:44,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:09:44,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:09:44,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:09:44" (1/1) ... [2024-11-12 06:09:44,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:09:44" (1/1) ... [2024-11-12 06:09:44,233 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 310 [2024-11-12 06:09:44,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:09:44,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:09:44,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:09:44,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:09:44,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:09:44" (1/1) ... [2024-11-12 06:09:44,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:09:44" (1/1) ... [2024-11-12 06:09:44,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:09:44" (1/1) ... [2024-11-12 06:09:44,300 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-11-12 06:09:44,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:09:44" (1/1) ... [2024-11-12 06:09:44,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:09:44" (1/1) ... [2024-11-12 06:09:44,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:09:44" (1/1) ... [2024-11-12 06:09:44,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:09:44" (1/1) ... [2024-11-12 06:09:44,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:09:44" (1/1) ... [2024-11-12 06:09:44,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:09:44" (1/1) ... [2024-11-12 06:09:44,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:09:44,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:09:44,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:09:44,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:09:44,382 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:09:44" (1/1) ... [2024-11-12 06:09:44,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:09:44,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:09:44,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:09:44,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:09:44,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:09:44,491 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:09:44,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:09:44,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:09:44,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:09:44,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:09:44,608 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:09:44,611 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:09:45,427 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-12 06:09:45,427 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:09:45,453 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:09:45,455 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:09:45,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:09:45 BoogieIcfgContainer [2024-11-12 06:09:45,456 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:09:45,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:09:45,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:09:45,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:09:45,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:09:43" (1/3) ... [2024-11-12 06:09:45,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359b4f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:09:45, skipping insertion in model container [2024-11-12 06:09:45,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:09:44" (2/3) ... [2024-11-12 06:09:45,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359b4f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:09:45, skipping insertion in model container [2024-11-12 06:09:45,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:09:45" (3/3) ... [2024-11-12 06:09:45,469 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-92.i [2024-11-12 06:09:45,489 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:09:45,489 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:09:45,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:09:45,572 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;@5eb39fdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:09:45,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:09:45,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 102 states have (on average 1.5) internal successors, (153), 103 states have internal predecessors, (153), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 06:09:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 06:09:45,594 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:09:45,595 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 06:09:45,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:09:45,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:09:45,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1137290694, now seen corresponding path program 1 times [2024-11-12 06:09:45,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:09:45,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384843703] [2024-11-12 06:09:45,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:09:45,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:09:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:09:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:09:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:09:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:09:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:09:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:09:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 06:09:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:09:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 06:09:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 06:09:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 06:09:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 06:09:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:09:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 06:09:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:09:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 06:09:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 06:09:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:09:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:09:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 06:09:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 06:09:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 06:09:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:09:46,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:09:46,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384843703] [2024-11-12 06:09:46,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384843703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:09:46,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:09:46,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:09:46,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325647242] [2024-11-12 06:09:46,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:09:46,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:09:46,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:09:46,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:09:46,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:09:46,259 INFO L87 Difference]: Start difference. First operand has 127 states, 102 states have (on average 1.5) internal successors, (153), 103 states have internal predecessors, (153), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 06:09:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:09:46,306 INFO L93 Difference]: Finished difference Result 247 states and 410 transitions. [2024-11-12 06:09:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:09:46,309 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 159 [2024-11-12 06:09:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:09:46,321 INFO L225 Difference]: With dead ends: 247 [2024-11-12 06:09:46,321 INFO L226 Difference]: Without dead ends: 123 [2024-11-12 06:09:46,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-11-12 06:09:46,331 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:09:46,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:09:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-12 06:09:46,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-12 06:09:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 99 states have internal predecessors, (146), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 06:09:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 190 transitions. [2024-11-12 06:09:46,405 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 190 transitions. Word has length 159 [2024-11-12 06:09:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:09:46,406 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 190 transitions. [2024-11-12 06:09:46,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 06:09:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 190 transitions. [2024-11-12 06:09:46,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 06:09:46,411 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:09:46,411 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 06:09:46,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:09:46,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:09:46,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:09:46,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1680904898, now seen corresponding path program 1 times [2024-11-12 06:09:46,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:09:46,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622657169] [2024-11-12 06:09:46,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:09:46,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:09:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:09:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:09:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:09:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:09:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:09:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:09:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 06:09:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:09:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 06:09:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 06:09:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 06:09:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 06:09:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:09:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 06:09:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:09:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 06:09:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 06:09:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:09:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:09:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 06:09:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 06:09:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 06:09:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:09:47,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:09:47,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622657169] [2024-11-12 06:09:47,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622657169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:09:47,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:09:47,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 06:09:47,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375506931] [2024-11-12 06:09:47,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:09:47,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 06:09:47,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:09:47,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 06:09:47,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 06:09:47,317 INFO L87 Difference]: Start difference. First operand 123 states and 190 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:09:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:09:47,468 INFO L93 Difference]: Finished difference Result 363 states and 564 transitions. [2024-11-12 06:09:47,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 06:09:47,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 159 [2024-11-12 06:09:47,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:09:47,474 INFO L225 Difference]: With dead ends: 363 [2024-11-12 06:09:47,474 INFO L226 Difference]: Without dead ends: 243 [2024-11-12 06:09:47,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-11-12 06:09:47,477 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 134 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:09:47,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 410 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:09:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-12 06:09:47,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2024-11-12 06:09:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 194 states have (on average 1.4742268041237114) internal successors, (286), 194 states have internal predecessors, (286), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-12 06:09:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 374 transitions. [2024-11-12 06:09:47,531 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 374 transitions. Word has length 159 [2024-11-12 06:09:47,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:09:47,535 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 374 transitions. [2024-11-12 06:09:47,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:09:47,536 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 374 transitions. [2024-11-12 06:09:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 06:09:47,542 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:09:47,542 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 06:09:47,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:09:47,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:09:47,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:09:47,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1831185428, now seen corresponding path program 1 times [2024-11-12 06:09:47,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:09:47,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995580625] [2024-11-12 06:09:47,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:09:47,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:09:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:09:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:09:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:09:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:09:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:09:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:09:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 06:09:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:09:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 06:09:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 06:09:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 06:09:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 06:09:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:09:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 06:09:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:09:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 06:09:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 06:09:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:09:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:09:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 06:09:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 06:09:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 06:09:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:09:48,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:09:48,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995580625] [2024-11-12 06:09:48,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995580625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:09:48,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:09:48,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 06:09:48,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323366587] [2024-11-12 06:09:48,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:09:48,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:09:48,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:09:48,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:09:48,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:09:48,263 INFO L87 Difference]: Start difference. First operand 241 states and 374 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:09:48,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:09:48,669 INFO L93 Difference]: Finished difference Result 1039 states and 1595 transitions. [2024-11-12 06:09:48,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:09:48,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-12 06:09:48,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:09:48,679 INFO L225 Difference]: With dead ends: 1039 [2024-11-12 06:09:48,682 INFO L226 Difference]: Without dead ends: 801 [2024-11-12 06:09:48,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:09:48,688 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 594 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 06:09:48,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 719 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 06:09:48,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-11-12 06:09:48,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 493. [2024-11-12 06:09:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 400 states have (on average 1.49) internal successors, (596), 400 states have internal predecessors, (596), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-12 06:09:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 772 transitions. [2024-11-12 06:09:48,776 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 772 transitions. Word has length 160 [2024-11-12 06:09:48,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:09:48,777 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 772 transitions. [2024-11-12 06:09:48,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:09:48,780 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 772 transitions. [2024-11-12 06:09:48,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 06:09:48,787 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:09:48,788 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 06:09:48,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:09:48,788 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:09:48,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:09:48,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1965198934, now seen corresponding path program 1 times [2024-11-12 06:09:48,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:09:48,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294936369] [2024-11-12 06:09:48,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:09:48,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:09:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:09:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:09:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:09:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:09:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:09:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:09:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 06:09:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:09:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 06:09:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 06:09:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 06:09:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 06:09:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:09:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 06:09:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:09:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 06:09:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 06:09:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:09:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:09:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 06:09:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 06:09:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 06:09:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:09:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:09:49,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:09:49,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294936369] [2024-11-12 06:09:49,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294936369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:09:49,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:09:49,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:09:49,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036128393] [2024-11-12 06:09:49,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:09:49,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:09:49,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:09:49,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:09:49,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:09:49,678 INFO L87 Difference]: Start difference. First operand 493 states and 772 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:09:50,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:09:50,664 INFO L93 Difference]: Finished difference Result 1163 states and 1795 transitions. [2024-11-12 06:09:50,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 06:09:50,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-12 06:09:50,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:09:50,671 INFO L225 Difference]: With dead ends: 1163 [2024-11-12 06:09:50,672 INFO L226 Difference]: Without dead ends: 917 [2024-11-12 06:09:50,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-12 06:09:50,675 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1178 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 06:09:50,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 895 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 06:09:50,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-12 06:09:50,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 739. [2024-11-12 06:09:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 602 states have (on average 1.4900332225913622) internal successors, (897), 603 states have internal predecessors, (897), 130 states have call successors, (130), 6 states have call predecessors, (130), 6 states have return successors, (130), 129 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-12 06:09:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1157 transitions. [2024-11-12 06:09:50,790 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1157 transitions. Word has length 160 [2024-11-12 06:09:50,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:09:50,792 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1157 transitions. [2024-11-12 06:09:50,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:09:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1157 transitions. [2024-11-12 06:09:50,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 06:09:50,795 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:09:50,795 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 06:09:50,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 06:09:50,796 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:09:50,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:09:50,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1230100243, now seen corresponding path program 1 times [2024-11-12 06:09:50,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:09:50,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774804535] [2024-11-12 06:09:50,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:09:50,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:09:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:10:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:17,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:10:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:17,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:10:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:17,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:10:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:17,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:10:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:17,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:10:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:17,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 06:10:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:10:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:17,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 06:10:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:17,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 06:10:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:17,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 06:10:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:17,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 06:10:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:17,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:10:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:17,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 06:10:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:17,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:10:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:18,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 06:10:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:18,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 06:10:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:18,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:10:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:18,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:10:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:18,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 06:10:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:18,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 06:10:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:18,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 06:10:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:10:18,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:10:18,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774804535] [2024-11-12 06:10:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774804535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:10:18,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:10:18,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 06:10:18,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71188676] [2024-11-12 06:10:18,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:10:18,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 06:10:18,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:10:18,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 06:10:18,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:10:18,021 INFO L87 Difference]: Start difference. First operand 739 states and 1157 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:10:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:10:23,829 INFO L93 Difference]: Finished difference Result 2625 states and 4046 transitions. [2024-11-12 06:10:23,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 06:10:23,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-12 06:10:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:10:23,842 INFO L225 Difference]: With dead ends: 2625 [2024-11-12 06:10:23,843 INFO L226 Difference]: Without dead ends: 1889 [2024-11-12 06:10:23,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-12 06:10:23,846 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 478 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-12 06:10:23,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 717 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-12 06:10:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2024-11-12 06:10:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 949. [2024-11-12 06:10:23,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 812 states have (on average 1.5160098522167487) internal successors, (1231), 813 states have internal predecessors, (1231), 130 states have call successors, (130), 6 states have call predecessors, (130), 6 states have return successors, (130), 129 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-12 06:10:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1491 transitions. [2024-11-12 06:10:23,940 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1491 transitions. Word has length 160 [2024-11-12 06:10:23,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:10:23,944 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1491 transitions. [2024-11-12 06:10:23,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:10:23,945 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1491 transitions. [2024-11-12 06:10:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 06:10:23,947 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:10:23,947 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 06:10:23,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 06:10:23,948 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:10:23,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:10:23,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1011245525, now seen corresponding path program 1 times [2024-11-12 06:10:23,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:10:23,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737785150] [2024-11-12 06:10:23,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:10:23,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:10:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:10:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:10:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:10:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:10:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:10:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:10:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 06:10:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:10:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 06:10:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 06:10:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 06:10:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 06:10:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 06:10:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 06:10:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 06:10:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 06:10:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 06:10:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 06:10:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:10:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 06:10:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 06:10:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 06:10:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:10:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:10:28,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:10:28,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737785150] [2024-11-12 06:10:28,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737785150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:10:28,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:10:28,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 06:10:28,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652412037] [2024-11-12 06:10:28,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:10:28,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 06:10:28,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:10:28,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 06:10:28,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:10:28,142 INFO L87 Difference]: Start difference. First operand 949 states and 1491 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:10:30,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:10:30,642 INFO L93 Difference]: Finished difference Result 2628 states and 4080 transitions. [2024-11-12 06:10:30,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 06:10:30,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-12 06:10:30,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:10:30,653 INFO L225 Difference]: With dead ends: 2628 [2024-11-12 06:10:30,654 INFO L226 Difference]: Without dead ends: 1682 [2024-11-12 06:10:30,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-12 06:10:30,659 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 384 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 06:10:30,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 751 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 06:10:30,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2024-11-12 06:10:30,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 949. [2024-11-12 06:10:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 812 states have (on average 1.5160098522167487) internal successors, (1231), 813 states have internal predecessors, (1231), 130 states have call successors, (130), 6 states have call predecessors, (130), 6 states have return successors, (130), 129 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-12 06:10:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1491 transitions. [2024-11-12 06:10:30,738 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1491 transitions. Word has length 160 [2024-11-12 06:10:30,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:10:30,739 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1491 transitions. [2024-11-12 06:10:30,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:10:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1491 transitions. [2024-11-12 06:10:30,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 06:10:30,742 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:10:30,743 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 06:10:30,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 06:10:30,743 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:10:30,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:10:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1013499885, now seen corresponding path program 1 times [2024-11-12 06:10:30,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:10:30,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645951945] [2024-11-12 06:10:30,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:10:30,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:10:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat