./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-63.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 577634e4ca5e5062d04a888d1f269694da9d1fc5e92895960c37cfcca177a593 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:27:00,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:27:00,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:27:00,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:27:00,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:27:00,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:27:00,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:27:00,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:27:00,263 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:27:00,264 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:27:00,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:27:00,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:27:00,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:27:00,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:27:00,269 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:27:00,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:27:00,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:27:00,270 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:27:00,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:27:00,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:27:00,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:27:00,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:27:00,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:27:00,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:27:00,273 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:27:00,273 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:27:00,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:27:00,274 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:27:00,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:27:00,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:27:00,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:27:00,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:27:00,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:27:00,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:27:00,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:27:00,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:27:00,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:27:00,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:27:00,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:27:00,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:27:00,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:27:00,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:27:00,280 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 -> 577634e4ca5e5062d04a888d1f269694da9d1fc5e92895960c37cfcca177a593 [2024-11-09 00:27:00,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:27:00,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:27:00,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:27:00,597 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:27:00,597 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:27:00,599 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-63.i [2024-11-09 00:27:02,137 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:27:02,384 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:27:02,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-63.i [2024-11-09 00:27:02,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c8bc3b7/d7c232b71e6d45099a0576a1fec85f71/FLAGfe1ab2ab5 [2024-11-09 00:27:02,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c8bc3b7/d7c232b71e6d45099a0576a1fec85f71 [2024-11-09 00:27:02,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:27:02,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:27:02,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:27:02,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:27:02,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:27:02,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:27:02" (1/1) ... [2024-11-09 00:27:02,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dada65e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:02, skipping insertion in model container [2024-11-09 00:27:02,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:27:02" (1/1) ... [2024-11-09 00:27:02,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:27:02,967 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-63.i[916,929] [2024-11-09 00:27:03,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:27:03,213 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:27:03,231 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-63.i[916,929] [2024-11-09 00:27:03,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:27:03,308 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:27:03,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:03 WrapperNode [2024-11-09 00:27:03,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:27:03,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:27:03,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:27:03,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:27:03,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:03" (1/1) ... [2024-11-09 00:27:03,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:03" (1/1) ... [2024-11-09 00:27:03,402 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2024-11-09 00:27:03,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:27:03,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:27:03,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:27:03,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:27:03,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:03" (1/1) ... [2024-11-09 00:27:03,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:03" (1/1) ... [2024-11-09 00:27:03,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:03" (1/1) ... [2024-11-09 00:27:03,466 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-09 00:27:03,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:03" (1/1) ... [2024-11-09 00:27:03,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:03" (1/1) ... [2024-11-09 00:27:03,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:03" (1/1) ... [2024-11-09 00:27:03,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:03" (1/1) ... [2024-11-09 00:27:03,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:03" (1/1) ... [2024-11-09 00:27:03,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:03" (1/1) ... [2024-11-09 00:27:03,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:27:03,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:27:03,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:27:03,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:27:03,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:03" (1/1) ... [2024-11-09 00:27:03,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:27:03,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:27:03,565 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-09 00:27:03,569 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-09 00:27:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:27:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:27:03,620 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:27:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:27:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:27:03,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:27:03,714 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:27:03,717 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:27:04,269 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-09 00:27:04,270 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:27:04,285 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:27:04,286 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:27:04,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:27:04 BoogieIcfgContainer [2024-11-09 00:27:04,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:27:04,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:27:04,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:27:04,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:27:04,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:27:02" (1/3) ... [2024-11-09 00:27:04,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676d6bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:27:04, skipping insertion in model container [2024-11-09 00:27:04,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:03" (2/3) ... [2024-11-09 00:27:04,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676d6bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:27:04, skipping insertion in model container [2024-11-09 00:27:04,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:27:04" (3/3) ... [2024-11-09 00:27:04,294 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-63.i [2024-11-09 00:27:04,313 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:27:04,313 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:27:04,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:27:04,376 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;@3f8eab17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:27:04,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:27:04,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:27:04,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 00:27:04,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:04,396 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:04,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:04,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:04,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1070429098, now seen corresponding path program 1 times [2024-11-09 00:27:04,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:04,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977675294] [2024-11-09 00:27:04,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:04,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:27:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:27:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:27:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:27:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:27:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:27:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:27:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:27:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:27:05,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:05,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977675294] [2024-11-09 00:27:05,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977675294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:05,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:05,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:27:05,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277060417] [2024-11-09 00:27:05,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:05,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:27:05,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:05,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:27:05,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:27:05,202 INFO L87 Difference]: Start difference. First operand has 89 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:05,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:05,270 INFO L93 Difference]: Finished difference Result 170 states and 290 transitions. [2024-11-09 00:27:05,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:27:05,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-09 00:27:05,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:05,285 INFO L225 Difference]: With dead ends: 170 [2024-11-09 00:27:05,286 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 00:27:05,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-09 00:27:05,296 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:05,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:27:05,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 00:27:05,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 00:27:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:27:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 126 transitions. [2024-11-09 00:27:05,350 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 126 transitions. Word has length 143 [2024-11-09 00:27:05,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:05,352 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 126 transitions. [2024-11-09 00:27:05,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions. [2024-11-09 00:27:05,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 00:27:05,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:05,356 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:05,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:27:05,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:05,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:05,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1901089290, now seen corresponding path program 1 times [2024-11-09 00:27:05,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:05,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424050506] [2024-11-09 00:27:05,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:05,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:27:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:27:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:27:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:27:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:27:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:27:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:27:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:27:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:27:05,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:05,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424050506] [2024-11-09 00:27:05,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424050506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:05,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:05,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:27:05,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638867942] [2024-11-09 00:27:05,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:05,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:27:05,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:05,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:27:05,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:27:05,725 INFO L87 Difference]: Start difference. First operand 84 states and 126 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:05,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:05,815 INFO L93 Difference]: Finished difference Result 216 states and 323 transitions. [2024-11-09 00:27:05,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:27:05,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-09 00:27:05,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:05,819 INFO L225 Difference]: With dead ends: 216 [2024-11-09 00:27:05,819 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 00:27:05,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-09 00:27:05,823 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 74 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:05,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 231 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:27:05,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 00:27:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2024-11-09 00:27:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 101 states have (on average 1.386138613861386) internal successors, (140), 102 states have internal predecessors, (140), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 00:27:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 196 transitions. [2024-11-09 00:27:05,881 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 196 transitions. Word has length 143 [2024-11-09 00:27:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:05,883 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 196 transitions. [2024-11-09 00:27:05,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 196 transitions. [2024-11-09 00:27:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 00:27:05,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:05,890 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:05,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:27:05,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:05,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:05,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1940507320, now seen corresponding path program 1 times [2024-11-09 00:27:05,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:05,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938704554] [2024-11-09 00:27:05,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:05,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:27:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:27:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:27:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:27:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:27:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:27:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:27:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:27:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:27:06,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:06,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938704554] [2024-11-09 00:27:06,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938704554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:06,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:06,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:27:06,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165299941] [2024-11-09 00:27:06,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:06,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:27:06,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:06,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:27:06,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:27:06,560 INFO L87 Difference]: Start difference. First operand 132 states and 196 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:06,789 INFO L93 Difference]: Finished difference Result 379 states and 563 transitions. [2024-11-09 00:27:06,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:27:06,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-09 00:27:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:06,795 INFO L225 Difference]: With dead ends: 379 [2024-11-09 00:27:06,796 INFO L226 Difference]: Without dead ends: 250 [2024-11-09 00:27:06,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:27:06,798 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 90 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:06,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 350 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:27:06,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-09 00:27:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 188. [2024-11-09 00:27:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 136 states have internal predecessors, (180), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 00:27:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 276 transitions. [2024-11-09 00:27:06,836 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 276 transitions. Word has length 143 [2024-11-09 00:27:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:06,840 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 276 transitions. [2024-11-09 00:27:06,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:06,841 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 276 transitions. [2024-11-09 00:27:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 00:27:06,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:06,843 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:06,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:27:06,844 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:06,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:06,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1721652602, now seen corresponding path program 1 times [2024-11-09 00:27:06,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:06,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709392088] [2024-11-09 00:27:06,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:06,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:27:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:27:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:27:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:27:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:27:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:27:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:27:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:27:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:27:12,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:12,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709392088] [2024-11-09 00:27:12,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709392088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:12,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:12,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 00:27:12,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923311467] [2024-11-09 00:27:12,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:12,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 00:27:12,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:12,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 00:27:12,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 00:27:12,891 INFO L87 Difference]: Start difference. First operand 188 states and 276 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:14,175 INFO L93 Difference]: Finished difference Result 521 states and 760 transitions. [2024-11-09 00:27:14,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 00:27:14,176 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-09 00:27:14,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:14,179 INFO L225 Difference]: With dead ends: 521 [2024-11-09 00:27:14,179 INFO L226 Difference]: Without dead ends: 392 [2024-11-09 00:27:14,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2024-11-09 00:27:14,188 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 759 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:14,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 831 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 00:27:14,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-09 00:27:14,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 213. [2024-11-09 00:27:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 160 states have (on average 1.3625) internal successors, (218), 161 states have internal predecessors, (218), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 00:27:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 314 transitions. [2024-11-09 00:27:14,232 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 314 transitions. Word has length 143 [2024-11-09 00:27:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:14,233 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 314 transitions. [2024-11-09 00:27:14,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 314 transitions. [2024-11-09 00:27:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 00:27:14,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:14,235 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:14,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:27:14,236 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:14,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:14,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1463487164, now seen corresponding path program 1 times [2024-11-09 00:27:14,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:14,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869476904] [2024-11-09 00:27:14,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:14,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:27:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:27:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:27:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:27:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:27:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:27:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:27:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:27:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:27:23,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:23,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869476904] [2024-11-09 00:27:23,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869476904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:23,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:23,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 00:27:23,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860885159] [2024-11-09 00:27:23,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:23,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 00:27:23,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:23,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 00:27:23,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-09 00:27:23,414 INFO L87 Difference]: Start difference. First operand 213 states and 314 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:25,924 INFO L93 Difference]: Finished difference Result 682 states and 991 transitions. [2024-11-09 00:27:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 00:27:25,925 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-09 00:27:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:25,930 INFO L225 Difference]: With dead ends: 682 [2024-11-09 00:27:25,930 INFO L226 Difference]: Without dead ends: 530 [2024-11-09 00:27:25,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2024-11-09 00:27:25,932 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 492 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:25,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 889 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 00:27:25,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-09 00:27:25,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 247. [2024-11-09 00:27:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 194 states have (on average 1.3865979381443299) internal successors, (269), 195 states have internal predecessors, (269), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 00:27:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 365 transitions. [2024-11-09 00:27:25,961 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 365 transitions. Word has length 143 [2024-11-09 00:27:25,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:25,962 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 365 transitions. [2024-11-09 00:27:25,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 365 transitions. [2024-11-09 00:27:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 00:27:25,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:25,964 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:25,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 00:27:25,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:25,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:25,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1298950776, now seen corresponding path program 1 times [2024-11-09 00:27:25,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:25,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566765258] [2024-11-09 00:27:25,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:25,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:27:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:27:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:27:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:27:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:27:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:27:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:27:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:27:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:27:26,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:26,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566765258] [2024-11-09 00:27:26,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566765258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:26,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:26,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:27:26,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897266535] [2024-11-09 00:27:26,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:26,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:27:26,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:26,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:27:26,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:27:26,204 INFO L87 Difference]: Start difference. First operand 247 states and 365 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:26,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:26,389 INFO L93 Difference]: Finished difference Result 523 states and 773 transitions. [2024-11-09 00:27:26,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:27:26,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-09 00:27:26,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:26,392 INFO L225 Difference]: With dead ends: 523 [2024-11-09 00:27:26,393 INFO L226 Difference]: Without dead ends: 350 [2024-11-09 00:27:26,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:27:26,396 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 154 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:26,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 318 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:27:26,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-09 00:27:26,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 247. [2024-11-09 00:27:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 194 states have (on average 1.3762886597938144) internal successors, (267), 195 states have internal predecessors, (267), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 00:27:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 363 transitions. [2024-11-09 00:27:26,426 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 363 transitions. Word has length 143 [2024-11-09 00:27:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:26,427 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 363 transitions. [2024-11-09 00:27:26,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:26,428 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 363 transitions. [2024-11-09 00:27:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 00:27:26,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:26,431 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:26,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 00:27:26,431 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:26,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:26,432 INFO L85 PathProgramCache]: Analyzing trace with hash -934673012, now seen corresponding path program 1 times [2024-11-09 00:27:26,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:26,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591277854] [2024-11-09 00:27:26,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:26,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:27:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:27:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:27:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:27:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:27:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:27:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:27:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:27:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:27:26,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:26,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591277854] [2024-11-09 00:27:26,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591277854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:26,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:26,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:27:26,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005569482] [2024-11-09 00:27:26,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:26,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:27:26,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:26,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:27:26,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:27:26,729 INFO L87 Difference]: Start difference. First operand 247 states and 363 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:26,910 INFO L93 Difference]: Finished difference Result 523 states and 769 transitions. [2024-11-09 00:27:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:27:26,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-09 00:27:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:26,914 INFO L225 Difference]: With dead ends: 523 [2024-11-09 00:27:26,914 INFO L226 Difference]: Without dead ends: 350 [2024-11-09 00:27:26,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:27:26,916 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 127 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:26,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 520 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:27:26,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-09 00:27:26,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 254. [2024-11-09 00:27:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 201 states have (on average 1.3781094527363185) internal successors, (277), 202 states have internal predecessors, (277), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 00:27:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2024-11-09 00:27:26,943 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 143 [2024-11-09 00:27:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:26,944 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2024-11-09 00:27:26,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2024-11-09 00:27:26,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 00:27:26,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:26,946 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:26,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 00:27:26,946 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:26,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:26,947 INFO L85 PathProgramCache]: Analyzing trace with hash -676507574, now seen corresponding path program 1 times [2024-11-09 00:27:26,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:26,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128891342] [2024-11-09 00:27:26,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:26,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:27:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:27:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:27:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:27:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:27:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:27:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:27:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:27:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:27:31,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:31,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128891342] [2024-11-09 00:27:31,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128891342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:31,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:31,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 00:27:31,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884774113] [2024-11-09 00:27:31,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:31,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:27:31,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:31,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:27:31,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:27:31,138 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:31,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:31,751 INFO L93 Difference]: Finished difference Result 579 states and 847 transitions. [2024-11-09 00:27:31,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 00:27:31,752 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-09 00:27:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:31,755 INFO L225 Difference]: With dead ends: 579 [2024-11-09 00:27:31,755 INFO L226 Difference]: Without dead ends: 399 [2024-11-09 00:27:31,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-09 00:27:31,757 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 239 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:31,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 453 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 00:27:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-09 00:27:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 291. [2024-11-09 00:27:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 238 states have (on average 1.3907563025210083) internal successors, (331), 239 states have internal predecessors, (331), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 00:27:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 427 transitions. [2024-11-09 00:27:31,781 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 427 transitions. Word has length 143 [2024-11-09 00:27:31,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:31,782 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 427 transitions. [2024-11-09 00:27:31,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:31,782 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 427 transitions. [2024-11-09 00:27:31,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:27:31,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:31,784 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:31,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 00:27:31,784 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:31,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:31,785 INFO L85 PathProgramCache]: Analyzing trace with hash 34422909, now seen corresponding path program 1 times [2024-11-09 00:27:31,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:31,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038220912] [2024-11-09 00:27:31,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:31,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:27:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:27:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:27:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:27:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:27:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:27:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:27:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:27:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:31,961 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:27:31,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:31,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038220912] [2024-11-09 00:27:31,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038220912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:31,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:31,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:27:31,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088294313] [2024-11-09 00:27:31,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:31,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:27:31,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:31,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:27:31,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:27:31,966 INFO L87 Difference]: Start difference. First operand 291 states and 427 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:32,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:32,017 INFO L93 Difference]: Finished difference Result 685 states and 1004 transitions. [2024-11-09 00:27:32,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:27:32,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-09 00:27:32,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:32,023 INFO L225 Difference]: With dead ends: 685 [2024-11-09 00:27:32,024 INFO L226 Difference]: Without dead ends: 468 [2024-11-09 00:27:32,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:27:32,026 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 59 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:32,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 338 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:27:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-09 00:27:32,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 464. [2024-11-09 00:27:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 396 states have (on average 1.393939393939394) internal successors, (552), 399 states have internal predecessors, (552), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 00:27:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 672 transitions. [2024-11-09 00:27:32,056 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 672 transitions. Word has length 144 [2024-11-09 00:27:32,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:32,056 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 672 transitions. [2024-11-09 00:27:32,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:32,057 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 672 transitions. [2024-11-09 00:27:32,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:27:32,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:32,058 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:32,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 00:27:32,059 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:32,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:32,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1305132620, now seen corresponding path program 1 times [2024-11-09 00:27:32,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:32,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340840413] [2024-11-09 00:27:32,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:32,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:27:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:27:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:27:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:27:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:27:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:27:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:27:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:27:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:27:32,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:32,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340840413] [2024-11-09 00:27:32,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340840413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:32,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:32,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:27:32,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129564354] [2024-11-09 00:27:32,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:32,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:27:32,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:32,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:27:32,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:27:32,285 INFO L87 Difference]: Start difference. First operand 464 states and 672 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:32,440 INFO L93 Difference]: Finished difference Result 964 states and 1392 transitions. [2024-11-09 00:27:32,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:27:32,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-09 00:27:32,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:32,445 INFO L225 Difference]: With dead ends: 964 [2024-11-09 00:27:32,445 INFO L226 Difference]: Without dead ends: 610 [2024-11-09 00:27:32,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:27:32,447 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 131 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:32,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 295 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:27:32,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-09 00:27:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 473. [2024-11-09 00:27:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 405 states have (on average 1.3950617283950617) internal successors, (565), 408 states have internal predecessors, (565), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 00:27:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 685 transitions. [2024-11-09 00:27:32,478 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 685 transitions. Word has length 144 [2024-11-09 00:27:32,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:32,478 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 685 transitions. [2024-11-09 00:27:32,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:32,479 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 685 transitions. [2024-11-09 00:27:32,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:27:32,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:32,481 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:32,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 00:27:32,481 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:32,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:32,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1985190990, now seen corresponding path program 1 times [2024-11-09 00:27:32,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:32,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623752416] [2024-11-09 00:27:32,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:32,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:27:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:27:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:27:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:27:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:27:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:27:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:27:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:27:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:27:39,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:39,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623752416] [2024-11-09 00:27:39,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623752416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:39,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:39,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 00:27:39,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915330255] [2024-11-09 00:27:39,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:39,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 00:27:39,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:39,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 00:27:39,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-09 00:27:39,398 INFO L87 Difference]: Start difference. First operand 473 states and 685 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:41,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:41,470 INFO L93 Difference]: Finished difference Result 1210 states and 1736 transitions. [2024-11-09 00:27:41,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 00:27:41,471 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-09 00:27:41,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:41,476 INFO L225 Difference]: With dead ends: 1210 [2024-11-09 00:27:41,476 INFO L226 Difference]: Without dead ends: 847 [2024-11-09 00:27:41,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2024-11-09 00:27:41,479 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 557 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:41,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 808 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 00:27:41,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-11-09 00:27:41,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 475. [2024-11-09 00:27:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 407 states have (on average 1.3955773955773956) internal successors, (568), 410 states have internal predecessors, (568), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 00:27:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 688 transitions. [2024-11-09 00:27:41,517 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 688 transitions. Word has length 144 [2024-11-09 00:27:41,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:41,518 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 688 transitions. [2024-11-09 00:27:41,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:41,518 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 688 transitions. [2024-11-09 00:27:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:27:41,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:41,520 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:41,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 00:27:41,520 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:41,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:41,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1518740254, now seen corresponding path program 1 times [2024-11-09 00:27:41,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:41,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822205789] [2024-11-09 00:27:41,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:41,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:27:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:27:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:27:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:27:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:27:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:27:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:27:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:27:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:27:45,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:45,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822205789] [2024-11-09 00:27:45,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822205789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:45,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:45,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 00:27:45,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115855262] [2024-11-09 00:27:45,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:45,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 00:27:45,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:45,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 00:27:45,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-09 00:27:45,606 INFO L87 Difference]: Start difference. First operand 475 states and 688 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:27:48,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:48,071 INFO L93 Difference]: Finished difference Result 1133 states and 1637 transitions. [2024-11-09 00:27:48,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 00:27:48,071 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 144 [2024-11-09 00:27:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:48,075 INFO L225 Difference]: With dead ends: 1133 [2024-11-09 00:27:48,076 INFO L226 Difference]: Without dead ends: 770 [2024-11-09 00:27:48,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=256, Invalid=736, Unknown=0, NotChecked=0, Total=992 [2024-11-09 00:27:48,078 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 427 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:48,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1131 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 00:27:48,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-11-09 00:27:48,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 506. [2024-11-09 00:27:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 438 states have (on average 1.4109589041095891) internal successors, (618), 441 states have internal predecessors, (618), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 00:27:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 738 transitions. [2024-11-09 00:27:48,112 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 738 transitions. Word has length 144 [2024-11-09 00:27:48,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:48,113 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 738 transitions. [2024-11-09 00:27:48,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:27:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 738 transitions. [2024-11-09 00:27:48,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:27:48,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:48,116 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:48,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 00:27:48,116 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:48,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:48,117 INFO L85 PathProgramCache]: Analyzing trace with hash 170203488, now seen corresponding path program 1 times [2024-11-09 00:27:48,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:48,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44369120] [2024-11-09 00:27:48,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:48,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:27:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:27:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:27:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:27:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:27:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:27:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:27:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:27:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:27:48,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:48,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44369120] [2024-11-09 00:27:48,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44369120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:48,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:48,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 00:27:48,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651284234] [2024-11-09 00:27:48,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:48,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 00:27:48,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:48,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 00:27:48,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 00:27:48,775 INFO L87 Difference]: Start difference. First operand 506 states and 738 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:49,828 INFO L93 Difference]: Finished difference Result 1542 states and 2183 transitions. [2024-11-09 00:27:49,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 00:27:49,829 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-09 00:27:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:49,835 INFO L225 Difference]: With dead ends: 1542 [2024-11-09 00:27:49,835 INFO L226 Difference]: Without dead ends: 1179 [2024-11-09 00:27:49,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2024-11-09 00:27:49,838 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 557 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:49,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 966 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 00:27:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2024-11-09 00:27:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 741. [2024-11-09 00:27:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 655 states have (on average 1.4045801526717556) internal successors, (920), 662 states have internal predecessors, (920), 72 states have call successors, (72), 13 states have call predecessors, (72), 13 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-09 00:27:49,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1064 transitions. [2024-11-09 00:27:49,906 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1064 transitions. Word has length 144 [2024-11-09 00:27:49,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:49,907 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1064 transitions. [2024-11-09 00:27:49,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1064 transitions. [2024-11-09 00:27:49,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:27:49,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:49,911 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:49,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 00:27:49,911 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:49,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash -840913762, now seen corresponding path program 1 times [2024-11-09 00:27:49,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:49,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434086894] [2024-11-09 00:27:49,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:49,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:27:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:27:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:27:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:27:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:27:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:27:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:27:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:27:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:27:50,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:50,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434086894] [2024-11-09 00:27:50,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434086894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:50,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:50,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 00:27:50,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482550818] [2024-11-09 00:27:50,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:50,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:27:50,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:50,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:27:50,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:27:50,228 INFO L87 Difference]: Start difference. First operand 741 states and 1064 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:50,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:50,632 INFO L93 Difference]: Finished difference Result 1948 states and 2784 transitions. [2024-11-09 00:27:50,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 00:27:50,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-09 00:27:50,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:50,642 INFO L225 Difference]: With dead ends: 1948 [2024-11-09 00:27:50,642 INFO L226 Difference]: Without dead ends: 1392 [2024-11-09 00:27:50,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:27:50,645 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 307 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:50,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 547 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:27:50,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2024-11-09 00:27:50,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1215. [2024-11-09 00:27:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1079 states have (on average 1.4040778498609825) internal successors, (1515), 1091 states have internal predecessors, (1515), 116 states have call successors, (116), 19 states have call predecessors, (116), 19 states have return successors, (116), 104 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-09 00:27:50,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1747 transitions. [2024-11-09 00:27:50,742 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1747 transitions. Word has length 144 [2024-11-09 00:27:50,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:50,744 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1747 transitions. [2024-11-09 00:27:50,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:50,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1747 transitions. [2024-11-09 00:27:50,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:27:50,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:50,747 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:50,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 00:27:50,748 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:50,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:50,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1418144414, now seen corresponding path program 1 times [2024-11-09 00:27:50,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:50,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919096178] [2024-11-09 00:27:50,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:50,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:27:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:27:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:27:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:27:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:27:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:27:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:27:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:27:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:27:51,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:51,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919096178] [2024-11-09 00:27:51,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919096178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:51,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:51,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 00:27:51,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881239764] [2024-11-09 00:27:51,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:51,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:27:51,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:51,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:27:51,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:27:51,315 INFO L87 Difference]: Start difference. First operand 1215 states and 1747 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:27:52,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:52,194 INFO L93 Difference]: Finished difference Result 3238 states and 4568 transitions. [2024-11-09 00:27:52,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 00:27:52,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 144 [2024-11-09 00:27:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:52,209 INFO L225 Difference]: With dead ends: 3238 [2024-11-09 00:27:52,209 INFO L226 Difference]: Without dead ends: 2688 [2024-11-09 00:27:52,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:27:52,213 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 368 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:52,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 588 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 00:27:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2024-11-09 00:27:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 1687. [2024-11-09 00:27:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1527 states have (on average 1.4197773411918795) internal successors, (2168), 1545 states have internal predecessors, (2168), 132 states have call successors, (132), 27 states have call predecessors, (132), 27 states have return successors, (132), 114 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-09 00:27:52,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2432 transitions. [2024-11-09 00:27:52,355 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2432 transitions. Word has length 144 [2024-11-09 00:27:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:52,356 INFO L471 AbstractCegarLoop]: Abstraction has 1687 states and 2432 transitions. [2024-11-09 00:27:52,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:27:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2432 transitions. [2024-11-09 00:27:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:27:52,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:52,359 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:52,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 00:27:52,359 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:52,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:52,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1501033579, now seen corresponding path program 1 times [2024-11-09 00:27:52,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:52,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305289705] [2024-11-09 00:27:52,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:52,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:27:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:27:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:27:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:27:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:27:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:27:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:27:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:27:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:27:52,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:52,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305289705] [2024-11-09 00:27:52,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305289705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:52,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:52,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:27:52,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918983623] [2024-11-09 00:27:52,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:52,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:27:52,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:52,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:27:52,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:27:52,598 INFO L87 Difference]: Start difference. First operand 1687 states and 2432 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:52,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:52,845 INFO L93 Difference]: Finished difference Result 3863 states and 5511 transitions. [2024-11-09 00:27:52,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:27:52,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-09 00:27:52,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:52,858 INFO L225 Difference]: With dead ends: 3863 [2024-11-09 00:27:52,858 INFO L226 Difference]: Without dead ends: 2321 [2024-11-09 00:27:52,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:27:52,863 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 140 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:52,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 409 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:27:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2024-11-09 00:27:52,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 1308. [2024-11-09 00:27:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 1190 states have (on average 1.3991596638655461) internal successors, (1665), 1200 states have internal predecessors, (1665), 96 states have call successors, (96), 21 states have call predecessors, (96), 21 states have return successors, (96), 86 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-09 00:27:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1857 transitions. [2024-11-09 00:27:52,989 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1857 transitions. Word has length 144 [2024-11-09 00:27:52,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:52,990 INFO L471 AbstractCegarLoop]: Abstraction has 1308 states and 1857 transitions. [2024-11-09 00:27:52,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:27:52,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1857 transitions. [2024-11-09 00:27:52,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:27:52,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:52,992 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:52,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 00:27:52,993 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:52,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:52,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1394921253, now seen corresponding path program 1 times [2024-11-09 00:27:52,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:52,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111330324] [2024-11-09 00:27:52,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:52,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:28:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:28:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:28:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:28:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:28:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:28:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:28:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:28:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:28:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:28:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:28:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:28:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:28:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:28:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:28:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:28:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:28:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:28:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:28:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:28:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:28:00,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:28:00,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111330324] [2024-11-09 00:28:00,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111330324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:28:00,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:28:00,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 00:28:00,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771387267] [2024-11-09 00:28:00,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:28:00,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 00:28:00,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:28:00,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 00:28:00,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 00:28:00,225 INFO L87 Difference]: Start difference. First operand 1308 states and 1857 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:28:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:28:02,135 INFO L93 Difference]: Finished difference Result 3335 states and 4732 transitions. [2024-11-09 00:28:02,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 00:28:02,135 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-09 00:28:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:28:02,144 INFO L225 Difference]: With dead ends: 3335 [2024-11-09 00:28:02,144 INFO L226 Difference]: Without dead ends: 2128 [2024-11-09 00:28:02,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2024-11-09 00:28:02,148 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 540 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:28:02,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 955 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 00:28:02,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2024-11-09 00:28:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 1615. [2024-11-09 00:28:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1497 states have (on average 1.4141616566466266) internal successors, (2117), 1507 states have internal predecessors, (2117), 96 states have call successors, (96), 21 states have call predecessors, (96), 21 states have return successors, (96), 86 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-09 00:28:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2309 transitions. [2024-11-09 00:28:02,272 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2309 transitions. Word has length 144 [2024-11-09 00:28:02,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:28:02,273 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2309 transitions. [2024-11-09 00:28:02,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:28:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2309 transitions. [2024-11-09 00:28:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:28:02,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:28:02,275 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:28:02,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 00:28:02,276 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:28:02,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:28:02,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1136755815, now seen corresponding path program 1 times [2024-11-09 00:28:02,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:28:02,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767454748] [2024-11-09 00:28:02,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:28:02,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:28:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:28:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:28:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:28:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:28:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:28:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:28:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:28:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:28:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:28:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:28:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:28:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:28:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:28:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:28:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:28:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:28:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:28:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:28:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:28:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:28:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,345 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:28:03,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:28:03,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767454748] [2024-11-09 00:28:03,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767454748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:28:03,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:28:03,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 00:28:03,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999466749] [2024-11-09 00:28:03,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:28:03,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 00:28:03,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:28:03,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 00:28:03,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 00:28:03,347 INFO L87 Difference]: Start difference. First operand 1615 states and 2309 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:28:04,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:28:04,626 INFO L93 Difference]: Finished difference Result 2799 states and 3922 transitions. [2024-11-09 00:28:04,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 00:28:04,626 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-09 00:28:04,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:28:04,634 INFO L225 Difference]: With dead ends: 2799 [2024-11-09 00:28:04,634 INFO L226 Difference]: Without dead ends: 2216 [2024-11-09 00:28:04,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2024-11-09 00:28:04,636 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 403 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:28:04,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1089 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 00:28:04,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2024-11-09 00:28:04,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 1626. [2024-11-09 00:28:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1508 states have (on average 1.4137931034482758) internal successors, (2132), 1518 states have internal predecessors, (2132), 96 states have call successors, (96), 21 states have call predecessors, (96), 21 states have return successors, (96), 86 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-09 00:28:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2324 transitions. [2024-11-09 00:28:04,758 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2324 transitions. Word has length 144 [2024-11-09 00:28:04,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:28:04,759 INFO L471 AbstractCegarLoop]: Abstraction has 1626 states and 2324 transitions. [2024-11-09 00:28:04,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:28:04,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2324 transitions. [2024-11-09 00:28:04,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:28:04,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:28:04,761 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:28:04,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 00:28:04,761 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:28:04,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:28:04,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1336497191, now seen corresponding path program 1 times [2024-11-09 00:28:04,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:28:04,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427723689] [2024-11-09 00:28:04,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:28:04,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:28:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:04,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:28:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:04,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:28:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:04,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:28:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:04,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:28:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:04,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:28:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:04,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:28:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:04,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:28:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:04,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:28:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:04,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:28:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:04,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:28:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:04,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:28:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:04,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:28:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:04,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:28:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:04,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:28:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:05,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:28:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:05,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:28:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:05,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:28:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:05,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:28:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:05,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:28:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:05,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:28:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:05,009 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:28:05,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:28:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427723689] [2024-11-09 00:28:05,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427723689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:28:05,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:28:05,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:28:05,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053876710] [2024-11-09 00:28:05,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:28:05,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:28:05,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:28:05,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:28:05,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:28:05,012 INFO L87 Difference]: Start difference. First operand 1626 states and 2324 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:28:05,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:28:05,410 INFO L93 Difference]: Finished difference Result 3715 states and 5302 transitions. [2024-11-09 00:28:05,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:28:05,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-09 00:28:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:28:05,420 INFO L225 Difference]: With dead ends: 3715 [2024-11-09 00:28:05,421 INFO L226 Difference]: Without dead ends: 2519 [2024-11-09 00:28:05,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:28:05,424 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 203 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:28:05,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 503 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:28:05,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2024-11-09 00:28:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 1711. [2024-11-09 00:28:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1593 states have (on average 1.408662900188324) internal successors, (2244), 1603 states have internal predecessors, (2244), 96 states have call successors, (96), 21 states have call predecessors, (96), 21 states have return successors, (96), 86 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-09 00:28:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2436 transitions. [2024-11-09 00:28:05,562 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2436 transitions. Word has length 144 [2024-11-09 00:28:05,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:28:05,563 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2436 transitions. [2024-11-09 00:28:05,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:28:05,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2436 transitions. [2024-11-09 00:28:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:28:05,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:28:05,565 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:28:05,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 00:28:05,565 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:28:05,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:28:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1078331753, now seen corresponding path program 1 times [2024-11-09 00:28:05,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:28:05,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481910624] [2024-11-09 00:28:05,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:28:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:28:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat