./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.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 ef5fa028017d876074069fbbea93055df8f895424627b4673992e11de8e7d01a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:01:10,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:01:10,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:01:11,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:01:11,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:01:11,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:01:11,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:01:11,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:01:11,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:01:11,049 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:01:11,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:01:11,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:01:11,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:01:11,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:01:11,052 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:01:11,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:01:11,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:01:11,056 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:01:11,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:01:11,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:01:11,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:01:11,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:01:11,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:01:11,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:01:11,061 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:01:11,062 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:01:11,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:01:11,062 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:01:11,062 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:01:11,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:01:11,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:01:11,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:01:11,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:01:11,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:01:11,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:01:11,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:01:11,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:01:11,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:01:11,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:01:11,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:01:11,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:01:11,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:01:11,066 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 -> ef5fa028017d876074069fbbea93055df8f895424627b4673992e11de8e7d01a [2024-11-12 01:01:11,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:01:11,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:01:11,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:01:11,369 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:01:11,370 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:01:11,371 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i [2024-11-12 01:01:12,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:01:13,147 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:01:13,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i [2024-11-12 01:01:13,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1557a2fcf/917df6719ac1456fa52104c3f0163a6b/FLAG660d5a015 [2024-11-12 01:01:13,171 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1557a2fcf/917df6719ac1456fa52104c3f0163a6b [2024-11-12 01:01:13,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:01:13,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:01:13,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:01:13,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:01:13,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:01:13,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:01:13" (1/1) ... [2024-11-12 01:01:13,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574dc1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:13, skipping insertion in model container [2024-11-12 01:01:13,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:01:13" (1/1) ... [2024-11-12 01:01:13,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:01:13,393 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_codestructure_dependencies_file-34.i[919,932] [2024-11-12 01:01:13,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:01:13,467 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:01:13,481 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_codestructure_dependencies_file-34.i[919,932] [2024-11-12 01:01:13,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:01:13,541 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:01:13,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:13 WrapperNode [2024-11-12 01:01:13,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:01:13,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:01:13,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:01:13,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:01:13,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:13" (1/1) ... [2024-11-12 01:01:13,568 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:13" (1/1) ... [2024-11-12 01:01:13,624 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-11-12 01:01:13,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:01:13,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:01:13,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:01:13,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:01:13,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:13" (1/1) ... [2024-11-12 01:01:13,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:13" (1/1) ... [2024-11-12 01:01:13,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:13" (1/1) ... [2024-11-12 01:01:13,682 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:01:13,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:13" (1/1) ... [2024-11-12 01:01:13,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:13" (1/1) ... [2024-11-12 01:01:13,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:13" (1/1) ... [2024-11-12 01:01:13,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:13" (1/1) ... [2024-11-12 01:01:13,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:13" (1/1) ... [2024-11-12 01:01:13,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:13" (1/1) ... [2024-11-12 01:01:13,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:01:13,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:01:13,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:01:13,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:01:13,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:13" (1/1) ... [2024-11-12 01:01:13,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:01:13,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:01:13,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:01:13,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:01:13,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:01:13,818 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:01:13,820 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:01:13,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:01:13,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:01:13,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:01:13,895 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:01:13,897 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:01:14,346 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 01:01:14,347 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:01:14,368 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:01:14,369 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:01:14,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:01:14 BoogieIcfgContainer [2024-11-12 01:01:14,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:01:14,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:01:14,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:01:14,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:01:14,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:01:13" (1/3) ... [2024-11-12 01:01:14,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e6408e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:01:14, skipping insertion in model container [2024-11-12 01:01:14,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:01:13" (2/3) ... [2024-11-12 01:01:14,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e6408e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:01:14, skipping insertion in model container [2024-11-12 01:01:14,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:01:14" (3/3) ... [2024-11-12 01:01:14,382 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-34.i [2024-11-12 01:01:14,399 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:01:14,399 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:01:14,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:01:14,468 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;@34880030, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:01:14,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:01:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 01:01:14,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 01:01:14,485 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:01:14,486 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:01:14,486 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:01:14,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:01:14,495 INFO L85 PathProgramCache]: Analyzing trace with hash -752802284, now seen corresponding path program 1 times [2024-11-12 01:01:14,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:01:14,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522699094] [2024-11-12 01:01:14,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:01:14,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:01:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:14,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:01:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:14,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:01:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:14,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:01:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:14,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:01:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:14,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:01:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:14,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:01:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:14,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:01:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:14,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:01:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:14,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:01:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:14,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:01:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:14,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:01:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:14,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:01:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:14,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:01:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:01:14,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:01:14,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522699094] [2024-11-12 01:01:14,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522699094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:01:14,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:01:14,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:01:14,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723178590] [2024-11-12 01:01:14,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:01:14,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:01:14,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:01:14,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:01:14,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:01:14,998 INFO L87 Difference]: Start difference. First operand has 69 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 01:01:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:01:15,026 INFO L93 Difference]: Finished difference Result 131 states and 219 transitions. [2024-11-12 01:01:15,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:01:15,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 92 [2024-11-12 01:01:15,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:01:15,041 INFO L225 Difference]: With dead ends: 131 [2024-11-12 01:01:15,041 INFO L226 Difference]: Without dead ends: 65 [2024-11-12 01:01:15,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:01:15,051 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:01:15,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:01:15,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-12 01:01:15,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-12 01:01:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 50 states have internal predecessors, (73), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 01:01:15,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 99 transitions. [2024-11-12 01:01:15,093 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 99 transitions. Word has length 92 [2024-11-12 01:01:15,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:01:15,094 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 99 transitions. [2024-11-12 01:01:15,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 01:01:15,095 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 99 transitions. [2024-11-12 01:01:15,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 01:01:15,099 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:01:15,099 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:01:15,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:01:15,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:01:15,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:01:15,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1571084566, now seen corresponding path program 1 times [2024-11-12 01:01:15,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:01:15,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312589101] [2024-11-12 01:01:15,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:01:15,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:01:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:15,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:01:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:15,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:01:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:15,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:01:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:15,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:01:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:15,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:01:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:15,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:01:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:15,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:01:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:15,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:01:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:15,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:01:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:15,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:01:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:15,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:01:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:15,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:01:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:15,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:01:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:01:15,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:01:15,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312589101] [2024-11-12 01:01:15,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312589101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:01:15,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:01:15,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:01:15,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320247200] [2024-11-12 01:01:15,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:01:15,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:01:15,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:01:15,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:01:15,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:01:15,652 INFO L87 Difference]: Start difference. First operand 65 states and 99 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:01:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:01:15,828 INFO L93 Difference]: Finished difference Result 217 states and 334 transitions. [2024-11-12 01:01:15,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:01:15,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-11-12 01:01:15,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:01:15,833 INFO L225 Difference]: With dead ends: 217 [2024-11-12 01:01:15,833 INFO L226 Difference]: Without dead ends: 155 [2024-11-12 01:01:15,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-12 01:01:15,835 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 125 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 01:01:15,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 313 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 01:01:15,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-12 01:01:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 127. [2024-11-12 01:01:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 98 states have internal predecessors, (143), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:01:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 195 transitions. [2024-11-12 01:01:15,866 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 195 transitions. Word has length 92 [2024-11-12 01:01:15,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:01:15,866 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 195 transitions. [2024-11-12 01:01:15,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:01:15,867 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 195 transitions. [2024-11-12 01:01:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 01:01:15,868 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:01:15,869 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:01:15,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:01:15,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:01:15,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:01:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash 682914376, now seen corresponding path program 1 times [2024-11-12 01:01:15,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:01:15,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682163379] [2024-11-12 01:01:15,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:01:15,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:01:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:16,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:01:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:16,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:01:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:16,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:01:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:16,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:01:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:16,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:01:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:16,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:01:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:16,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:01:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:16,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:01:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:16,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:01:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:16,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:01:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:16,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:01:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:16,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:01:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:16,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:01:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:01:16,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:01:16,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682163379] [2024-11-12 01:01:16,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682163379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:01:16,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:01:16,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:01:16,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135457725] [2024-11-12 01:01:16,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:01:16,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:01:16,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:01:16,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:01:16,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:01:16,253 INFO L87 Difference]: Start difference. First operand 127 states and 195 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:01:16,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:01:16,507 INFO L93 Difference]: Finished difference Result 406 states and 619 transitions. [2024-11-12 01:01:16,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:01:16,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-11-12 01:01:16,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:01:16,512 INFO L225 Difference]: With dead ends: 406 [2024-11-12 01:01:16,514 INFO L226 Difference]: Without dead ends: 282 [2024-11-12 01:01:16,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-12 01:01:16,518 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 159 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:01:16,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 246 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:01:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-12 01:01:16,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 129. [2024-11-12 01:01:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 100 states have (on average 1.43) internal successors, (143), 100 states have internal predecessors, (143), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:01:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 195 transitions. [2024-11-12 01:01:16,551 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 195 transitions. Word has length 93 [2024-11-12 01:01:16,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:01:16,552 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 195 transitions. [2024-11-12 01:01:16,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:01:16,554 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 195 transitions. [2024-11-12 01:01:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 01:01:16,557 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:01:16,558 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:01:16,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 01:01:16,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:01:16,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:01:16,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1846383539, now seen corresponding path program 1 times [2024-11-12 01:01:16,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:01:16,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306673187] [2024-11-12 01:01:16,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:01:16,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:01:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:20,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:01:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:20,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:01:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:20,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:01:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:20,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:01:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:20,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:01:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:20,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:01:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:20,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:01:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:20,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:01:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:20,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:01:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:20,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:01:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:20,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:01:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:20,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:01:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:20,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:01:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:01:20,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:01:20,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306673187] [2024-11-12 01:01:20,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306673187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:01:20,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:01:20,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 01:01:20,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150507394] [2024-11-12 01:01:20,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:01:20,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 01:01:20,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:01:20,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 01:01:20,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-12 01:01:20,452 INFO L87 Difference]: Start difference. First operand 129 states and 195 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:01:23,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:01:23,261 INFO L93 Difference]: Finished difference Result 384 states and 568 transitions. [2024-11-12 01:01:23,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 01:01:23,262 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-11-12 01:01:23,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:01:23,265 INFO L225 Difference]: With dead ends: 384 [2024-11-12 01:01:23,266 INFO L226 Difference]: Without dead ends: 258 [2024-11-12 01:01:23,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2024-11-12 01:01:23,272 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 253 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:01:23,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 358 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 01:01:23,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-12 01:01:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 165. [2024-11-12 01:01:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 129 states have (on average 1.4108527131782946) internal successors, (182), 130 states have internal predecessors, (182), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 01:01:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2024-11-12 01:01:23,301 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 94 [2024-11-12 01:01:23,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:01:23,302 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2024-11-12 01:01:23,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:01:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2024-11-12 01:01:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 01:01:23,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:01:23,305 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:01:23,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 01:01:23,306 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:01:23,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:01:23,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1588218101, now seen corresponding path program 1 times [2024-11-12 01:01:23,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:01:23,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766655958] [2024-11-12 01:01:23,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:01:23,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:01:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:23,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:01:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:23,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:01:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:23,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:01:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:23,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:01:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:23,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:01:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:23,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:01:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:23,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:01:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:23,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:01:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:23,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:01:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:23,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:01:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:23,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:01:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:23,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:01:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:23,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:01:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:01:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:01:23,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:01:23,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766655958] [2024-11-12 01:01:23,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766655958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:01:23,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:01:23,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:01:23,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070566818] [2024-11-12 01:01:23,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:01:23,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:01:23,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:01:23,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:01:23,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:01:23,788 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:01:24,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:01:24,016 INFO L93 Difference]: Finished difference Result 402 states and 593 transitions. [2024-11-12 01:01:24,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:01:24,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-11-12 01:01:24,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:01:24,019 INFO L225 Difference]: With dead ends: 402 [2024-11-12 01:01:24,019 INFO L226 Difference]: Without dead ends: 248 [2024-11-12 01:01:24,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-12 01:01:24,021 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 78 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:01:24,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 220 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:01:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-12 01:01:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 198. [2024-11-12 01:01:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 153 states have (on average 1.3986928104575163) internal successors, (214), 153 states have internal predecessors, (214), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 01:01:24,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 292 transitions. [2024-11-12 01:01:24,051 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 292 transitions. Word has length 94 [2024-11-12 01:01:24,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:01:24,051 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 292 transitions. [2024-11-12 01:01:24,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 01:01:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 292 transitions. [2024-11-12 01:01:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 01:01:24,055 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:01:24,055 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:01:24,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 01:01:24,056 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:01:24,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:01:24,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1018473050, now seen corresponding path program 1 times [2024-11-12 01:01:24,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:01:24,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456826743] [2024-11-12 01:01:24,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:01:24,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:01:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:10,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:02:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:10,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:02:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:10,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 01:02:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:10,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:02:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:10,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 01:02:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:10,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:02:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:10,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 01:02:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:10,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:02:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:10,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 01:02:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:10,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:02:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:10,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 01:02:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:10,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:02:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:10,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:02:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:02:10,367 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 01:02:10,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:02:10,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456826743] [2024-11-12 01:02:10,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456826743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:02:10,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:02:10,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 01:02:10,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124591201] [2024-11-12 01:02:10,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:02:10,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 01:02:10,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:02:10,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 01:02:10,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-12 01:02:10,370 INFO L87 Difference]: Start difference. First operand 198 states and 292 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 01:02:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:02:11,445 INFO L93 Difference]: Finished difference Result 334 states and 479 transitions. [2024-11-12 01:02:11,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 01:02:11,446 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 97 [2024-11-12 01:02:11,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:02:11,448 INFO L225 Difference]: With dead ends: 334 [2024-11-12 01:02:11,448 INFO L226 Difference]: Without dead ends: 332 [2024-11-12 01:02:11,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2024-11-12 01:02:11,452 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 286 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 01:02:11,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 709 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 01:02:11,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-12 01:02:11,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 219. [2024-11-12 01:02:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 174 states have (on average 1.4080459770114941) internal successors, (245), 174 states have internal predecessors, (245), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 01:02:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2024-11-12 01:02:11,484 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 97 [2024-11-12 01:02:11,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:02:11,485 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2024-11-12 01:02:11,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 01:02:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2024-11-12 01:02:11,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 01:02:11,486 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:02:11,486 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:02:11,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 01:02:11,487 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:02:11,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:02:11,487 INFO L85 PathProgramCache]: Analyzing trace with hash -975671656, now seen corresponding path program 1 times [2024-11-12 01:02:11,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:02:11,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254038118] [2024-11-12 01:02:11,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:02:11,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:02:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat