./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-98.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 2ca3553adc490b1882c729ed973a7e595d2f670660d21ae0813ebe4cc084dcf5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:29:14,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:29:14,355 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:29:14,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:29:14,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:29:14,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:29:14,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:29:14,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:29:14,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:29:14,387 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:29:14,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:29:14,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:29:14,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:29:14,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:29:14,390 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:29:14,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:29:14,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:29:14,390 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:29:14,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:29:14,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:29:14,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:29:14,391 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:29:14,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:29:14,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:29:14,394 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:29:14,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:29:14,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:29:14,394 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:29:14,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:29:14,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:29:14,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:29:14,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:29:14,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:29:14,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:29:14,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:29:14,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:29:14,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:29:14,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:29:14,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:29:14,396 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:29:14,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:29:14,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:29:14,398 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 -> 2ca3553adc490b1882c729ed973a7e595d2f670660d21ae0813ebe4cc084dcf5 [2024-10-24 08:29:14,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:29:14,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:29:14,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:29:14,650 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:29:14,650 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:29:14,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-98.i [2024-10-24 08:29:16,138 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:29:16,327 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:29:16,328 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-98.i [2024-10-24 08:29:16,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83dfb894/d3fba133da22499db21a2ba00dc90d18/FLAG7d5bf4b52 [2024-10-24 08:29:16,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f83dfb894/d3fba133da22499db21a2ba00dc90d18 [2024-10-24 08:29:16,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:29:16,355 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:29:16,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:29:16,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:29:16,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:29:16,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:29:16" (1/1) ... [2024-10-24 08:29:16,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d1e995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:16, skipping insertion in model container [2024-10-24 08:29:16,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:29:16" (1/1) ... [2024-10-24 08:29:16,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:29:16,521 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-98.i[919,932] [2024-10-24 08:29:16,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:29:16,653 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:29:16,663 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-98.i[919,932] [2024-10-24 08:29:16,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:29:16,702 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:29:16,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:16 WrapperNode [2024-10-24 08:29:16,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:29:16,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:29:16,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:29:16,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:29:16,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:16" (1/1) ... [2024-10-24 08:29:16,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:16" (1/1) ... [2024-10-24 08:29:16,788 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2024-10-24 08:29:16,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:29:16,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:29:16,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:29:16,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:29:16,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:16" (1/1) ... [2024-10-24 08:29:16,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:16" (1/1) ... [2024-10-24 08:29:16,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:16" (1/1) ... [2024-10-24 08:29:16,862 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:29:16,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:16" (1/1) ... [2024-10-24 08:29:16,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:16" (1/1) ... [2024-10-24 08:29:16,897 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:16" (1/1) ... [2024-10-24 08:29:16,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:16" (1/1) ... [2024-10-24 08:29:16,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:16" (1/1) ... [2024-10-24 08:29:16,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:16" (1/1) ... [2024-10-24 08:29:16,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:29:16,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:29:16,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:29:16,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:29:16,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:16" (1/1) ... [2024-10-24 08:29:16,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:29:16,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:29:16,981 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-10-24 08:29:16,991 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-10-24 08:29:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:29:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:29:17,030 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:29:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:29:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:29:17,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:29:17,111 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:29:17,113 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:29:17,555 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 08:29:17,555 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:29:17,582 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:29:17,583 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:29:17,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:29:17 BoogieIcfgContainer [2024-10-24 08:29:17,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:29:17,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:29:17,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:29:17,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:29:17,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:29:16" (1/3) ... [2024-10-24 08:29:17,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26161d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:29:17, skipping insertion in model container [2024-10-24 08:29:17,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:29:16" (2/3) ... [2024-10-24 08:29:17,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26161d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:29:17, skipping insertion in model container [2024-10-24 08:29:17,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:29:17" (3/3) ... [2024-10-24 08:29:17,589 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-98.i [2024-10-24 08:29:17,602 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:29:17,603 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:29:17,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:29:17,665 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;@5e82f9c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:29:17,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:29:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 64 states have internal predecessors, (93), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 08:29:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-24 08:29:17,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:29:17,685 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:29:17,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:29:17,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:29:17,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1815936576, now seen corresponding path program 1 times [2024-10-24 08:29:17,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:29:17,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337859668] [2024-10-24 08:29:17,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:29:17,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:29:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:29:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:29:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:29:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:29:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:29:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 08:29:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:29:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:29:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:29:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:29:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:29:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:29:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:29:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:29:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:29:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:29:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:29:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:29:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:29:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:29:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:29:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:29:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 08:29:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 08:29:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 08:29:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 08:29:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 08:29:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 08:29:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 08:29:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 08:29:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-24 08:29:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 08:29:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 08:29:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 08:29:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 08:29:18,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:29:18,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337859668] [2024-10-24 08:29:18,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337859668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:29:18,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:29:18,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:29:18,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105449851] [2024-10-24 08:29:18,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:29:18,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:29:18,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:29:18,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:29:18,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:29:18,538 INFO L87 Difference]: Start difference. First operand has 100 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 64 states have internal predecessors, (93), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-24 08:29:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:29:18,574 INFO L93 Difference]: Finished difference Result 195 states and 351 transitions. [2024-10-24 08:29:18,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:29:18,577 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 213 [2024-10-24 08:29:18,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:29:18,585 INFO L225 Difference]: With dead ends: 195 [2024-10-24 08:29:18,585 INFO L226 Difference]: Without dead ends: 96 [2024-10-24 08:29:18,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:29:18,592 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:29:18,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:29:18,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-24 08:29:18,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-24 08:29:18,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 08:29:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 151 transitions. [2024-10-24 08:29:18,648 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 151 transitions. Word has length 213 [2024-10-24 08:29:18,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:29:18,649 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 151 transitions. [2024-10-24 08:29:18,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-24 08:29:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 151 transitions. [2024-10-24 08:29:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-24 08:29:18,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:29:18,656 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:29:18,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:29:18,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:29:18,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:29:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash -280154112, now seen corresponding path program 1 times [2024-10-24 08:29:18,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:29:18,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479163305] [2024-10-24 08:29:18,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:29:18,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:29:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:29:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:29:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:29:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:29:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:29:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 08:29:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:29:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:29:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:29:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:29:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:29:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:29:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:29:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:29:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:29:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:29:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:29:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:29:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:29:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:29:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:29:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:29:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 08:29:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 08:29:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 08:29:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 08:29:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 08:29:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 08:29:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 08:29:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 08:29:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-24 08:29:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 08:29:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 08:29:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 08:29:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 08:29:19,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:29:19,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479163305] [2024-10-24 08:29:19,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479163305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:29:19,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:29:19,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:29:19,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025356852] [2024-10-24 08:29:19,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:29:19,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:29:19,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:29:19,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:29:19,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:29:19,561 INFO L87 Difference]: Start difference. First operand 96 states and 151 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 08:29:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:29:19,738 INFO L93 Difference]: Finished difference Result 286 states and 451 transitions. [2024-10-24 08:29:19,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:29:19,739 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 213 [2024-10-24 08:29:19,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:29:19,741 INFO L225 Difference]: With dead ends: 286 [2024-10-24 08:29:19,742 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 08:29:19,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:29:19,747 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 90 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:29:19,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 260 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:29:19,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 08:29:19,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2024-10-24 08:29:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 118 states have (on average 1.3559322033898304) internal successors, (160), 118 states have internal predecessors, (160), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-24 08:29:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 296 transitions. [2024-10-24 08:29:19,799 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 296 transitions. Word has length 213 [2024-10-24 08:29:19,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:29:19,800 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 296 transitions. [2024-10-24 08:29:19,801 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 08:29:19,801 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 296 transitions. [2024-10-24 08:29:19,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-24 08:29:19,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:29:19,807 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:29:19,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:29:19,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:29:19,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:29:19,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2012483837, now seen corresponding path program 1 times [2024-10-24 08:29:19,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:29:19,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186713940] [2024-10-24 08:29:19,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:29:19,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:29:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:29:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:29:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:29:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:29:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:29:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 08:29:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:29:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:29:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:29:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:29:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:29:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:29:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:29:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:29:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:29:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:29:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:29:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:29:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:29:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:29:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:29:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:29:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 08:29:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 08:29:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 08:29:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 08:29:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 08:29:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 08:29:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 08:29:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 08:29:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-24 08:29:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 08:29:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 08:29:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 08:29:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:29:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 08:29:20,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:29:20,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186713940] [2024-10-24 08:29:20,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186713940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:29:20,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:29:20,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:29:20,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282526402] [2024-10-24 08:29:20,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:29:20,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:29:20,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:29:20,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:29:20,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:29:20,340 INFO L87 Difference]: Start difference. First operand 189 states and 296 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 08:29:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:29:20,452 INFO L93 Difference]: Finished difference Result 358 states and 560 transitions. [2024-10-24 08:29:20,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:29:20,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-10-24 08:29:20,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:29:20,456 INFO L225 Difference]: With dead ends: 358 [2024-10-24 08:29:20,456 INFO L226 Difference]: Without dead ends: 263 [2024-10-24 08:29:20,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:29:20,458 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 143 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:29:20,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 320 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:29:20,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-24 08:29:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 189. [2024-10-24 08:29:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 118 states have (on average 1.3305084745762712) internal successors, (157), 118 states have internal predecessors, (157), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-24 08:29:20,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 293 transitions. [2024-10-24 08:29:20,495 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 293 transitions. Word has length 215 [2024-10-24 08:29:20,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:29:20,496 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 293 transitions. [2024-10-24 08:29:20,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 08:29:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 293 transitions. [2024-10-24 08:29:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-24 08:29:20,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:29:20,498 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:29:20,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:29:20,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:29:20,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:29:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1581418881, now seen corresponding path program 1 times [2024-10-24 08:29:20,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:29:20,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551254925] [2024-10-24 08:29:20,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:29:20,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:29:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:30:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:30:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:30:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:30:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:30:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 08:30:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:30:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:30:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:30:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:30:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:30:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:30:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:30:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:30:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:30:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:30:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:30:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:30:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:30:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:30:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 08:30:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:30:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 08:30:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 08:30:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 08:30:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 08:30:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 08:30:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 08:30:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 08:30:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 08:30:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-24 08:30:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-24 08:30:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-24 08:30:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 08:30:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:30:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 08:30:10,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:30:10,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551254925] [2024-10-24 08:30:10,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551254925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:30:10,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:30:10,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 08:30:10,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872447528] [2024-10-24 08:30:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:30:10,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 08:30:10,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:30:10,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 08:30:10,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-24 08:30:10,563 INFO L87 Difference]: Start difference. First operand 189 states and 293 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 08:30:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:30:11,228 INFO L93 Difference]: Finished difference Result 406 states and 628 transitions. [2024-10-24 08:30:11,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 08:30:11,229 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-10-24 08:30:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:30:11,231 INFO L225 Difference]: With dead ends: 406 [2024-10-24 08:30:11,231 INFO L226 Difference]: Without dead ends: 218 [2024-10-24 08:30:11,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2024-10-24 08:30:11,233 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 72 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 08:30:11,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 433 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 08:30:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-24 08:30:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2024-10-24 08:30:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 142 states have (on average 1.3450704225352113) internal successors, (191), 142 states have internal predecessors, (191), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-24 08:30:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 327 transitions. [2024-10-24 08:30:11,292 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 327 transitions. Word has length 215 [2024-10-24 08:30:11,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:30:11,293 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 327 transitions. [2024-10-24 08:30:11,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 08:30:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 327 transitions. [2024-10-24 08:30:11,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-24 08:30:11,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:30:11,295 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:30:11,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:30:11,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:30:11,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:30:11,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1897867963, now seen corresponding path program 1 times [2024-10-24 08:30:11,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:30:11,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564357933] [2024-10-24 08:30:11,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:30:11,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:30:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat