./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-64.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_fillercodesize_ps-cn-25_file-64.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 25397797dfc35333634a0be2aab10e78ef32d1e201aaa39bb0855cdf971464ab --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:42:22,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:42:22,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:42:22,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:42:22,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:42:23,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:42:23,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:42:23,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:42:23,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:42:23,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:42:23,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:42:23,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:42:23,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:42:23,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:42:23,021 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:42:23,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:42:23,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:42:23,022 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:42:23,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:42:23,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:42:23,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:42:23,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:42:23,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:42:23,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:42:23,023 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:42:23,024 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:42:23,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:42:23,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:42:23,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:42:23,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:42:23,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:42:23,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:42:23,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:42:23,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:42:23,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:42:23,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:42:23,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:42:23,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:42:23,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:42:23,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:42:23,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:42:23,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:42:23,027 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 -> 25397797dfc35333634a0be2aab10e78ef32d1e201aaa39bb0855cdf971464ab [2024-11-08 20:42:23,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:42:23,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:42:23,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:42:23,226 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:42:23,226 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:42:23,227 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-25_file-64.i [2024-11-08 20:42:24,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:42:24,608 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:42:24,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-64.i [2024-11-08 20:42:24,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3566131be/05d8430a5ef94839a08874dd2c782726/FLAGeefb446f3 [2024-11-08 20:42:24,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3566131be/05d8430a5ef94839a08874dd2c782726 [2024-11-08 20:42:24,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:42:24,997 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:42:24,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:42:24,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:42:25,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:42:25,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:42:24" (1/1) ... [2024-11-08 20:42:25,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4c27c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:42:25, skipping insertion in model container [2024-11-08 20:42:25,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:42:24" (1/1) ... [2024-11-08 20:42:25,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:42:25,202 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-25_file-64.i[915,928] [2024-11-08 20:42:25,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:42:25,254 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:42:25,263 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-25_file-64.i[915,928] [2024-11-08 20:42:25,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:42:25,301 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:42:25,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:42:25 WrapperNode [2024-11-08 20:42:25,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:42:25,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:42:25,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:42:25,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:42:25,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:42:25" (1/1) ... [2024-11-08 20:42:25,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:42:25" (1/1) ... [2024-11-08 20:42:25,343 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 251 [2024-11-08 20:42:25,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:42:25,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:42:25,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:42:25,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:42:25,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:42:25" (1/1) ... [2024-11-08 20:42:25,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:42:25" (1/1) ... [2024-11-08 20:42:25,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:42:25" (1/1) ... [2024-11-08 20:42:25,384 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 20:42:25,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:42:25" (1/1) ... [2024-11-08 20:42:25,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:42:25" (1/1) ... [2024-11-08 20:42:25,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:42:25" (1/1) ... [2024-11-08 20:42:25,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:42:25" (1/1) ... [2024-11-08 20:42:25,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:42:25" (1/1) ... [2024-11-08 20:42:25,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:42:25" (1/1) ... [2024-11-08 20:42:25,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:42:25,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:42:25,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:42:25,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:42:25,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:42:25" (1/1) ... [2024-11-08 20:42:25,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:42:25,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:42:25,437 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 20:42:25,442 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 20:42:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:42:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:42:25,473 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:42:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:42:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:42:25,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:42:25,534 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:42:25,535 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:42:25,805 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 20:42:25,805 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:42:25,817 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:42:25,817 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:42:25,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:42:25 BoogieIcfgContainer [2024-11-08 20:42:25,818 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:42:25,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:42:25,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:42:25,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:42:25,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:42:24" (1/3) ... [2024-11-08 20:42:25,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70cd0dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:42:25, skipping insertion in model container [2024-11-08 20:42:25,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:42:25" (2/3) ... [2024-11-08 20:42:25,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70cd0dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:42:25, skipping insertion in model container [2024-11-08 20:42:25,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:42:25" (3/3) ... [2024-11-08 20:42:25,825 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-64.i [2024-11-08 20:42:25,838 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:42:25,839 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:42:25,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:42:25,893 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;@71ba904c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:42:25,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:42:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 64 states have internal predecessors, (86), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 20:42:25,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-08 20:42:25,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:42:25,911 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:42:25,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:42:25,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:42:25,915 INFO L85 PathProgramCache]: Analyzing trace with hash 676670769, now seen corresponding path program 1 times [2024-11-08 20:42:25,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:42:25,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006123894] [2024-11-08 20:42:25,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:42:25,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:42:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:42:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:42:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:42:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:42:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:42:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:42:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:42:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:42:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:42:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:42:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:42:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:42:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:42:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:42:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:42:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:42:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:42:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:42:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:42:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 20:42:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:42:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:42:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:42:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:42:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:42:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 20:42:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:42:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 20:42:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 20:42:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 20:42:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 20:42:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:42:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 20:42:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-08 20:42:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 20:42:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-08 20:42:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 20:42:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-08 20:42:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 20:42:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-08 20:42:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-08 20:42:26,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:42:26,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006123894] [2024-11-08 20:42:26,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006123894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:42:26,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:42:26,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:42:26,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515604330] [2024-11-08 20:42:26,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:42:26,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:42:26,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:42:26,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:42:26,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:42:26,394 INFO L87 Difference]: Start difference. First operand has 106 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 64 states have internal predecessors, (86), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-08 20:42:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:42:26,443 INFO L93 Difference]: Finished difference Result 205 states and 366 transitions. [2024-11-08 20:42:26,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:42:26,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 247 [2024-11-08 20:42:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:42:26,479 INFO L225 Difference]: With dead ends: 205 [2024-11-08 20:42:26,479 INFO L226 Difference]: Without dead ends: 102 [2024-11-08 20:42:26,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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 20:42:26,485 INFO L432 NwaCegarLoop]: 158 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, 158 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 20:42:26,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:42:26,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-08 20:42:26,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-08 20:42:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 20:42:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2024-11-08 20:42:26,536 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 158 transitions. Word has length 247 [2024-11-08 20:42:26,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:42:26,538 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 158 transitions. [2024-11-08 20:42:26,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-08 20:42:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 158 transitions. [2024-11-08 20:42:26,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-08 20:42:26,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:42:26,545 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:42:26,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:42:26,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:42:26,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:42:26,546 INFO L85 PathProgramCache]: Analyzing trace with hash 611966061, now seen corresponding path program 1 times [2024-11-08 20:42:26,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:42:26,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536003812] [2024-11-08 20:42:26,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:42:26,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:42:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:42:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:42:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:42:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:42:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:42:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:26,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:42:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:42:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:42:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:42:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:42:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:42:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:42:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:42:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:42:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:42:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:42:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:42:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:42:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:42:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 20:42:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:42:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:42:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:42:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:42:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:42:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 20:42:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:42:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 20:42:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 20:42:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 20:42:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 20:42:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:42:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 20:42:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-08 20:42:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 20:42:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-08 20:42:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 20:42:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-08 20:42:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 20:42:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-08 20:42:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-08 20:42:27,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:42:27,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536003812] [2024-11-08 20:42:27,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536003812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:42:27,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:42:27,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:42:27,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114552989] [2024-11-08 20:42:27,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:42:27,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:42:27,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:42:27,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:42:27,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:42:27,120 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-08 20:42:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:42:27,357 INFO L93 Difference]: Finished difference Result 309 states and 476 transitions. [2024-11-08 20:42:27,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:42:27,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 247 [2024-11-08 20:42:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:42:27,363 INFO L225 Difference]: With dead ends: 309 [2024-11-08 20:42:27,363 INFO L226 Difference]: Without dead ends: 210 [2024-11-08 20:42:27,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:42:27,367 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 159 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:42:27,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 876 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:42:27,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-08 20:42:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 106. [2024-11-08 20:42:27,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 20:42:27,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 164 transitions. [2024-11-08 20:42:27,393 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 164 transitions. Word has length 247 [2024-11-08 20:42:27,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:42:27,394 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 164 transitions. [2024-11-08 20:42:27,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-08 20:42:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 164 transitions. [2024-11-08 20:42:27,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-08 20:42:27,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:42:27,397 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:42:27,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:42:27,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:42:27,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:42:27,397 INFO L85 PathProgramCache]: Analyzing trace with hash -197380565, now seen corresponding path program 1 times [2024-11-08 20:42:27,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:42:27,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241084979] [2024-11-08 20:42:27,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:42:27,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:42:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:42:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:42:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:42:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:42:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:42:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:42:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:42:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:42:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:42:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:42:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:42:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:42:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:42:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:42:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:42:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:42:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:42:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:42:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:42:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 20:42:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:42:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:42:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:42:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:42:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:42:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 20:42:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:42:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 20:42:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 20:42:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 20:42:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 20:42:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:42:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 20:42:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-08 20:42:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 20:42:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-08 20:42:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 20:42:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-08 20:42:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 20:42:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-08 20:42:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:30,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-08 20:42:30,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:42:30,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241084979] [2024-11-08 20:42:30,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241084979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:42:30,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:42:30,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:42:30,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689553422] [2024-11-08 20:42:30,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:42:30,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:42:30,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:42:30,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:42:30,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:42:30,824 INFO L87 Difference]: Start difference. First operand 106 states and 164 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-08 20:42:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:42:31,069 INFO L93 Difference]: Finished difference Result 308 states and 473 transitions. [2024-11-08 20:42:31,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:42:31,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 247 [2024-11-08 20:42:31,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:42:31,072 INFO L225 Difference]: With dead ends: 308 [2024-11-08 20:42:31,072 INFO L226 Difference]: Without dead ends: 205 [2024-11-08 20:42:31,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:42:31,074 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 160 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:42:31,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 733 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:42:31,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-08 20:42:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 106. [2024-11-08 20:42:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 20:42:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 164 transitions. [2024-11-08 20:42:31,084 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 164 transitions. Word has length 247 [2024-11-08 20:42:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:42:31,085 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 164 transitions. [2024-11-08 20:42:31,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-08 20:42:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 164 transitions. [2024-11-08 20:42:31,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-08 20:42:31,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:42:31,087 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:42:31,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:42:31,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:42:31,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:42:31,088 INFO L85 PathProgramCache]: Analyzing trace with hash 94813037, now seen corresponding path program 1 times [2024-11-08 20:42:31,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:42:31,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61954141] [2024-11-08 20:42:31,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:42:31,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:42:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:42:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:42:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:42:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:42:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:42:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:42:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:42:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:42:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:42:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:42:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:42:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:42:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:42:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:42:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:42:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:42:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:42:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:42:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:42:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 20:42:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:42:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:42:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:42:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:42:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:42:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 20:42:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:42:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 20:42:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 20:42:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 20:42:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 20:42:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:42:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 20:42:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-08 20:42:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 20:42:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-08 20:42:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 20:42:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-08 20:42:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 20:42:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-08 20:42:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-08 20:42:31,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:42:31,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61954141] [2024-11-08 20:42:31,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61954141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:42:31,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:42:31,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:42:31,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393877639] [2024-11-08 20:42:31,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:42:31,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:42:31,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:42:31,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:42:31,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:42:31,293 INFO L87 Difference]: Start difference. First operand 106 states and 164 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-08 20:42:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:42:31,452 INFO L93 Difference]: Finished difference Result 388 states and 600 transitions. [2024-11-08 20:42:31,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:42:31,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 247 [2024-11-08 20:42:31,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:42:31,455 INFO L225 Difference]: With dead ends: 388 [2024-11-08 20:42:31,455 INFO L226 Difference]: Without dead ends: 285 [2024-11-08 20:42:31,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:42:31,456 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 289 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:42:31,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 749 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:42:31,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-08 20:42:31,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 106. [2024-11-08 20:42:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 20:42:31,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 164 transitions. [2024-11-08 20:42:31,468 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 164 transitions. Word has length 247 [2024-11-08 20:42:31,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:42:31,468 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 164 transitions. [2024-11-08 20:42:31,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-08 20:42:31,469 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 164 transitions. [2024-11-08 20:42:31,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-08 20:42:31,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:42:31,470 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:42:31,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 20:42:31,471 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:42:31,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:42:31,471 INFO L85 PathProgramCache]: Analyzing trace with hash -714533589, now seen corresponding path program 1 times [2024-11-08 20:42:31,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:42:31,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543667193] [2024-11-08 20:42:31,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:42:31,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:42:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:42:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:42:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:42:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:42:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:42:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:42:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:42:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:42:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:42:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:42:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:42:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:42:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:42:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:42:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:42:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:42:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:42:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:42:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:42:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 20:42:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:42:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:42:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:42:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:42:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:42:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 20:42:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:42:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 20:42:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 20:42:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 20:42:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 20:42:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:42:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-08 20:42:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-08 20:42:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 20:42:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-08 20:42:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 20:42:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-08 20:42:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 20:42:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-08 20:42:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:42:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-08 20:42:31,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:42:31,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543667193] [2024-11-08 20:42:31,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543667193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:42:31,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:42:31,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:42:31,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444389051] [2024-11-08 20:42:31,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:42:31,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:42:31,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:42:31,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:42:31,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:42:31,701 INFO L87 Difference]: Start difference. First operand 106 states and 164 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-08 20:42:31,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:42:31,875 INFO L93 Difference]: Finished difference Result 388 states and 599 transitions. [2024-11-08 20:42:31,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:42:31,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 247 [2024-11-08 20:42:31,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:42:31,878 INFO L225 Difference]: With dead ends: 388 [2024-11-08 20:42:31,878 INFO L226 Difference]: Without dead ends: 285 [2024-11-08 20:42:31,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:42:31,879 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 279 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:42:31,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 772 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:42:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-08 20:42:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 102. [2024-11-08 20:42:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 60 states have internal predecessors, (77), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 20:42:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 157 transitions. [2024-11-08 20:42:31,890 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 157 transitions. Word has length 247 [2024-11-08 20:42:31,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:42:31,890 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 157 transitions. [2024-11-08 20:42:31,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-08 20:42:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 157 transitions. [2024-11-08 20:42:31,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-08 20:42:31,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:42:31,892 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:42:31,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 20:42:31,893 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:42:31,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:42:31,893 INFO L85 PathProgramCache]: Analyzing trace with hash -859588120, now seen corresponding path program 1 times [2024-11-08 20:42:31,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:42:31,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046467107] [2024-11-08 20:42:31,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:42:31,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:42:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat