./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-pe-ci_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-pe-ci_file-58.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 a67dd3310743fdc349103d1f769cdb6ef76078c74113cf555b28c14b094cb98e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:38:22,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:38:22,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:38:22,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:38:22,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:38:22,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:38:22,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:38:22,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:38:22,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:38:22,239 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:38:22,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:38:22,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:38:22,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:38:22,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:38:22,241 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:38:22,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:38:22,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:38:22,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:38:22,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:38:22,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:38:22,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:38:22,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:38:22,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:38:22,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:38:22,243 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:38:22,243 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:38:22,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:38:22,244 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:38:22,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:38:22,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:38:22,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:38:22,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:38:22,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:38:22,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:38:22,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:38:22,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:38:22,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:38:22,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:38:22,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:38:22,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:38:22,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:38:22,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:38:22,250 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 -> a67dd3310743fdc349103d1f769cdb6ef76078c74113cf555b28c14b094cb98e [2024-10-13 01:38:22,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:38:22,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:38:22,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:38:22,471 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:38:22,471 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:38:22,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-58.i [2024-10-13 01:38:23,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:38:23,907 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:38:23,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-58.i [2024-10-13 01:38:23,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7040ae373/158810dd64084a73995f7f6d517c0522/FLAGd73b5f9d2 [2024-10-13 01:38:23,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7040ae373/158810dd64084a73995f7f6d517c0522 [2024-10-13 01:38:23,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:38:23,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:38:23,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:38:23,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:38:23,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:38:23,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:38:23" (1/1) ... [2024-10-13 01:38:23,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54587eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:23, skipping insertion in model container [2024-10-13 01:38:23,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:38:23" (1/1) ... [2024-10-13 01:38:23,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:38:24,121 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-pe-ci_file-58.i[919,932] [2024-10-13 01:38:24,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:38:24,206 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:38:24,217 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-pe-ci_file-58.i[919,932] [2024-10-13 01:38:24,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:38:24,271 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:38:24,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:24 WrapperNode [2024-10-13 01:38:24,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:38:24,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:38:24,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:38:24,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:38:24,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:24" (1/1) ... [2024-10-13 01:38:24,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:24" (1/1) ... [2024-10-13 01:38:24,335 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 217 [2024-10-13 01:38:24,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:38:24,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:38:24,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:38:24,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:38:24,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:24" (1/1) ... [2024-10-13 01:38:24,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:24" (1/1) ... [2024-10-13 01:38:24,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:24" (1/1) ... [2024-10-13 01:38:24,383 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-13 01:38:24,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:24" (1/1) ... [2024-10-13 01:38:24,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:24" (1/1) ... [2024-10-13 01:38:24,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:24" (1/1) ... [2024-10-13 01:38:24,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:24" (1/1) ... [2024-10-13 01:38:24,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:24" (1/1) ... [2024-10-13 01:38:24,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:24" (1/1) ... [2024-10-13 01:38:24,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:38:24,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:38:24,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:38:24,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:38:24,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:24" (1/1) ... [2024-10-13 01:38:24,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:38:24,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:38:24,493 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-13 01:38:24,495 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-13 01:38:24,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:38:24,531 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:38:24,531 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:38:24,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:38:24,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:38:24,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:38:24,594 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:38:24,596 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:38:24,926 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 01:38:24,926 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:38:24,976 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:38:24,977 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:38:24,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:38:24 BoogieIcfgContainer [2024-10-13 01:38:24,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:38:24,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:38:24,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:38:24,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:38:24,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:38:23" (1/3) ... [2024-10-13 01:38:24,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46169759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:38:24, skipping insertion in model container [2024-10-13 01:38:24,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:38:24" (2/3) ... [2024-10-13 01:38:24,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46169759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:38:24, skipping insertion in model container [2024-10-13 01:38:24,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:38:24" (3/3) ... [2024-10-13 01:38:24,984 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-58.i [2024-10-13 01:38:24,997 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:38:24,997 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:38:25,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:38:25,051 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;@24ab59a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:38:25,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:38:25,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 58 states have internal predecessors, (89), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 01:38:25,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 01:38:25,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:25,076 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:38:25,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:25,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:25,081 INFO L85 PathProgramCache]: Analyzing trace with hash -849612484, now seen corresponding path program 1 times [2024-10-13 01:38:25,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:25,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087467007] [2024-10-13 01:38:25,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:25,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 01:38:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 01:38:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:38:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 01:38:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 01:38:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:38:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 01:38:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:38:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 01:38:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:38:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 01:38:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 01:38:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 01:38:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 01:38:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 01:38:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 01:38:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 01:38:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 01:38:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 01:38:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 01:38:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 01:38:25,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:25,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087467007] [2024-10-13 01:38:25,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087467007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:25,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:25,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:38:25,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065376486] [2024-10-13 01:38:25,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:25,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:38:25,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:25,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:38:25,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:38:25,514 INFO L87 Difference]: Start difference. First operand has 86 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 58 states have internal predecessors, (89), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 01:38:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:25,557 INFO L93 Difference]: Finished difference Result 169 states and 306 transitions. [2024-10-13 01:38:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:38:25,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 166 [2024-10-13 01:38:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:25,568 INFO L225 Difference]: With dead ends: 169 [2024-10-13 01:38:25,568 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 01:38:25,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-13 01:38:25,573 INFO L432 NwaCegarLoop]: 130 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, 130 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-13 01:38:25,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:38:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 01:38:25,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-13 01:38:25,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 56 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 01:38:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 133 transitions. [2024-10-13 01:38:25,619 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 133 transitions. Word has length 166 [2024-10-13 01:38:25,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:25,620 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 133 transitions. [2024-10-13 01:38:25,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 01:38:25,620 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 133 transitions. [2024-10-13 01:38:25,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 01:38:25,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:25,624 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:38:25,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:38:25,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:25,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:25,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1988814006, now seen corresponding path program 1 times [2024-10-13 01:38:25,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:25,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398044596] [2024-10-13 01:38:25,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:25,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 01:38:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 01:38:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:38:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 01:38:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 01:38:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:38:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 01:38:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:38:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 01:38:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:38:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 01:38:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 01:38:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 01:38:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 01:38:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 01:38:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 01:38:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 01:38:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 01:38:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 01:38:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 01:38:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 01:38:26,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:26,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398044596] [2024-10-13 01:38:26,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398044596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:26,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:26,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 01:38:26,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576270464] [2024-10-13 01:38:26,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:26,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:38:26,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:26,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:38:26,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:38:26,717 INFO L87 Difference]: Start difference. First operand 84 states and 133 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 01:38:26,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:26,920 INFO L93 Difference]: Finished difference Result 203 states and 322 transitions. [2024-10-13 01:38:26,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:38:26,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-10-13 01:38:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:26,925 INFO L225 Difference]: With dead ends: 203 [2024-10-13 01:38:26,925 INFO L226 Difference]: Without dead ends: 120 [2024-10-13 01:38:26,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:38:26,927 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 94 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:26,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 356 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:38:26,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-13 01:38:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 85. [2024-10-13 01:38:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 57 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 01:38:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 134 transitions. [2024-10-13 01:38:26,939 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 134 transitions. Word has length 166 [2024-10-13 01:38:26,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:26,940 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 134 transitions. [2024-10-13 01:38:26,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 01:38:26,941 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 134 transitions. [2024-10-13 01:38:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 01:38:26,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:26,946 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:38:26,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:38:26,947 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:26,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:26,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1431975516, now seen corresponding path program 1 times [2024-10-13 01:38:26,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:26,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517749793] [2024-10-13 01:38:26,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:26,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:38:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:38:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 01:38:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:38:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 01:38:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:38:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 01:38:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:38:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 01:38:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:38:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 01:38:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:38:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 01:38:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:38:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 01:38:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:38:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 01:38:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 01:38:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 01:38:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 01:38:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 01:38:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 01:38:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 01:38:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 01:38:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 01:38:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 01:38:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:38:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 01:38:27,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:38:27,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517749793] [2024-10-13 01:38:27,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517749793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:38:27,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:38:27,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:38:27,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998307189] [2024-10-13 01:38:27,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:38:27,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:38:27,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:38:27,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:38:27,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:38:27,076 INFO L87 Difference]: Start difference. First operand 85 states and 134 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 01:38:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:38:27,136 INFO L93 Difference]: Finished difference Result 181 states and 285 transitions. [2024-10-13 01:38:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:38:27,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2024-10-13 01:38:27,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:38:27,139 INFO L225 Difference]: With dead ends: 181 [2024-10-13 01:38:27,140 INFO L226 Difference]: Without dead ends: 97 [2024-10-13 01:38:27,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-13 01:38:27,143 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 13 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:38:27,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 230 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:38:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-13 01:38:27,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2024-10-13 01:38:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 61 states have internal predecessors, (88), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 01:38:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 140 transitions. [2024-10-13 01:38:27,159 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 140 transitions. Word has length 167 [2024-10-13 01:38:27,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:38:27,160 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 140 transitions. [2024-10-13 01:38:27,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 01:38:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 140 transitions. [2024-10-13 01:38:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 01:38:27,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:38:27,164 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:38:27,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:38:27,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:38:27,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:38:27,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1285617912, now seen corresponding path program 1 times [2024-10-13 01:38:27,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:38:27,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454426921] [2024-10-13 01:38:27,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:38:27,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:38:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat