./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_fillercodesize_ps-cn-100_file-81.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 e889afe7dbc18302406a41b275e3ceb2423ed88227c4b051d1ca24b7db47f75f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 19:15:07,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 19:15:07,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 19:15:07,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 19:15:07,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 19:15:07,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 19:15:07,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 19:15:07,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 19:15:07,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 19:15:07,415 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 19:15:07,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 19:15:07,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 19:15:07,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 19:15:07,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 19:15:07,418 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 19:15:07,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 19:15:07,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 19:15:07,419 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 19:15:07,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 19:15:07,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 19:15:07,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 19:15:07,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 19:15:07,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 19:15:07,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 19:15:07,425 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 19:15:07,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 19:15:07,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 19:15:07,426 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 19:15:07,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 19:15:07,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 19:15:07,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 19:15:07,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 19:15:07,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 19:15:07,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 19:15:07,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 19:15:07,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 19:15:07,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 19:15:07,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 19:15:07,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 19:15:07,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 19:15:07,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 19:15:07,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 19:15:07,430 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 -> e889afe7dbc18302406a41b275e3ceb2423ed88227c4b051d1ca24b7db47f75f [2024-11-18 19:15:07,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 19:15:07,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 19:15:07,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 19:15:07,722 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 19:15:07,722 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 19:15:07,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-81.i [2024-11-18 19:15:09,177 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 19:15:09,410 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 19:15:09,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-81.i [2024-11-18 19:15:09,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d940b1d/c10d7fab16394d92a162abf3b47e923c/FLAGf04ab0555 [2024-11-18 19:15:09,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d940b1d/c10d7fab16394d92a162abf3b47e923c [2024-11-18 19:15:09,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 19:15:09,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 19:15:09,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 19:15:09,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 19:15:09,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 19:15:09,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:15:09" (1/1) ... [2024-11-18 19:15:09,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55f63b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:15:09, skipping insertion in model container [2024-11-18 19:15:09,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:15:09" (1/1) ... [2024-11-18 19:15:09,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 19:15:09,656 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_fillercodesize_ps-cn-100_file-81.i[916,929] [2024-11-18 19:15:09,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 19:15:09,817 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 19:15:09,832 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_fillercodesize_ps-cn-100_file-81.i[916,929] [2024-11-18 19:15:09,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 19:15:09,937 INFO L204 MainTranslator]: Completed translation [2024-11-18 19:15:09,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:15:09 WrapperNode [2024-11-18 19:15:09,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 19:15:09,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 19:15:09,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 19:15:09,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 19:15:09,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:15:09" (1/1) ... [2024-11-18 19:15:09,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:15:09" (1/1) ... [2024-11-18 19:15:10,018 INFO L138 Inliner]: procedures = 26, calls = 79, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 365 [2024-11-18 19:15:10,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 19:15:10,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 19:15:10,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 19:15:10,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 19:15:10,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:15:09" (1/1) ... [2024-11-18 19:15:10,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:15:09" (1/1) ... [2024-11-18 19:15:10,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:15:09" (1/1) ... [2024-11-18 19:15:10,069 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-18 19:15:10,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:15:09" (1/1) ... [2024-11-18 19:15:10,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:15:09" (1/1) ... [2024-11-18 19:15:10,086 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:15:09" (1/1) ... [2024-11-18 19:15:10,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:15:09" (1/1) ... [2024-11-18 19:15:10,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:15:09" (1/1) ... [2024-11-18 19:15:10,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:15:09" (1/1) ... [2024-11-18 19:15:10,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 19:15:10,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 19:15:10,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 19:15:10,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 19:15:10,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:15:09" (1/1) ... [2024-11-18 19:15:10,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 19:15:10,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 19:15:10,154 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-18 19:15:10,160 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-18 19:15:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 19:15:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 19:15:10,212 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 19:15:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 19:15:10,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 19:15:10,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 19:15:10,341 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 19:15:10,345 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 19:15:10,976 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-18 19:15:10,976 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 19:15:10,996 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 19:15:10,998 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 19:15:10,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:15:10 BoogieIcfgContainer [2024-11-18 19:15:10,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 19:15:11,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 19:15:11,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 19:15:11,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 19:15:11,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:15:09" (1/3) ... [2024-11-18 19:15:11,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61766139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:15:11, skipping insertion in model container [2024-11-18 19:15:11,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:15:09" (2/3) ... [2024-11-18 19:15:11,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61766139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:15:11, skipping insertion in model container [2024-11-18 19:15:11,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:15:10" (3/3) ... [2024-11-18 19:15:11,010 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-81.i [2024-11-18 19:15:11,028 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 19:15:11,029 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 19:15:11,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 19:15:11,118 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;@32dda3c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 19:15:11,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 19:15:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 91 states have internal predecessors, (125), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-18 19:15:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-11-18 19:15:11,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:15:11,147 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:15:11,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:15:11,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:15:11,153 INFO L85 PathProgramCache]: Analyzing trace with hash -528917809, now seen corresponding path program 1 times [2024-11-18 19:15:11,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:15:11,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988073025] [2024-11-18 19:15:11,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:15:11,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:15:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:15:11,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2024-11-18 19:15:11,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:15:11,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988073025] [2024-11-18 19:15:11,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988073025] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 19:15:11,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918639520] [2024-11-18 19:15:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:15:11,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 19:15:11,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 19:15:11,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 19:15:11,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 19:15:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:15:12,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 19:15:12,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 19:15:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2024-11-18 19:15:12,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 19:15:12,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918639520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 19:15:12,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 19:15:12,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 19:15:12,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624422837] [2024-11-18 19:15:12,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 19:15:12,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 19:15:12,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:15:12,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 19:15:12,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 19:15:12,302 INFO L87 Difference]: Start difference. First operand has 159 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 91 states have internal predecessors, (125), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2024-11-18 19:15:12,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 19:15:12,347 INFO L93 Difference]: Finished difference Result 310 states and 572 transitions. [2024-11-18 19:15:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 19:15:12,351 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) Word has length 397 [2024-11-18 19:15:12,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 19:15:12,363 INFO L225 Difference]: With dead ends: 310 [2024-11-18 19:15:12,367 INFO L226 Difference]: Without dead ends: 154 [2024-11-18 19:15:12,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 398 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-18 19:15:12,376 INFO L432 NwaCegarLoop]: 245 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, 245 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-18 19:15:12,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 19:15:12,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-18 19:15:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-18 19:15:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-18 19:15:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 245 transitions. [2024-11-18 19:15:12,464 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 245 transitions. Word has length 397 [2024-11-18 19:15:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 19:15:12,468 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 245 transitions. [2024-11-18 19:15:12,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2024-11-18 19:15:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 245 transitions. [2024-11-18 19:15:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-11-18 19:15:12,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:15:12,482 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:15:12,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 19:15:12,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 19:15:12,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:15:12,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:15:12,686 INFO L85 PathProgramCache]: Analyzing trace with hash 715940035, now seen corresponding path program 1 times [2024-11-18 19:15:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:15:12,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317045144] [2024-11-18 19:15:12,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:15:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:15:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:15:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-18 19:15:29,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:15:29,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317045144] [2024-11-18 19:15:29,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317045144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 19:15:29,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 19:15:29,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 19:15:29,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171035019] [2024-11-18 19:15:29,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 19:15:29,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 19:15:29,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:15:29,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 19:15:29,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-18 19:15:29,641 INFO L87 Difference]: Start difference. First operand 154 states and 245 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-18 19:15:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 19:15:30,563 INFO L93 Difference]: Finished difference Result 390 states and 607 transitions. [2024-11-18 19:15:30,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 19:15:30,567 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 397 [2024-11-18 19:15:30,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 19:15:30,571 INFO L225 Difference]: With dead ends: 390 [2024-11-18 19:15:30,571 INFO L226 Difference]: Without dead ends: 239 [2024-11-18 19:15:30,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-18 19:15:30,577 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 195 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 19:15:30,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1068 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 19:15:30,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-18 19:15:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 167. [2024-11-18 19:15:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 99 states have internal predecessors, (133), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-18 19:15:30,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 265 transitions. [2024-11-18 19:15:30,615 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 265 transitions. Word has length 397 [2024-11-18 19:15:30,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 19:15:30,620 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 265 transitions. [2024-11-18 19:15:30,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-18 19:15:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 265 transitions. [2024-11-18 19:15:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-11-18 19:15:30,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:15:30,624 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:15:30,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 19:15:30,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:15:30,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:15:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash 322913025, now seen corresponding path program 1 times [2024-11-18 19:15:30,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:15:30,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157241651] [2024-11-18 19:15:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:15:30,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:15:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:15:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-18 19:15:31,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:15:31,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157241651] [2024-11-18 19:15:31,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157241651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 19:15:31,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 19:15:31,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 19:15:31,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907895466] [2024-11-18 19:15:31,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 19:15:31,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 19:15:31,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:15:31,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 19:15:31,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 19:15:31,065 INFO L87 Difference]: Start difference. First operand 167 states and 265 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-18 19:15:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 19:15:31,146 INFO L93 Difference]: Finished difference Result 363 states and 571 transitions. [2024-11-18 19:15:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 19:15:31,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 397 [2024-11-18 19:15:31,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 19:15:31,151 INFO L225 Difference]: With dead ends: 363 [2024-11-18 19:15:31,152 INFO L226 Difference]: Without dead ends: 199 [2024-11-18 19:15:31,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 19:15:31,154 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 42 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 19:15:31,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 725 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 19:15:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-18 19:15:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2024-11-18 19:15:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 123 states have (on average 1.3333333333333333) internal successors, (164), 124 states have internal predecessors, (164), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-18 19:15:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 304 transitions. [2024-11-18 19:15:31,181 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 304 transitions. Word has length 397 [2024-11-18 19:15:31,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 19:15:31,182 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 304 transitions. [2024-11-18 19:15:31,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-18 19:15:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 304 transitions. [2024-11-18 19:15:31,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-11-18 19:15:31,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:15:31,188 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:15:31,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 19:15:31,189 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:15:31,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:15:31,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1417004613, now seen corresponding path program 1 times [2024-11-18 19:15:31,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:15:31,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754201212] [2024-11-18 19:15:31,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:15:31,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:15:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:15:41,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-18 19:15:41,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:15:41,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754201212] [2024-11-18 19:15:41,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754201212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 19:15:41,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 19:15:41,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-18 19:15:41,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037215385] [2024-11-18 19:15:41,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 19:15:41,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 19:15:41,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:15:41,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 19:15:41,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-18 19:15:41,936 INFO L87 Difference]: Start difference. First operand 196 states and 304 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-18 19:15:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 19:15:46,659 INFO L93 Difference]: Finished difference Result 645 states and 990 transitions. [2024-11-18 19:15:46,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 19:15:46,660 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 397 [2024-11-18 19:15:46,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 19:15:46,667 INFO L225 Difference]: With dead ends: 645 [2024-11-18 19:15:46,667 INFO L226 Difference]: Without dead ends: 452 [2024-11-18 19:15:46,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-18 19:15:46,670 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 492 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-18 19:15:46,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 1339 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-18 19:15:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-18 19:15:46,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 327. [2024-11-18 19:15:46,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 187 states have (on average 1.3101604278074865) internal successors, (245), 188 states have internal predecessors, (245), 136 states have call successors, (136), 3 states have call predecessors, (136), 3 states have return successors, (136), 135 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-18 19:15:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 517 transitions. [2024-11-18 19:15:46,760 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 517 transitions. Word has length 397 [2024-11-18 19:15:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 19:15:46,761 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 517 transitions. [2024-11-18 19:15:46,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-18 19:15:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 517 transitions. [2024-11-18 19:15:46,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-11-18 19:15:46,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:15:46,768 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:15:46,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 19:15:46,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:15:46,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:15:46,769 INFO L85 PathProgramCache]: Analyzing trace with hash 974105473, now seen corresponding path program 1 times [2024-11-18 19:15:46,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:15:46,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321946927] [2024-11-18 19:15:46,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:15:46,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:15:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:15:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-18 19:15:47,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:15:47,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321946927] [2024-11-18 19:15:47,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321946927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 19:15:47,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 19:15:47,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 19:15:47,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939143983] [2024-11-18 19:15:47,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 19:15:47,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 19:15:47,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:15:47,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 19:15:47,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-18 19:15:47,796 INFO L87 Difference]: Start difference. First operand 327 states and 517 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-18 19:15:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 19:15:48,671 INFO L93 Difference]: Finished difference Result 575 states and 897 transitions. [2024-11-18 19:15:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 19:15:48,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 397 [2024-11-18 19:15:48,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 19:15:48,677 INFO L225 Difference]: With dead ends: 575 [2024-11-18 19:15:48,678 INFO L226 Difference]: Without dead ends: 382 [2024-11-18 19:15:48,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-18 19:15:48,680 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 175 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 19:15:48,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1002 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 19:15:48,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-18 19:15:48,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 333. [2024-11-18 19:15:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 193 states have (on average 1.305699481865285) internal successors, (252), 194 states have internal predecessors, (252), 136 states have call successors, (136), 3 states have call predecessors, (136), 3 states have return successors, (136), 135 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-18 19:15:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 524 transitions. [2024-11-18 19:15:48,742 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 524 transitions. Word has length 397 [2024-11-18 19:15:48,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 19:15:48,744 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 524 transitions. [2024-11-18 19:15:48,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-18 19:15:48,744 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 524 transitions. [2024-11-18 19:15:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-11-18 19:15:48,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:15:48,748 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:15:48,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 19:15:48,748 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:15:48,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:15:48,750 INFO L85 PathProgramCache]: Analyzing trace with hash 405887363, now seen corresponding path program 1 times [2024-11-18 19:15:48,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:15:48,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556699470] [2024-11-18 19:15:48,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:15:48,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:15:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:15:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-18 19:15:58,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:15:58,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556699470] [2024-11-18 19:15:58,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556699470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 19:15:58,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 19:15:58,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-18 19:15:58,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901100221] [2024-11-18 19:15:58,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 19:15:58,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 19:15:58,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:15:58,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 19:15:58,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-18 19:15:58,301 INFO L87 Difference]: Start difference. First operand 333 states and 524 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-18 19:16:00,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 19:16:00,437 INFO L93 Difference]: Finished difference Result 594 states and 919 transitions. [2024-11-18 19:16:00,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 19:16:00,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 397 [2024-11-18 19:16:00,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 19:16:00,443 INFO L225 Difference]: With dead ends: 594 [2024-11-18 19:16:00,443 INFO L226 Difference]: Without dead ends: 401 [2024-11-18 19:16:00,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-18 19:16:00,445 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 222 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-18 19:16:00,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1135 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-18 19:16:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-18 19:16:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 331. [2024-11-18 19:16:00,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 191 states have (on average 1.3089005235602094) internal successors, (250), 192 states have internal predecessors, (250), 136 states have call successors, (136), 3 states have call predecessors, (136), 3 states have return successors, (136), 135 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-18 19:16:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 522 transitions. [2024-11-18 19:16:00,495 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 522 transitions. Word has length 397 [2024-11-18 19:16:00,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 19:16:00,496 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 522 transitions. [2024-11-18 19:16:00,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-18 19:16:00,496 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 522 transitions. [2024-11-18 19:16:00,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2024-11-18 19:16:00,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:16:00,499 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:16:00,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 19:16:00,499 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:16:00,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:16:00,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1827343518, now seen corresponding path program 1 times [2024-11-18 19:16:00,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:16:00,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063775119] [2024-11-18 19:16:00,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:16:00,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:16:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:16:10,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-18 19:16:10,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:16:10,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063775119] [2024-11-18 19:16:10,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063775119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 19:16:10,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 19:16:10,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-18 19:16:10,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220415539] [2024-11-18 19:16:10,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 19:16:10,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 19:16:10,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:16:10,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 19:16:10,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-18 19:16:10,124 INFO L87 Difference]: Start difference. First operand 331 states and 522 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-18 19:16:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 19:16:13,557 INFO L93 Difference]: Finished difference Result 723 states and 1099 transitions. [2024-11-18 19:16:13,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 19:16:13,558 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 398 [2024-11-18 19:16:13,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 19:16:13,562 INFO L225 Difference]: With dead ends: 723 [2024-11-18 19:16:13,563 INFO L226 Difference]: Without dead ends: 530 [2024-11-18 19:16:13,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-18 19:16:13,565 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 545 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-18 19:16:13,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1291 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-18 19:16:13,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-18 19:16:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 336. [2024-11-18 19:16:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 196 states have (on average 1.316326530612245) internal successors, (258), 197 states have internal predecessors, (258), 136 states have call successors, (136), 3 states have call predecessors, (136), 3 states have return successors, (136), 135 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-18 19:16:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 530 transitions. [2024-11-18 19:16:13,609 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 530 transitions. Word has length 398 [2024-11-18 19:16:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 19:16:13,610 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 530 transitions. [2024-11-18 19:16:13,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-18 19:16:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 530 transitions. [2024-11-18 19:16:13,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2024-11-18 19:16:13,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:16:13,614 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:16:13,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 19:16:13,614 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:16:13,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:16:13,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1434316508, now seen corresponding path program 1 times [2024-11-18 19:16:13,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:16:13,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345649049] [2024-11-18 19:16:13,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:16:13,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:16:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat