./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_loopvsstraightlinecode_25-while_file-86.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 2913b0b37cedaad46898416f14d6d48f794ee48dff0db1d9168d82fbaf447562 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:37:37,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:37:37,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:37:37,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:37:37,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:37:37,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:37:37,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:37:37,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:37:37,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:37:37,432 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:37:37,433 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:37:37,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:37:37,434 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:37:37,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:37:37,435 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:37:37,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:37:37,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:37:37,437 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:37:37,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:37:37,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:37:37,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:37:37,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:37:37,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:37:37,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:37:37,442 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:37:37,442 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:37:37,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:37:37,443 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:37:37,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:37:37,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:37:37,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:37:37,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:37:37,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:37:37,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:37:37,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:37:37,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:37:37,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:37:37,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:37:37,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:37:37,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:37:37,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:37:37,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:37:37,447 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 -> 2913b0b37cedaad46898416f14d6d48f794ee48dff0db1d9168d82fbaf447562 [2024-11-16 16:37:37,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:37:37,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:37:37,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:37:37,756 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:37:37,757 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:37:37,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-86.i [2024-11-16 16:37:39,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:37:39,347 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:37:39,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-86.i [2024-11-16 16:37:39,357 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c017277/05dfd47bead04a0facb47b61c670208d/FLAG69b0e64da [2024-11-16 16:37:39,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c017277/05dfd47bead04a0facb47b61c670208d [2024-11-16 16:37:39,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:37:39,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:37:39,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:37:39,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:37:39,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:37:39,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:37:39" (1/1) ... [2024-11-16 16:37:39,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e92259e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:37:39, skipping insertion in model container [2024-11-16 16:37:39,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:37:39" (1/1) ... [2024-11-16 16:37:39,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:37:39,917 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_loopvsstraightlinecode_25-while_file-86.i[915,928] [2024-11-16 16:37:39,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:37:39,960 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:37:39,970 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_loopvsstraightlinecode_25-while_file-86.i[915,928] [2024-11-16 16:37:39,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:37:40,004 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:37:40,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:37:40 WrapperNode [2024-11-16 16:37:40,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:37:40,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:37:40,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:37:40,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:37:40,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:37:40" (1/1) ... [2024-11-16 16:37:40,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:37:40" (1/1) ... [2024-11-16 16:37:40,058 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-11-16 16:37:40,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:37:40,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:37:40,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:37:40,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:37:40,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:37:40" (1/1) ... [2024-11-16 16:37:40,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:37:40" (1/1) ... [2024-11-16 16:37:40,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:37:40" (1/1) ... [2024-11-16 16:37:40,093 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-16 16:37:40,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:37:40" (1/1) ... [2024-11-16 16:37:40,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:37:40" (1/1) ... [2024-11-16 16:37:40,099 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:37:40" (1/1) ... [2024-11-16 16:37:40,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:37:40" (1/1) ... [2024-11-16 16:37:40,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:37:40" (1/1) ... [2024-11-16 16:37:40,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:37:40" (1/1) ... [2024-11-16 16:37:40,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:37:40,106 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:37:40,106 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:37:40,106 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:37:40,107 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:37:40" (1/1) ... [2024-11-16 16:37:40,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:37:40,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:37:40,150 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-16 16:37:40,162 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-16 16:37:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:37:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:37:40,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:37:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:37:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:37:40,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:37:40,289 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:37:40,291 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:37:40,589 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 16:37:40,589 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:37:40,606 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:37:40,607 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:37:40,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:37:40 BoogieIcfgContainer [2024-11-16 16:37:40,607 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:37:40,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:37:40,611 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:37:40,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:37:40,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:37:39" (1/3) ... [2024-11-16 16:37:40,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbfd459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:37:40, skipping insertion in model container [2024-11-16 16:37:40,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:37:40" (2/3) ... [2024-11-16 16:37:40,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbfd459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:37:40, skipping insertion in model container [2024-11-16 16:37:40,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:37:40" (3/3) ... [2024-11-16 16:37:40,618 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-86.i [2024-11-16 16:37:40,634 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:37:40,635 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:37:40,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:37:40,747 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;@3a46570a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:37:40,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:37:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 16:37:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 16:37:40,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:37:40,778 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:37:40,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:37:40,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:37:40,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2128816395, now seen corresponding path program 1 times [2024-11-16 16:37:40,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:37:40,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659610910] [2024-11-16 16:37:40,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:37:40,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:37:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:37:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:37:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:37:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:37:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:37:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:37:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:37:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:37:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:37:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:37:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:37:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:37:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:37:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:37:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:37:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:37:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 16:37:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-16 16:37:41,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:37:41,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659610910] [2024-11-16 16:37:41,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659610910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:37:41,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:37:41,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:37:41,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454411457] [2024-11-16 16:37:41,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:37:41,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:37:41,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:37:41,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:37:41,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:37:41,219 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-16 16:37:41,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:37:41,248 INFO L93 Difference]: Finished difference Result 100 states and 166 transitions. [2024-11-16 16:37:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:37:41,250 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110 [2024-11-16 16:37:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:37:41,255 INFO L225 Difference]: With dead ends: 100 [2024-11-16 16:37:41,255 INFO L226 Difference]: Without dead ends: 49 [2024-11-16 16:37:41,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-16 16:37:41,261 INFO L432 NwaCegarLoop]: 70 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, 70 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-16 16:37:41,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:37:41,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-16 16:37:41,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-16 16:37:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 16:37:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-11-16 16:37:41,299 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 110 [2024-11-16 16:37:41,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:37:41,299 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-16 16:37:41,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-16 16:37:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2024-11-16 16:37:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 16:37:41,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:37:41,302 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:37:41,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:37:41,303 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:37:41,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:37:41,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1724598516, now seen corresponding path program 1 times [2024-11-16 16:37:41,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:37:41,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774244136] [2024-11-16 16:37:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:37:41,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:37:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:37:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:37:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:37:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:37:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:37:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:37:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:37:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:37:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:37:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:37:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:37:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:37:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:37:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:37:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:37:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:37:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 16:37:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-16 16:37:43,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:37:43,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774244136] [2024-11-16 16:37:43,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774244136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:37:43,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:37:43,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:37:43,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415070980] [2024-11-16 16:37:43,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:37:43,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:37:43,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:37:43,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:37:43,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:37:43,546 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-16 16:37:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:37:43,739 INFO L93 Difference]: Finished difference Result 141 states and 204 transitions. [2024-11-16 16:37:43,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:37:43,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110 [2024-11-16 16:37:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:37:43,744 INFO L225 Difference]: With dead ends: 141 [2024-11-16 16:37:43,746 INFO L226 Difference]: Without dead ends: 95 [2024-11-16 16:37:43,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-16 16:37:43,748 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 61 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:37:43,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 150 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:37:43,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-16 16:37:43,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-11-16 16:37:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 16:37:43,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-16 16:37:43,786 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 110 [2024-11-16 16:37:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:37:43,787 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-16 16:37:43,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-16 16:37:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-16 16:37:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 16:37:43,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:37:43,789 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:37:43,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:37:43,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:37:43,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:37:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1695969365, now seen corresponding path program 1 times [2024-11-16 16:37:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:37:43,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073481108] [2024-11-16 16:37:43,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:37:43,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:37:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:37:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:37:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:37:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:37:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:37:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:37:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:37:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:37:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:37:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:37:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:37:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:37:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:37:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:37:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:37:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:37:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 16:37:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-16 16:37:46,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:37:46,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073481108] [2024-11-16 16:37:46,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073481108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:37:46,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:37:46,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 16:37:46,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530698651] [2024-11-16 16:37:46,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:37:46,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 16:37:46,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:37:46,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 16:37:46,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-16 16:37:46,589 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 16:37:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:37:47,134 INFO L93 Difference]: Finished difference Result 194 states and 274 transitions. [2024-11-16 16:37:47,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 16:37:47,136 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-11-16 16:37:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:37:47,141 INFO L225 Difference]: With dead ends: 194 [2024-11-16 16:37:47,141 INFO L226 Difference]: Without dead ends: 191 [2024-11-16 16:37:47,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:37:47,143 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 88 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 16:37:47,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 272 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 16:37:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-16 16:37:47,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2024-11-16 16:37:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 109 states have (on average 1.1926605504587156) internal successors, (130), 111 states have internal predecessors, (130), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-16 16:37:47,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 258 transitions. [2024-11-16 16:37:47,194 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 258 transitions. Word has length 110 [2024-11-16 16:37:47,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:37:47,195 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 258 transitions. [2024-11-16 16:37:47,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 16:37:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 258 transitions. [2024-11-16 16:37:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 16:37:47,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:37:47,199 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:37:47,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 16:37:47,200 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:37:47,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:37:47,201 INFO L85 PathProgramCache]: Analyzing trace with hash 46840970, now seen corresponding path program 1 times [2024-11-16 16:37:47,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:37:47,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879519664] [2024-11-16 16:37:47,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:37:47,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:37:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:37:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:37:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:37:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:37:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:37:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:37:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:37:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:37:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:37:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:37:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:37:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:37:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:37:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:37:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:37:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:37:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 16:37:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-16 16:37:49,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:37:49,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879519664] [2024-11-16 16:37:49,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879519664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:37:49,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:37:49,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 16:37:49,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088733792] [2024-11-16 16:37:49,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:37:49,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 16:37:49,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:37:49,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 16:37:49,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-16 16:37:49,969 INFO L87 Difference]: Start difference. First operand 178 states and 258 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 16:37:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:37:50,366 INFO L93 Difference]: Finished difference Result 195 states and 274 transitions. [2024-11-16 16:37:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 16:37:50,367 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-11-16 16:37:50,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:37:50,371 INFO L225 Difference]: With dead ends: 195 [2024-11-16 16:37:50,371 INFO L226 Difference]: Without dead ends: 192 [2024-11-16 16:37:50,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:37:50,375 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 31 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:37:50,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 275 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:37:50,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-16 16:37:50,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 173. [2024-11-16 16:37:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 104 states have (on average 1.1923076923076923) internal successors, (124), 106 states have internal predecessors, (124), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-16 16:37:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 252 transitions. [2024-11-16 16:37:50,411 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 252 transitions. Word has length 110 [2024-11-16 16:37:50,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:37:50,412 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 252 transitions. [2024-11-16 16:37:50,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 16:37:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 252 transitions. [2024-11-16 16:37:50,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 16:37:50,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:37:50,414 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:37:50,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 16:37:50,414 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:37:50,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:37:50,415 INFO L85 PathProgramCache]: Analyzing trace with hash 802046572, now seen corresponding path program 1 times [2024-11-16 16:37:50,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:37:50,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135969695] [2024-11-16 16:37:50,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:37:50,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:37:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:37:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:37:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:37:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:37:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:37:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:37:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:37:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:37:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:37:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:37:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:37:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:37:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:37:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:37:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:37:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:37:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 16:37:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-16 16:37:52,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:37:52,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135969695] [2024-11-16 16:37:52,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135969695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:37:52,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:37:52,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 16:37:52,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266624260] [2024-11-16 16:37:52,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:37:52,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 16:37:52,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:37:52,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 16:37:52,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-16 16:37:52,816 INFO L87 Difference]: Start difference. First operand 173 states and 252 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 16:37:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:37:53,131 INFO L93 Difference]: Finished difference Result 190 states and 269 transitions. [2024-11-16 16:37:53,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 16:37:53,132 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-11-16 16:37:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:37:53,134 INFO L225 Difference]: With dead ends: 190 [2024-11-16 16:37:53,134 INFO L226 Difference]: Without dead ends: 187 [2024-11-16 16:37:53,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-16 16:37:53,135 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 43 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:37:53,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 232 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:37:53,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-16 16:37:53,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 176. [2024-11-16 16:37:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 107 states have (on average 1.1775700934579438) internal successors, (126), 109 states have internal predecessors, (126), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-16 16:37:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 254 transitions. [2024-11-16 16:37:53,162 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 254 transitions. Word has length 110 [2024-11-16 16:37:53,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:37:53,163 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 254 transitions. [2024-11-16 16:37:53,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 16:37:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 254 transitions. [2024-11-16 16:37:53,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 16:37:53,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:37:53,168 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:37:53,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 16:37:53,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:37:53,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:37:53,169 INFO L85 PathProgramCache]: Analyzing trace with hash -50177059, now seen corresponding path program 1 times [2024-11-16 16:37:53,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:37:53,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829099726] [2024-11-16 16:37:53,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:37:53,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:37:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:37:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:37:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:37:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:37:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:37:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:37:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:37:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:37:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:37:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:37:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:37:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:37:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:37:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:37:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:37:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:37:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 16:37:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-16 16:37:54,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:37:54,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829099726] [2024-11-16 16:37:54,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829099726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:37:54,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:37:54,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 16:37:54,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144369308] [2024-11-16 16:37:54,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:37:54,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 16:37:54,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:37:54,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 16:37:54,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 16:37:54,731 INFO L87 Difference]: Start difference. First operand 176 states and 254 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 16:37:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:37:55,085 INFO L93 Difference]: Finished difference Result 202 states and 282 transitions. [2024-11-16 16:37:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 16:37:55,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2024-11-16 16:37:55,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:37:55,087 INFO L225 Difference]: With dead ends: 202 [2024-11-16 16:37:55,087 INFO L226 Difference]: Without dead ends: 199 [2024-11-16 16:37:55,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-16 16:37:55,089 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 43 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:37:55,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 357 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:37:55,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-16 16:37:55,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 177. [2024-11-16 16:37:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 110 states have internal predecessors, (128), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-16 16:37:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 256 transitions. [2024-11-16 16:37:55,122 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 256 transitions. Word has length 111 [2024-11-16 16:37:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:37:55,122 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 256 transitions. [2024-11-16 16:37:55,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 16:37:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 256 transitions. [2024-11-16 16:37:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 16:37:55,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:37:55,125 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:37:55,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 16:37:55,125 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:37:55,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:37:55,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1663904675, now seen corresponding path program 1 times [2024-11-16 16:37:55,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:37:55,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284494666] [2024-11-16 16:37:55,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:37:55,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:37:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:37:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:37:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:37:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:37:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:37:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:37:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:37:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:37:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:37:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:37:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:37:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:37:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:37:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:37:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:37:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:37:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 16:37:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-16 16:37:55,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:37:55,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284494666] [2024-11-16 16:37:55,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284494666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:37:55,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:37:55,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:37:55,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964647104] [2024-11-16 16:37:55,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:37:55,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:37:55,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:37:55,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:37:55,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:37:55,202 INFO L87 Difference]: Start difference. First operand 177 states and 256 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 16:37:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:37:55,253 INFO L93 Difference]: Finished difference Result 511 states and 739 transitions. [2024-11-16 16:37:55,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:37:55,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2024-11-16 16:37:55,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:37:55,257 INFO L225 Difference]: With dead ends: 511 [2024-11-16 16:37:55,257 INFO L226 Difference]: Without dead ends: 337 [2024-11-16 16:37:55,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:37:55,259 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 62 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:37:55,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 191 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:37:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-16 16:37:55,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 333. [2024-11-16 16:37:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 196 states have (on average 1.1326530612244898) internal successors, (222), 200 states have internal predecessors, (222), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 124 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-16 16:37:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 478 transitions. [2024-11-16 16:37:55,301 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 478 transitions. Word has length 111 [2024-11-16 16:37:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:37:55,302 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 478 transitions. [2024-11-16 16:37:55,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 16:37:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 478 transitions. [2024-11-16 16:37:55,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 16:37:55,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:37:55,306 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:37:55,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 16:37:55,306 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:37:55,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:37:55,306 INFO L85 PathProgramCache]: Analyzing trace with hash 78905660, now seen corresponding path program 1 times [2024-11-16 16:37:55,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:37:55,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492870672] [2024-11-16 16:37:55,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:37:55,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:37:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:37:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:37:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:37:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:37:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:37:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:37:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:37:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:37:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:37:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:37:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:37:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:37:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:37:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:37:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:37:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:37:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 16:37:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-16 16:37:55,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:37:55,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492870672] [2024-11-16 16:37:55,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492870672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:37:55,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:37:55,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:37:55,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763791824] [2024-11-16 16:37:55,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:37:55,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:37:55,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:37:55,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:37:55,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:37:55,458 INFO L87 Difference]: Start difference. First operand 333 states and 478 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 16:37:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:37:55,509 INFO L93 Difference]: Finished difference Result 734 states and 1058 transitions. [2024-11-16 16:37:55,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:37:55,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2024-11-16 16:37:55,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:37:55,515 INFO L225 Difference]: With dead ends: 734 [2024-11-16 16:37:55,515 INFO L226 Difference]: Without dead ends: 404 [2024-11-16 16:37:55,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:37:55,518 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 29 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:37:55,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 139 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:37:55,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-16 16:37:55,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-11-16 16:37:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 233 states have (on average 1.1201716738197425) internal successors, (261), 238 states have internal predecessors, (261), 160 states have call successors, (160), 10 states have call predecessors, (160), 10 states have return successors, (160), 155 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-16 16:37:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 581 transitions. [2024-11-16 16:37:55,583 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 581 transitions. Word has length 111 [2024-11-16 16:37:55,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:37:55,584 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 581 transitions. [2024-11-16 16:37:55,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 16:37:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 581 transitions. [2024-11-16 16:37:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-16 16:37:55,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:37:55,587 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:37:55,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 16:37:55,588 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:37:55,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:37:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash -5567199, now seen corresponding path program 1 times [2024-11-16 16:37:55,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:37:55,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48981453] [2024-11-16 16:37:55,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:37:55,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:37:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:37:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:37:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:37:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:37:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:37:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:37:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:37:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:37:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:37:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:37:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:37:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:37:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:37:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:37:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:37:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:37:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 16:37:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-16 16:37:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 16:37:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 16:37:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 16:37:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 16:37:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 16:37:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 16:37:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 16:37:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 16:37:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 16:37:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 16:37:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 16:37:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-16 16:37:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 16:37:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-16 16:37:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-16 16:37:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-16 16:37:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2281 backedges. 30 proven. 7 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-16 16:37:59,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:37:59,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48981453] [2024-11-16 16:37:59,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48981453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 16:37:59,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558504664] [2024-11-16 16:37:59,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:37:59,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:37:59,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:37:59,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 16:37:59,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 16:37:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:37:59,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-16 16:37:59,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:38:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2281 backedges. 263 proven. 66 refuted. 0 times theorem prover too weak. 1952 trivial. 0 not checked. [2024-11-16 16:38:09,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:38:22,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2281 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2273 trivial. 0 not checked. [2024-11-16 16:38:22,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558504664] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 16:38:22,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 16:38:22,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19, 15] total 37 [2024-11-16 16:38:22,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294437677] [2024-11-16 16:38:22,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:38:22,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 16:38:22,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:38:22,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 16:38:22,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1190, Unknown=12, NotChecked=0, Total=1332 [2024-11-16 16:38:22,671 INFO L87 Difference]: Start difference. First operand 404 states and 581 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 16:38:22,695 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse29 (mod c_~var_1_16~0 256))) (let ((.cse4 (+ c_~var_1_9~0 1)) (.cse3 (= .cse29 (mod c_~var_1_18~0 256))) (.cse5 (= .cse29 0))) (and (or (let ((.cse1 (= (mod c_~var_1_3~0 c_~var_1_8~0) 0)) (.cse2 (+ c_~var_1_3~0 1)) (.cse0 (+ (div c_~var_1_3~0 c_~var_1_8~0) c_~var_1_10~0))) (and (or (< c_~var_1_9~0 .cse0) (and (not .cse1) (<= .cse2 0))) .cse3 (or (< 0 (+ c_~var_1_8~0 1)) .cse1 (< .cse4 .cse0) (< 0 .cse2)) (<= c_~var_1_9~0 .cse0))) .cse5) (or (let ((.cse8 (+ |c_ULTIMATE.start_step_~stepLocal_0~0#1| 1)) (.cse7 (+ |c_ULTIMATE.start_step_~stepLocal_0~0#1| 2))) (and (forall ((~var_1_8~0 Int)) (or (forall ((~var_1_3~0 Int)) (let ((.cse6 (div ~var_1_3~0 ~var_1_8~0))) (or (< .cse6 .cse7) (< c_~var_1_9~0 (+ .cse6 c_~var_1_10~0)) (< ~var_1_3~0 0)))) (< 0 (+ ~var_1_8~0 1)))) (or (forall ((~var_1_3~0 Int) (~var_1_8~0 Int)) (or (< (div ~var_1_3~0 ~var_1_8~0) .cse8) (not (= (mod ~var_1_3~0 ~var_1_8~0) 0)))) .cse3) (forall ((~var_1_8~0 Int)) (or (< ~var_1_8~0 0) (forall ((~var_1_3~0 Int)) (let ((.cse9 (div ~var_1_3~0 ~var_1_8~0))) (or (< .cse9 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= .cse9 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (< c_~var_1_9~0 (+ .cse9 c_~var_1_10~0)) (not (= (mod ~var_1_3~0 ~var_1_8~0) 0))))))) (forall ((~var_1_8~0 Int)) (or (forall ((~var_1_3~0 Int)) (let ((.cse10 (div ~var_1_3~0 ~var_1_8~0))) (or (< c_~var_1_9~0 (+ .cse10 c_~var_1_10~0 1)) (< .cse10 .cse7)))) (< 0 (+ ~var_1_8~0 1)))) (or (forall ((~var_1_3~0 Int) (~var_1_8~0 Int)) (or (< (div ~var_1_3~0 ~var_1_8~0) .cse8) (< 0 (+ ~var_1_8~0 1)) (not (= (mod ~var_1_3~0 ~var_1_8~0) 0)))) .cse3) (forall ((~var_1_8~0 Int)) (or (forall ((~var_1_3~0 Int)) (let ((.cse11 (div ~var_1_3~0 ~var_1_8~0))) (or (< c_~var_1_9~0 (+ .cse11 c_~var_1_10~0 1)) (< .cse11 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= .cse11 |c_ULTIMATE.start_step_~stepLocal_0~0#1|)))) (< ~var_1_8~0 0))) (forall ((~var_1_3~0 Int) (~var_1_8~0 Int)) (let ((.cse12 (div ~var_1_3~0 ~var_1_8~0))) (or (< 0 (+ ~var_1_3~0 1)) (< .cse12 .cse7) (< 0 (+ ~var_1_8~0 1)) (< .cse4 (+ .cse12 c_~var_1_10~0)) (= (mod ~var_1_3~0 ~var_1_8~0) 0)))) (or .cse3 (and (forall ((~var_1_8~0 Int)) (or (< ~var_1_8~0 0) (forall ((~var_1_3~0 Int)) (or (< 0 (+ ~var_1_3~0 1)) (< (div ~var_1_3~0 ~var_1_8~0) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= (mod ~var_1_3~0 ~var_1_8~0) 0))))) (forall ((~var_1_8~0 Int)) (or (< ~var_1_8~0 0) (forall ((~var_1_3~0 Int)) (let ((.cse13 (div ~var_1_3~0 ~var_1_8~0))) (or (< .cse13 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= .cse13 |c_ULTIMATE.start_step_~stepLocal_0~0#1|)))))))) (or (forall ((~var_1_3~0 Int) (~var_1_8~0 Int)) (or (< (div ~var_1_3~0 ~var_1_8~0) .cse7) (< 0 (+ ~var_1_8~0 1)))) .cse3) (forall ((~var_1_8~0 Int)) (or (forall ((~var_1_3~0 Int)) (let ((.cse14 (div ~var_1_3~0 ~var_1_8~0))) (or (< 0 (+ ~var_1_3~0 1)) (< c_~var_1_9~0 (+ .cse14 c_~var_1_10~0 1)) (< .cse14 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= (mod ~var_1_3~0 ~var_1_8~0) 0)))) (< ~var_1_8~0 0))) (forall ((~var_1_3~0 Int) (~var_1_8~0 Int)) (let ((.cse15 (div ~var_1_3~0 ~var_1_8~0))) (or (< c_~var_1_9~0 (+ .cse15 c_~var_1_10~0 1)) (< .cse15 .cse7)))) (or (forall ((~var_1_3~0 Int) (~var_1_8~0 Int)) (or (< (div ~var_1_3~0 ~var_1_8~0) .cse8) (< 0 (+ ~var_1_8~0 1)) (< ~var_1_3~0 0))) .cse3) (forall ((~var_1_8~0 Int)) (or (forall ((~var_1_3~0 Int)) (let ((.cse16 (div ~var_1_3~0 ~var_1_8~0))) (or (< .cse16 .cse7) (< c_~var_1_9~0 (+ .cse16 c_~var_1_10~0)) (not (= (mod ~var_1_3~0 ~var_1_8~0) 0))))) (< 0 (+ ~var_1_8~0 1)))) (or (forall ((~var_1_3~0 Int) (~var_1_8~0 Int)) (or (< (div ~var_1_3~0 ~var_1_8~0) .cse8) (< ~var_1_3~0 0))) .cse3) (forall ((~var_1_3~0 Int) (~var_1_8~0 Int)) (let ((.cse17 (div ~var_1_3~0 ~var_1_8~0))) (or (< .cse17 .cse7) (< c_~var_1_9~0 (+ .cse17 c_~var_1_10~0)) (< ~var_1_3~0 0)))) (forall ((~var_1_3~0 Int)) (or (forall ((~var_1_8~0 Int)) (let ((.cse18 (div ~var_1_3~0 ~var_1_8~0))) (or (< .cse18 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= .cse18 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (< c_~var_1_9~0 (+ .cse18 c_~var_1_10~0))))) (< ~var_1_3~0 0))) (forall ((~var_1_3~0 Int)) (or (forall ((~var_1_8~0 Int)) (let ((.cse19 (div ~var_1_3~0 ~var_1_8~0))) (or (< .cse19 .cse8) (< c_~var_1_9~0 (+ .cse19 c_~var_1_10~0))))) (< ~var_1_3~0 0))) (forall ((~var_1_8~0 Int)) (or (< ~var_1_8~0 0) (forall ((~var_1_3~0 Int)) (let ((.cse20 (div ~var_1_3~0 ~var_1_8~0))) (or (< .cse20 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= .cse20 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (< c_~var_1_9~0 (+ .cse20 c_~var_1_10~0)) (< ~var_1_3~0 0)))))) (or (forall ((~var_1_3~0 Int) (~var_1_8~0 Int)) (let ((.cse21 (div ~var_1_3~0 ~var_1_8~0))) (or (< .cse21 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= .cse21 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (< ~var_1_3~0 0)))) .cse3) (forall ((~var_1_8~0 Int)) (or (forall ((~var_1_3~0 Int)) (let ((.cse22 (div ~var_1_3~0 ~var_1_8~0))) (or (< 0 (+ ~var_1_3~0 1)) (< .cse22 .cse7) (< .cse4 (+ .cse22 c_~var_1_10~0)) (= (mod ~var_1_3~0 ~var_1_8~0) 0)))) (< 0 (+ ~var_1_8~0 1)))) (forall ((~var_1_8~0 Int)) (or (< 0 (+ ~var_1_8~0 1)) (forall ((~var_1_3~0 Int)) (let ((.cse23 (div ~var_1_3~0 ~var_1_8~0))) (or (< .cse23 .cse8) (< c_~var_1_9~0 (+ .cse23 c_~var_1_10~0)) (not (= (mod ~var_1_3~0 ~var_1_8~0) 0))))))) (forall ((~var_1_8~0 Int)) (or (< 0 (+ ~var_1_8~0 1)) (forall ((~var_1_3~0 Int)) (let ((.cse24 (div ~var_1_3~0 ~var_1_8~0))) (or (< .cse24 .cse8) (< c_~var_1_9~0 (+ .cse24 c_~var_1_10~0)) (< ~var_1_3~0 0)))))) (forall ((~var_1_3~0 Int) (~var_1_8~0 Int)) (let ((.cse25 (div ~var_1_3~0 ~var_1_8~0))) (or (< .cse25 .cse7) (< c_~var_1_9~0 (+ .cse25 c_~var_1_10~0)) (not (= (mod ~var_1_3~0 ~var_1_8~0) 0))))) (forall ((~var_1_3~0 Int) (~var_1_8~0 Int)) (let ((.cse26 (div ~var_1_3~0 ~var_1_8~0))) (or (< .cse26 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= .cse26 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (< c_~var_1_9~0 (+ .cse26 c_~var_1_10~0)) (not (= (mod ~var_1_3~0 ~var_1_8~0) 0))))) (or (forall ((~var_1_3~0 Int) (~var_1_8~0 Int)) (let ((.cse27 (div ~var_1_3~0 ~var_1_8~0))) (or (< .cse27 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= .cse27 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (not (= (mod ~var_1_3~0 ~var_1_8~0) 0))))) .cse3) (forall ((~var_1_3~0 Int) (~var_1_8~0 Int)) (let ((.cse28 (div ~var_1_3~0 ~var_1_8~0))) (or (< .cse28 .cse8) (< c_~var_1_9~0 (+ .cse28 c_~var_1_10~0)) (not (= (mod ~var_1_3~0 ~var_1_8~0) 0))))) (or (forall ((~var_1_3~0 Int) (~var_1_8~0 Int)) (< (div ~var_1_3~0 ~var_1_8~0) .cse7)) .cse3))) .cse5)))) is different from false [2024-11-16 16:38:27,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-16 16:38:29,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-16 16:38:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:38:32,176 INFO L93 Difference]: Finished difference Result 500 states and 710 transitions. [2024-11-16 16:38:32,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 16:38:32,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 217 [2024-11-16 16:38:32,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:38:32,182 INFO L225 Difference]: With dead ends: 500 [2024-11-16 16:38:32,182 INFO L226 Difference]: Without dead ends: 497 [2024-11-16 16:38:32,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=151, Invalid=1393, Unknown=20, NotChecked=76, Total=1640 [2024-11-16 16:38:32,186 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 84 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-16 16:38:32,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 464 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 170 Invalid, 3 Unknown, 28 Unchecked, 8.8s Time] [2024-11-16 16:38:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-16 16:38:32,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 401. [2024-11-16 16:38:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 230 states have (on average 1.1217391304347826) internal successors, (258), 235 states have internal predecessors, (258), 160 states have call successors, (160), 10 states have call predecessors, (160), 10 states have return successors, (160), 155 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-16 16:38:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 578 transitions. [2024-11-16 16:38:32,227 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 578 transitions. Word has length 217 [2024-11-16 16:38:32,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:38:32,228 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 578 transitions. [2024-11-16 16:38:32,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 16:38:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 578 transitions. [2024-11-16 16:38:32,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-16 16:38:32,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:38:32,231 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:38:32,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 16:38:32,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:38:32,436 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:38:32,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:38:32,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1802518558, now seen corresponding path program 1 times [2024-11-16 16:38:32,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:38:32,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523524683] [2024-11-16 16:38:32,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:38:32,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:38:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:38:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:38:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:38:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:38:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:38:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:38:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:38:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:38:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:38:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:38:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:38:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:38:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:38:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:38:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:38:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:38:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 16:38:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-16 16:38:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 16:38:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 16:38:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 16:38:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 16:38:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 16:38:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 16:38:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 16:38:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 16:38:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 16:38:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 16:38:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 16:38:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-16 16:38:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 16:38:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-16 16:38:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-16 16:38:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-16 16:38:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2281 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2272 trivial. 0 not checked. [2024-11-16 16:38:34,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:38:34,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523524683] [2024-11-16 16:38:34,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523524683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:38:34,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:38:34,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 16:38:34,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366073180] [2024-11-16 16:38:34,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:38:34,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 16:38:34,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:38:34,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 16:38:34,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:38:34,624 INFO L87 Difference]: Start difference. First operand 401 states and 578 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 16:38:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:38:35,138 INFO L93 Difference]: Finished difference Result 489 states and 673 transitions. [2024-11-16 16:38:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 16:38:35,139 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 217 [2024-11-16 16:38:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:38:35,143 INFO L225 Difference]: With dead ends: 489 [2024-11-16 16:38:35,143 INFO L226 Difference]: Without dead ends: 486 [2024-11-16 16:38:35,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-16 16:38:35,144 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 38 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 16:38:35,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 366 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 16:38:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-11-16 16:38:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 406. [2024-11-16 16:38:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 235 states have (on average 1.127659574468085) internal successors, (265), 240 states have internal predecessors, (265), 160 states have call successors, (160), 10 states have call predecessors, (160), 10 states have return successors, (160), 155 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-16 16:38:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 585 transitions. [2024-11-16 16:38:35,184 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 585 transitions. Word has length 217 [2024-11-16 16:38:35,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:38:35,185 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 585 transitions. [2024-11-16 16:38:35,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-16 16:38:35,185 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 585 transitions. [2024-11-16 16:38:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-16 16:38:35,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:38:35,188 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:38:35,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 16:38:35,188 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:38:35,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:38:35,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1983699400, now seen corresponding path program 1 times [2024-11-16 16:38:35,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:38:35,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275597088] [2024-11-16 16:38:35,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:38:35,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:38:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:38:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:38:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:38:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:38:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:38:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:38:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:38:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:38:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:38:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:38:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:38:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:38:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:38:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:38:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:38:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:38:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 16:38:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 16:38:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 16:38:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 16:38:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 16:38:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 16:38:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 16:38:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 16:38:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 16:38:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 16:38:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-16 16:38:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 16:38:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-16 16:38:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-16 16:38:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-16 16:38:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-16 16:38:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-16 16:38:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-16 16:38:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2281 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-16 16:38:35,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:38:35,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275597088] [2024-11-16 16:38:35,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275597088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:38:35,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:38:35,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:38:35,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267221439] [2024-11-16 16:38:35,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:38:35,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:38:35,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:38:35,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:38:35,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:38:35,325 INFO L87 Difference]: Start difference. First operand 406 states and 585 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-16 16:38:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:38:35,376 INFO L93 Difference]: Finished difference Result 743 states and 1070 transitions. [2024-11-16 16:38:35,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:38:35,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 217 [2024-11-16 16:38:35,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:38:35,383 INFO L225 Difference]: With dead ends: 743 [2024-11-16 16:38:35,383 INFO L226 Difference]: Without dead ends: 411 [2024-11-16 16:38:35,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:38:35,385 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 27 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:38:35,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 137 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:38:35,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-16 16:38:35,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 336. [2024-11-16 16:38:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 199 states have (on average 1.1105527638190955) internal successors, (221), 203 states have internal predecessors, (221), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 124 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-16 16:38:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 477 transitions. [2024-11-16 16:38:35,420 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 477 transitions. Word has length 217 [2024-11-16 16:38:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:38:35,421 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 477 transitions. [2024-11-16 16:38:35,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-16 16:38:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 477 transitions. [2024-11-16 16:38:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-16 16:38:35,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:38:35,425 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:38:35,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 16:38:35,425 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:38:35,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:38:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1128250361, now seen corresponding path program 1 times [2024-11-16 16:38:35,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:38:35,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862612182] [2024-11-16 16:38:35,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:38:35,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:38:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:38:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:38:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:38:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:38:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:38:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:38:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:38:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:38:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:38:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:38:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:38:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:38:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:38:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:38:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 16:38:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 16:38:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 16:38:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 16:38:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 16:38:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 16:38:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 16:38:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 16:38:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 16:38:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 16:38:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 16:38:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 16:38:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-16 16:38:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 16:38:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-16 16:38:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-16 16:38:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-16 16:38:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-16 16:38:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-16 16:38:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-16 16:38:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2281 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-16 16:38:37,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:38:37,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862612182] [2024-11-16 16:38:37,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862612182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 16:38:37,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862551770] [2024-11-16 16:38:37,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:38:37,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:38:37,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:38:37,516 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 16:38:37,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 16:38:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:38:37,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-16 16:38:37,647 INFO L278 TraceCheckSpWp]: Computing forward predicates...