./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-33.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 2455b112e52a42d84b808fd6137571b9cca3ff5d97324027a8a2378e325a2c67 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:08:42,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:08:42,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:08:42,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:08:42,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:08:42,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:08:42,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:08:42,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:08:42,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:08:42,511 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:08:42,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:08:42,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:08:42,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:08:42,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:08:42,518 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:08:42,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:08:42,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:08:42,519 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:08:42,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:08:42,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:08:42,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:08:42,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:08:42,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:08:42,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:08:42,523 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:08:42,523 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:08:42,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:08:42,524 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:08:42,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:08:42,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:08:42,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:08:42,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:08:42,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:08:42,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:08:42,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:08:42,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:08:42,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:08:42,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:08:42,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:08:42,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:08:42,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:08:42,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:08:42,535 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 -> 2455b112e52a42d84b808fd6137571b9cca3ff5d97324027a8a2378e325a2c67 [2024-11-08 21:08:42,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:08:42,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:08:42,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:08:42,834 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:08:42,834 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:08:42,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-33.i [2024-11-08 21:08:44,270 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:08:44,500 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:08:44,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-33.i [2024-11-08 21:08:44,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/590d84de9/e1981bfc886647f3a057922311bc5557/FLAGd45c70ef9 [2024-11-08 21:08:44,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/590d84de9/e1981bfc886647f3a057922311bc5557 [2024-11-08 21:08:44,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:08:44,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:08:44,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:08:44,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:08:44,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:08:44,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:08:44" (1/1) ... [2024-11-08 21:08:44,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dbcc48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:44, skipping insertion in model container [2024-11-08 21:08:44,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:08:44" (1/1) ... [2024-11-08 21:08:44,570 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:08:44,736 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_fillercode_fillercodestructure_filler-pe-ci_file-33.i[919,932] [2024-11-08 21:08:44,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:08:44,835 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:08:44,849 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_fillercode_fillercodestructure_filler-pe-ci_file-33.i[919,932] [2024-11-08 21:08:44,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:08:44,896 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:08:44,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:44 WrapperNode [2024-11-08 21:08:44,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:08:44,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:08:44,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:08:44,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:08:44,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:44" (1/1) ... [2024-11-08 21:08:44,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:44" (1/1) ... [2024-11-08 21:08:44,964 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-11-08 21:08:44,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:08:44,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:08:44,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:08:44,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:08:44,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:44" (1/1) ... [2024-11-08 21:08:44,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:44" (1/1) ... [2024-11-08 21:08:44,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:44" (1/1) ... [2024-11-08 21:08:45,008 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-08 21:08:45,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:44" (1/1) ... [2024-11-08 21:08:45,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:44" (1/1) ... [2024-11-08 21:08:45,019 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:44" (1/1) ... [2024-11-08 21:08:45,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:44" (1/1) ... [2024-11-08 21:08:45,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:44" (1/1) ... [2024-11-08 21:08:45,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:44" (1/1) ... [2024-11-08 21:08:45,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:08:45,043 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:08:45,043 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:08:45,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:08:45,044 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:44" (1/1) ... [2024-11-08 21:08:45,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:08:45,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:08:45,082 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-08 21:08:45,089 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-08 21:08:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:08:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:08:45,133 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:08:45,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:08:45,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:08:45,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:08:45,219 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:08:45,222 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:08:45,612 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-08 21:08:45,613 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:08:45,626 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:08:45,627 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:08:45,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:08:45 BoogieIcfgContainer [2024-11-08 21:08:45,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:08:45,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:08:45,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:08:45,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:08:45,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:08:44" (1/3) ... [2024-11-08 21:08:45,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dea0603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:08:45, skipping insertion in model container [2024-11-08 21:08:45,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:08:44" (2/3) ... [2024-11-08 21:08:45,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dea0603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:08:45, skipping insertion in model container [2024-11-08 21:08:45,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:08:45" (3/3) ... [2024-11-08 21:08:45,636 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-33.i [2024-11-08 21:08:45,651 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:08:45,651 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:08:45,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:08:45,750 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;@626cc5a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:08:45,750 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:08:45,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 60 states have internal predecessors, (86), 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-11-08 21:08:45,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 21:08:45,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:45,768 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, 1, 1] [2024-11-08 21:08:45,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:45,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:45,772 INFO L85 PathProgramCache]: Analyzing trace with hash 643827931, now seen corresponding path program 1 times [2024-11-08 21:08:45,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:45,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049554572] [2024-11-08 21:08:45,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:45,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:08:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:08:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:08:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:08:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:08:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:08:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:08:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:08:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:08:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:08:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:08:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:08:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:08:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:08:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:08:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:08:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:08:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:08:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:08:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:08:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:08:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:08:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:08:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 21:08:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 21:08:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 21:08:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:08:46,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:08:46,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049554572] [2024-11-08 21:08:46,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049554572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:08:46,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:08:46,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:08:46,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604135166] [2024-11-08 21:08:46,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:08:46,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:08:46,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:08:46,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:08:46,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:08:46,309 INFO L87 Difference]: Start difference. First operand has 88 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 60 states have internal predecessors, (86), 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 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-11-08 21:08:46,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:46,346 INFO L93 Difference]: Finished difference Result 167 states and 292 transitions. [2024-11-08 21:08:46,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:08:46,350 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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 169 [2024-11-08 21:08:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:46,357 INFO L225 Difference]: With dead ends: 167 [2024-11-08 21:08:46,357 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 21:08:46,360 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-11-08 21:08:46,364 INFO L432 NwaCegarLoop]: 123 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, 123 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-08 21:08:46,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:08:46,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 21:08:46,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-08 21:08:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 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-11-08 21:08:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 123 transitions. [2024-11-08 21:08:46,418 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 123 transitions. Word has length 169 [2024-11-08 21:08:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:46,418 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 123 transitions. [2024-11-08 21:08:46,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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-11-08 21:08:46,419 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 123 transitions. [2024-11-08 21:08:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 21:08:46,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:46,424 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, 1, 1] [2024-11-08 21:08:46,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:08:46,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:46,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:46,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1488024805, now seen corresponding path program 1 times [2024-11-08 21:08:46,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:46,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207431504] [2024-11-08 21:08:46,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:46,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:08:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:08:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:08:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:08:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:08:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:08:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:08:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:08:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:08:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:08:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:08:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:08:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:08:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:08:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:08:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:08:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:08:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:08:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:08:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:08:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:08:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:08:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:08:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 21:08:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 21:08:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 21:08:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:08:47,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:08:47,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207431504] [2024-11-08 21:08:47,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207431504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:08:47,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:08:47,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:08:47,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098385192] [2024-11-08 21:08:47,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:08:47,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:08:47,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:08:47,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:08:47,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:08:47,665 INFO L87 Difference]: Start difference. First operand 82 states and 123 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-11-08 21:08:48,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:48,023 INFO L93 Difference]: Finished difference Result 245 states and 371 transitions. [2024-11-08 21:08:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:08:48,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 169 [2024-11-08 21:08:48,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:48,027 INFO L225 Difference]: With dead ends: 245 [2024-11-08 21:08:48,029 INFO L226 Difference]: Without dead ends: 166 [2024-11-08 21:08:48,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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-08 21:08:48,031 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 85 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:08:48,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 304 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:08:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-08 21:08:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 152. [2024-11-08 21:08:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 97 states have (on average 1.309278350515464) internal successors, (127), 97 states have internal predecessors, (127), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 21:08:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2024-11-08 21:08:48,080 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 169 [2024-11-08 21:08:48,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:48,081 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2024-11-08 21:08:48,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-11-08 21:08:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2024-11-08 21:08:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 21:08:48,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:48,086 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, 1, 1, 1] [2024-11-08 21:08:48,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:08:48,086 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:48,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:48,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1803329384, now seen corresponding path program 1 times [2024-11-08 21:08:48,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:48,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262109772] [2024-11-08 21:08:48,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:48,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:08:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:08:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:08:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:08:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:08:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:08:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:08:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:08:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:08:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:08:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:08:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:08:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:08:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:08:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:08:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:08:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:08:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:08:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:08:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:08:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:08:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:08:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:08:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 21:08:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 21:08:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 21:08:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:08:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:08:48,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:08:48,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262109772] [2024-11-08 21:08:48,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262109772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:08:48,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:08:48,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:08:48,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88086125] [2024-11-08 21:08:48,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:08:48,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:08:48,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:08:48,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:08:48,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:08:48,525 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-11-08 21:08:48,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:08:48,791 INFO L93 Difference]: Finished difference Result 263 states and 396 transitions. [2024-11-08 21:08:48,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:08:48,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 170 [2024-11-08 21:08:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:08:48,794 INFO L225 Difference]: With dead ends: 263 [2024-11-08 21:08:48,794 INFO L226 Difference]: Without dead ends: 162 [2024-11-08 21:08:48,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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-08 21:08:48,799 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 82 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:08:48,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 309 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:08:48,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-08 21:08:48,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2024-11-08 21:08:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 21:08:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 231 transitions. [2024-11-08 21:08:48,839 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 231 transitions. Word has length 170 [2024-11-08 21:08:48,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:08:48,840 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 231 transitions. [2024-11-08 21:08:48,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-11-08 21:08:48,840 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 231 transitions. [2024-11-08 21:08:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 21:08:48,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:08:48,847 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, 1, 1, 1, 1] [2024-11-08 21:08:48,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:08:48,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:08:48,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:08:48,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1390146878, now seen corresponding path program 1 times [2024-11-08 21:08:48,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:08:48,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691251824] [2024-11-08 21:08:48,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:08:48,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:08:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat