./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-34.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 125f40803e1b985402482e09336346a774ad0c00eff4ec5b89ac9ebb2ee5c085 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:39:38,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:39:38,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:39:38,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:39:38,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:39:38,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:39:38,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:39:38,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:39:38,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:39:38,823 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:39:38,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:39:38,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:39:38,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:39:38,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:39:38,827 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:39:38,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:39:38,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:39:38,828 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:39:38,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:39:38,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:39:38,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:39:38,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:39:38,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:39:38,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:39:38,834 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:39:38,835 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:39:38,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:39:38,835 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:39:38,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:39:38,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:39:38,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:39:38,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:39:38,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:39:38,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:39:38,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:39:38,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:39:38,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:39:38,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:39:38,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:39:38,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:39:38,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:39:38,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:39:38,844 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 -> 125f40803e1b985402482e09336346a774ad0c00eff4ec5b89ac9ebb2ee5c085 [2024-10-13 04:39:39,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:39:39,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:39:39,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:39:39,142 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:39:39,142 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:39:39,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-34.i [2024-10-13 04:39:40,667 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:39:40,893 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:39:40,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-34.i [2024-10-13 04:39:40,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe5c2e42/40f5898650bb405a9154ccad97ee78a9/FLAG30cd78461 [2024-10-13 04:39:41,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe5c2e42/40f5898650bb405a9154ccad97ee78a9 [2024-10-13 04:39:41,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:39:41,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:39:41,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:39:41,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:39:41,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:39:41,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:39:41" (1/1) ... [2024-10-13 04:39:41,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce3a9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:39:41, skipping insertion in model container [2024-10-13 04:39:41,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:39:41" (1/1) ... [2024-10-13 04:39:41,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:39:41,445 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-34.i[915,928] [2024-10-13 04:39:41,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:39:41,509 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:39:41,521 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-34.i[915,928] [2024-10-13 04:39:41,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:39:41,565 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:39:41,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:39:41 WrapperNode [2024-10-13 04:39:41,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:39:41,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:39:41,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:39:41,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:39:41,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:39:41" (1/1) ... [2024-10-13 04:39:41,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:39:41" (1/1) ... [2024-10-13 04:39:41,627 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-10-13 04:39:41,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:39:41,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:39:41,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:39:41,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:39:41,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:39:41" (1/1) ... [2024-10-13 04:39:41,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:39:41" (1/1) ... [2024-10-13 04:39:41,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:39:41" (1/1) ... [2024-10-13 04:39:41,663 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:39:41,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:39:41" (1/1) ... [2024-10-13 04:39:41,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:39:41" (1/1) ... [2024-10-13 04:39:41,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:39:41" (1/1) ... [2024-10-13 04:39:41,676 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:39:41" (1/1) ... [2024-10-13 04:39:41,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:39:41" (1/1) ... [2024-10-13 04:39:41,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:39:41" (1/1) ... [2024-10-13 04:39:41,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:39:41,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:39:41,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:39:41,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:39:41,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:39:41" (1/1) ... [2024-10-13 04:39:41,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:39:41,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:39:41,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:39:41,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:39:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:39:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:39:41,786 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:39:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:39:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:39:41,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:39:41,879 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:39:41,881 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:39:42,321 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-13 04:39:42,321 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:39:42,379 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:39:42,379 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:39:42,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:39:42 BoogieIcfgContainer [2024-10-13 04:39:42,380 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:39:42,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:39:42,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:39:42,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:39:42,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:39:41" (1/3) ... [2024-10-13 04:39:42,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258646b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:39:42, skipping insertion in model container [2024-10-13 04:39:42,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:39:41" (2/3) ... [2024-10-13 04:39:42,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258646b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:39:42, skipping insertion in model container [2024-10-13 04:39:42,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:39:42" (3/3) ... [2024-10-13 04:39:42,388 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-34.i [2024-10-13 04:39:42,403 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:39:42,403 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:39:42,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:39:42,473 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;@727c6812, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:39:42,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:39:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 50 states have internal predecessors, (76), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 04:39:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-13 04:39:42,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:39:42,487 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:39:42,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:39:42,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:39:42,492 INFO L85 PathProgramCache]: Analyzing trace with hash -100955092, now seen corresponding path program 1 times [2024-10-13 04:39:42,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:39:42,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653285376] [2024-10-13 04:39:42,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:39:42,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:39:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:42,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:39:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:42,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:39:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:42,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:39:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:42,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:39:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:42,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:39:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:42,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:39:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:42,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:39:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:42,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:39:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:42,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:39:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:42,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:39:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:42,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:39:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:42,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:39:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:42,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:39:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:42,941 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:39:42,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:39:42,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653285376] [2024-10-13 04:39:42,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653285376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:39:42,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:39:42,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:39:42,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69139947] [2024-10-13 04:39:42,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:39:42,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:39:42,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:39:42,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:39:42,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:39:42,987 INFO L87 Difference]: Start difference. First operand has 65 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 50 states have internal predecessors, (76), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-13 04:39:43,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:39:43,032 INFO L93 Difference]: Finished difference Result 127 states and 215 transitions. [2024-10-13 04:39:43,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:39:43,036 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2024-10-13 04:39:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:39:43,045 INFO L225 Difference]: With dead ends: 127 [2024-10-13 04:39:43,045 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 04:39:43,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:39:43,055 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:39:43,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:39:43,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 04:39:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 04:39:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 48 states have internal predecessors, (71), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 04:39:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2024-10-13 04:39:43,111 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 90 [2024-10-13 04:39:43,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:39:43,112 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2024-10-13 04:39:43,112 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-13 04:39:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2024-10-13 04:39:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-13 04:39:43,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:39:43,117 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:39:43,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:39:43,118 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:39:43,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:39:43,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1074906774, now seen corresponding path program 1 times [2024-10-13 04:39:43,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:39:43,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000616341] [2024-10-13 04:39:43,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:39:43,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:39:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:43,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:39:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:43,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:39:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:43,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:39:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:43,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:39:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:43,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:39:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:43,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:39:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:43,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:39:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:43,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:39:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:43,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:39:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:43,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:39:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:43,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:39:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:43,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:39:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:43,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:39:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:39:43,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:39:43,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000616341] [2024-10-13 04:39:43,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000616341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:39:43,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:39:43,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:39:43,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105844568] [2024-10-13 04:39:43,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:39:43,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:39:43,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:39:43,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:39:43,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:39:43,640 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:39:43,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:39:43,781 INFO L93 Difference]: Finished difference Result 216 states and 333 transitions. [2024-10-13 04:39:43,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:39:43,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-10-13 04:39:43,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:39:43,784 INFO L225 Difference]: With dead ends: 216 [2024-10-13 04:39:43,784 INFO L226 Difference]: Without dead ends: 154 [2024-10-13 04:39:43,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:39:43,786 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 124 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:39:43,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 309 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:39:43,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-13 04:39:43,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 125. [2024-10-13 04:39:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.46875) internal successors, (141), 96 states have internal predecessors, (141), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 04:39:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 193 transitions. [2024-10-13 04:39:43,816 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 193 transitions. Word has length 90 [2024-10-13 04:39:43,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:39:43,817 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 193 transitions. [2024-10-13 04:39:43,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:39:43,818 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 193 transitions. [2024-10-13 04:39:43,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-13 04:39:43,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:39:43,820 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:39:43,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:39:43,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:39:43,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:39:43,821 INFO L85 PathProgramCache]: Analyzing trace with hash -238751484, now seen corresponding path program 1 times [2024-10-13 04:39:43,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:39:43,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166345133] [2024-10-13 04:39:43,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:39:43,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:39:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:44,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:39:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:44,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:39:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:44,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:39:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:44,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:39:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:44,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:39:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:44,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:39:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:44,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:39:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:44,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:39:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:44,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:39:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:44,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:39:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:44,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:39:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:44,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:39:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:44,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:39:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:39:44,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:39:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166345133] [2024-10-13 04:39:44,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166345133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:39:44,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:39:44,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 04:39:44,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946558511] [2024-10-13 04:39:44,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:39:44,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:39:44,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:39:44,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:39:44,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:39:44,246 INFO L87 Difference]: Start difference. First operand 125 states and 193 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:39:44,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:39:44,435 INFO L93 Difference]: Finished difference Result 368 states and 566 transitions. [2024-10-13 04:39:44,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:39:44,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2024-10-13 04:39:44,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:39:44,438 INFO L225 Difference]: With dead ends: 368 [2024-10-13 04:39:44,438 INFO L226 Difference]: Without dead ends: 244 [2024-10-13 04:39:44,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:39:44,440 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 153 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:39:44,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 290 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:39:44,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-13 04:39:44,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 129. [2024-10-13 04:39:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 100 states have (on average 1.45) internal successors, (145), 100 states have internal predecessors, (145), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 04:39:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 197 transitions. [2024-10-13 04:39:44,462 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 197 transitions. Word has length 91 [2024-10-13 04:39:44,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:39:44,463 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 197 transitions. [2024-10-13 04:39:44,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:39:44,464 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 197 transitions. [2024-10-13 04:39:44,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-13 04:39:44,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:39:44,466 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:39:44,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:39:44,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:39:44,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:39:44,467 INFO L85 PathProgramCache]: Analyzing trace with hash 635638786, now seen corresponding path program 1 times [2024-10-13 04:39:44,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:39:44,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071074651] [2024-10-13 04:39:44,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:39:44,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:39:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:51,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:39:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:51,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:39:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:51,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:39:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:51,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:39:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:51,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:39:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:51,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:39:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:51,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:39:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:51,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:39:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:51,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:39:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:51,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:39:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:51,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:39:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:51,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:39:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:51,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:39:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:39:51,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:39:51,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071074651] [2024-10-13 04:39:51,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071074651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:39:51,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:39:51,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 04:39:51,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821918048] [2024-10-13 04:39:51,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:39:51,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 04:39:51,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:39:51,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 04:39:51,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-13 04:39:51,428 INFO L87 Difference]: Start difference. First operand 129 states and 197 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:39:54,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:39:54,355 INFO L93 Difference]: Finished difference Result 465 states and 697 transitions. [2024-10-13 04:39:54,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 04:39:54,355 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-13 04:39:54,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:39:54,358 INFO L225 Difference]: With dead ends: 465 [2024-10-13 04:39:54,358 INFO L226 Difference]: Without dead ends: 337 [2024-10-13 04:39:54,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2024-10-13 04:39:54,361 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 347 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:39:54,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 496 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 04:39:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-13 04:39:54,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 187. [2024-10-13 04:39:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 144 states have (on average 1.4236111111111112) internal successors, (205), 144 states have internal predecessors, (205), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 04:39:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 283 transitions. [2024-10-13 04:39:54,397 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 283 transitions. Word has length 92 [2024-10-13 04:39:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:39:54,398 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 283 transitions. [2024-10-13 04:39:54,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:39:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 283 transitions. [2024-10-13 04:39:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-13 04:39:54,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:39:54,400 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:39:54,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 04:39:54,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:39:54,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:39:54,401 INFO L85 PathProgramCache]: Analyzing trace with hash 692897088, now seen corresponding path program 1 times [2024-10-13 04:39:54,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:39:54,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389830318] [2024-10-13 04:39:54,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:39:54,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:39:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:56,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:39:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:56,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:39:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:56,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:39:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:56,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:39:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:56,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:39:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:56,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:39:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:56,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:39:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:56,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:39:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:56,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:39:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:56,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:39:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:56,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:39:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:56,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:39:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:56,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:39:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:39:56,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:39:56,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389830318] [2024-10-13 04:39:56,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389830318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:39:56,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:39:56,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 04:39:56,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163410360] [2024-10-13 04:39:56,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:39:56,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 04:39:56,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:39:56,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 04:39:56,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:39:56,603 INFO L87 Difference]: Start difference. First operand 187 states and 283 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:39:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:39:57,406 INFO L93 Difference]: Finished difference Result 500 states and 751 transitions. [2024-10-13 04:39:57,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 04:39:57,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-13 04:39:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:39:57,411 INFO L225 Difference]: With dead ends: 500 [2024-10-13 04:39:57,411 INFO L226 Difference]: Without dead ends: 372 [2024-10-13 04:39:57,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-13 04:39:57,414 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 317 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:39:57,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 352 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 04:39:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-13 04:39:57,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 228. [2024-10-13 04:39:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 185 states have (on average 1.4378378378378378) internal successors, (266), 185 states have internal predecessors, (266), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 04:39:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 344 transitions. [2024-10-13 04:39:57,454 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 344 transitions. Word has length 92 [2024-10-13 04:39:57,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:39:57,454 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 344 transitions. [2024-10-13 04:39:57,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:39:57,455 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 344 transitions. [2024-10-13 04:39:57,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-13 04:39:57,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:39:57,458 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:39:57,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 04:39:57,458 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:39:57,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:39:57,459 INFO L85 PathProgramCache]: Analyzing trace with hash -173707840, now seen corresponding path program 1 times [2024-10-13 04:39:57,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:39:57,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895599450] [2024-10-13 04:39:57,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:39:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:39:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:59,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:39:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:59,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:39:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:59,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:39:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:59,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:39:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:59,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:39:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:59,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:39:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:59,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:39:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:59,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:39:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:59,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:39:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:59,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:39:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:59,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:39:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:59,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:39:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:59,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:39:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:39:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:39:59,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:39:59,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895599450] [2024-10-13 04:39:59,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895599450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:39:59,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:39:59,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 04:39:59,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997921309] [2024-10-13 04:39:59,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:39:59,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 04:39:59,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:39:59,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 04:39:59,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:39:59,898 INFO L87 Difference]: Start difference. First operand 228 states and 344 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:00,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:40:00,848 INFO L93 Difference]: Finished difference Result 572 states and 848 transitions. [2024-10-13 04:40:00,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 04:40:00,849 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-13 04:40:00,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:40:00,851 INFO L225 Difference]: With dead ends: 572 [2024-10-13 04:40:00,851 INFO L226 Difference]: Without dead ends: 401 [2024-10-13 04:40:00,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-13 04:40:00,853 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 268 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:40:00,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 327 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 04:40:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-13 04:40:00,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 331. [2024-10-13 04:40:00,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 288 states have (on average 1.4409722222222223) internal successors, (415), 288 states have internal predecessors, (415), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 04:40:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 493 transitions. [2024-10-13 04:40:00,879 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 493 transitions. Word has length 92 [2024-10-13 04:40:00,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:40:00,880 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 493 transitions. [2024-10-13 04:40:00,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 493 transitions. [2024-10-13 04:40:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-13 04:40:00,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:40:00,882 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:40:00,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 04:40:00,882 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:40:00,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:40:00,883 INFO L85 PathProgramCache]: Analyzing trace with hash -2037732559, now seen corresponding path program 1 times [2024-10-13 04:40:00,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:40:00,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790774468] [2024-10-13 04:40:00,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:40:00,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:40:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:01,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:40:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:01,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:40:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:01,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:40:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:01,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:40:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:01,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:40:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:01,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:40:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:01,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:40:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:01,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:40:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:40:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:40:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:40:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:40:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:40:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:40:02,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:40:02,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790774468] [2024-10-13 04:40:02,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790774468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:40:02,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:40:02,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 04:40:02,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905506737] [2024-10-13 04:40:02,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:40:02,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 04:40:02,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:40:02,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 04:40:02,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:40:02,055 INFO L87 Difference]: Start difference. First operand 331 states and 493 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:02,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:40:02,510 INFO L93 Difference]: Finished difference Result 597 states and 885 transitions. [2024-10-13 04:40:02,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:40:02,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-13 04:40:02,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:40:02,513 INFO L225 Difference]: With dead ends: 597 [2024-10-13 04:40:02,513 INFO L226 Difference]: Without dead ends: 423 [2024-10-13 04:40:02,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:40:02,515 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 157 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:40:02,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 316 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:40:02,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-10-13 04:40:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 333. [2024-10-13 04:40:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 290 states have (on average 1.4241379310344828) internal successors, (413), 290 states have internal predecessors, (413), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 04:40:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 491 transitions. [2024-10-13 04:40:02,540 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 491 transitions. Word has length 92 [2024-10-13 04:40:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:40:02,541 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 491 transitions. [2024-10-13 04:40:02,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:02,541 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 491 transitions. [2024-10-13 04:40:02,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-13 04:40:02,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:40:02,542 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:40:02,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 04:40:02,543 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:40:02,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:40:02,543 INFO L85 PathProgramCache]: Analyzing trace with hash 48832772, now seen corresponding path program 1 times [2024-10-13 04:40:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:40:02,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080126243] [2024-10-13 04:40:02,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:40:02,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:40:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:40:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:40:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:40:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:40:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:40:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:40:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:40:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:40:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:40:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:40:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:40:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:40:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:40:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:40:02,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:40:02,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080126243] [2024-10-13 04:40:02,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080126243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:40:02,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:40:02,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:40:02,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406126865] [2024-10-13 04:40:02,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:40:02,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:40:02,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:40:02,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:40:02,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:40:02,831 INFO L87 Difference]: Start difference. First operand 333 states and 491 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:03,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:40:03,008 INFO L93 Difference]: Finished difference Result 515 states and 766 transitions. [2024-10-13 04:40:03,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:40:03,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-13 04:40:03,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:40:03,011 INFO L225 Difference]: With dead ends: 515 [2024-10-13 04:40:03,012 INFO L226 Difference]: Without dead ends: 327 [2024-10-13 04:40:03,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:40:03,013 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 77 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:40:03,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 219 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:40:03,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-13 04:40:03,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 301. [2024-10-13 04:40:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 258 states have (on average 1.3914728682170543) internal successors, (359), 258 states have internal predecessors, (359), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 04:40:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 437 transitions. [2024-10-13 04:40:03,048 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 437 transitions. Word has length 92 [2024-10-13 04:40:03,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:40:03,048 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 437 transitions. [2024-10-13 04:40:03,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:03,049 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 437 transitions. [2024-10-13 04:40:03,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 04:40:03,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:40:03,050 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:40:03,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 04:40:03,050 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:40:03,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:40:03,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1114190223, now seen corresponding path program 1 times [2024-10-13 04:40:03,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:40:03,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235861168] [2024-10-13 04:40:03,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:40:03,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:40:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:05,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:40:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:05,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:40:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:05,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:40:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:05,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:40:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:05,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:40:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:05,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:40:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:05,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:40:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:05,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:40:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:05,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:40:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:05,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:40:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:05,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:40:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:05,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:40:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:05,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:40:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:40:05,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:40:05,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235861168] [2024-10-13 04:40:05,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235861168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:40:05,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:40:05,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 04:40:05,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476477156] [2024-10-13 04:40:05,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:40:05,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 04:40:05,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:40:05,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 04:40:05,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:40:05,741 INFO L87 Difference]: Start difference. First operand 301 states and 437 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:40:07,201 INFO L93 Difference]: Finished difference Result 607 states and 878 transitions. [2024-10-13 04:40:07,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 04:40:07,202 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-10-13 04:40:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:40:07,204 INFO L225 Difference]: With dead ends: 607 [2024-10-13 04:40:07,204 INFO L226 Difference]: Without dead ends: 479 [2024-10-13 04:40:07,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-13 04:40:07,205 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 208 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 04:40:07,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 581 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 04:40:07,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-13 04:40:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 317. [2024-10-13 04:40:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 272 states have (on average 1.3786764705882353) internal successors, (375), 272 states have internal predecessors, (375), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 04:40:07,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 453 transitions. [2024-10-13 04:40:07,233 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 453 transitions. Word has length 93 [2024-10-13 04:40:07,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:40:07,234 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 453 transitions. [2024-10-13 04:40:07,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:07,234 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 453 transitions. [2024-10-13 04:40:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 04:40:07,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:40:07,236 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:40:07,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 04:40:07,236 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:40:07,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:40:07,237 INFO L85 PathProgramCache]: Analyzing trace with hash -969020839, now seen corresponding path program 1 times [2024-10-13 04:40:07,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:40:07,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488227461] [2024-10-13 04:40:07,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:40:07,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:40:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:09,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:40:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:09,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:40:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:09,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:40:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:09,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:40:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:09,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:40:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:09,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:40:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:09,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:40:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:09,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:40:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:09,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:40:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:09,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:40:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:09,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:40:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:09,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:40:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:09,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:40:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:40:09,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:40:09,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488227461] [2024-10-13 04:40:09,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488227461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:40:09,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:40:09,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 04:40:09,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503291374] [2024-10-13 04:40:09,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:40:09,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 04:40:09,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:40:09,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 04:40:09,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-10-13 04:40:09,955 INFO L87 Difference]: Start difference. First operand 317 states and 453 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:11,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:40:11,688 INFO L93 Difference]: Finished difference Result 802 states and 1147 transitions. [2024-10-13 04:40:11,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 04:40:11,689 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-10-13 04:40:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:40:11,691 INFO L225 Difference]: With dead ends: 802 [2024-10-13 04:40:11,691 INFO L226 Difference]: Without dead ends: 606 [2024-10-13 04:40:11,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2024-10-13 04:40:11,696 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 283 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:40:11,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 462 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 04:40:11,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-10-13 04:40:11,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 414. [2024-10-13 04:40:11,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 369 states have (on average 1.3983739837398375) internal successors, (516), 369 states have internal predecessors, (516), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 04:40:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 594 transitions. [2024-10-13 04:40:11,733 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 594 transitions. Word has length 93 [2024-10-13 04:40:11,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:40:11,734 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 594 transitions. [2024-10-13 04:40:11,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:11,734 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 594 transitions. [2024-10-13 04:40:11,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 04:40:11,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:40:11,736 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:40:11,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 04:40:11,736 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:40:11,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:40:11,736 INFO L85 PathProgramCache]: Analyzing trace with hash -372841257, now seen corresponding path program 1 times [2024-10-13 04:40:11,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:40:11,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272674676] [2024-10-13 04:40:11,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:40:11,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:40:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:14,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:40:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:15,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:40:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:15,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:40:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:15,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:40:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:15,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:40:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:15,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:40:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:15,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:40:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:15,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:40:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:15,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:40:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:15,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:40:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:15,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:40:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:15,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:40:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:15,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:40:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:40:15,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:40:15,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272674676] [2024-10-13 04:40:15,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272674676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:40:15,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:40:15,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 04:40:15,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360791089] [2024-10-13 04:40:15,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:40:15,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 04:40:15,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:40:15,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 04:40:15,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-13 04:40:15,037 INFO L87 Difference]: Start difference. First operand 414 states and 594 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:17,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:40:17,645 INFO L93 Difference]: Finished difference Result 1172 states and 1706 transitions. [2024-10-13 04:40:17,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 04:40:17,646 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-10-13 04:40:17,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:40:17,651 INFO L225 Difference]: With dead ends: 1172 [2024-10-13 04:40:17,651 INFO L226 Difference]: Without dead ends: 958 [2024-10-13 04:40:17,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=248, Invalid=564, Unknown=0, NotChecked=0, Total=812 [2024-10-13 04:40:17,653 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 538 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:40:17,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 510 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 04:40:17,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-13 04:40:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 648. [2024-10-13 04:40:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 573 states have (on average 1.4101221640488657) internal successors, (808), 573 states have internal predecessors, (808), 65 states have call successors, (65), 9 states have call predecessors, (65), 9 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-13 04:40:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 938 transitions. [2024-10-13 04:40:17,707 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 938 transitions. Word has length 94 [2024-10-13 04:40:17,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:40:17,708 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 938 transitions. [2024-10-13 04:40:17,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 938 transitions. [2024-10-13 04:40:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 04:40:17,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:40:17,710 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:40:17,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 04:40:17,710 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:40:17,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:40:17,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1520730717, now seen corresponding path program 1 times [2024-10-13 04:40:17,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:40:17,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870905099] [2024-10-13 04:40:17,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:40:17,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:40:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:21,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:40:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:21,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:40:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:21,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:40:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:21,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:40:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:21,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:40:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:21,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:40:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:21,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:40:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:21,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:40:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:21,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:40:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:21,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:40:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:21,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:40:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:21,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:40:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:21,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:40:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:21,587 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:40:21,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:40:21,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870905099] [2024-10-13 04:40:21,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870905099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:40:21,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:40:21,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 04:40:21,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61186041] [2024-10-13 04:40:21,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:40:21,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 04:40:21,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:40:21,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 04:40:21,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 04:40:21,589 INFO L87 Difference]: Start difference. First operand 648 states and 938 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:25,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:40:25,863 INFO L93 Difference]: Finished difference Result 1508 states and 2180 transitions. [2024-10-13 04:40:25,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 04:40:25,864 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-10-13 04:40:25,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:40:25,870 INFO L225 Difference]: With dead ends: 1508 [2024-10-13 04:40:25,871 INFO L226 Difference]: Without dead ends: 1082 [2024-10-13 04:40:25,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2024-10-13 04:40:25,873 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 351 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:40:25,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 441 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 04:40:25,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2024-10-13 04:40:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 690. [2024-10-13 04:40:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 615 states have (on average 1.408130081300813) internal successors, (866), 615 states have internal predecessors, (866), 65 states have call successors, (65), 9 states have call predecessors, (65), 9 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-13 04:40:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 996 transitions. [2024-10-13 04:40:25,931 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 996 transitions. Word has length 94 [2024-10-13 04:40:25,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:40:25,933 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 996 transitions. [2024-10-13 04:40:25,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 996 transitions. [2024-10-13 04:40:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 04:40:25,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:40:25,934 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:40:25,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 04:40:25,935 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:40:25,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:40:25,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1907631651, now seen corresponding path program 1 times [2024-10-13 04:40:25,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:40:25,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173316689] [2024-10-13 04:40:25,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:40:25,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:40:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:29,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:40:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:29,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:40:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:29,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:40:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:29,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:40:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:29,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:40:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:29,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:40:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:29,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:40:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:29,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:40:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:29,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:40:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:29,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:40:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:29,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:40:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:29,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:40:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:29,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:40:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:40:29,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:40:29,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173316689] [2024-10-13 04:40:29,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173316689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:40:29,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:40:29,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 04:40:29,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456332661] [2024-10-13 04:40:29,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:40:29,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 04:40:29,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:40:29,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 04:40:29,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:40:29,979 INFO L87 Difference]: Start difference. First operand 690 states and 996 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:32,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:40:32,347 INFO L93 Difference]: Finished difference Result 1502 states and 2159 transitions. [2024-10-13 04:40:32,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 04:40:32,348 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-10-13 04:40:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:40:32,353 INFO L225 Difference]: With dead ends: 1502 [2024-10-13 04:40:32,353 INFO L226 Difference]: Without dead ends: 959 [2024-10-13 04:40:32,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-10-13 04:40:32,356 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 216 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 04:40:32,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 549 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 04:40:32,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-10-13 04:40:32,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 690. [2024-10-13 04:40:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 615 states have (on average 1.4065040650406504) internal successors, (865), 615 states have internal predecessors, (865), 65 states have call successors, (65), 9 states have call predecessors, (65), 9 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-13 04:40:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 995 transitions. [2024-10-13 04:40:32,411 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 995 transitions. Word has length 94 [2024-10-13 04:40:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:40:32,413 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 995 transitions. [2024-10-13 04:40:32,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:32,413 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 995 transitions. [2024-10-13 04:40:32,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 04:40:32,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:40:32,415 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:40:32,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 04:40:32,415 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:40:32,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:40:32,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1964889953, now seen corresponding path program 1 times [2024-10-13 04:40:32,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:40:32,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381421634] [2024-10-13 04:40:32,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:40:32,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:40:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:39,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:40:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:39,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:40:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:39,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:40:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:39,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:40:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:39,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:40:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:39,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:40:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:39,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:40:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:39,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:40:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:39,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:40:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:39,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:40:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:39,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:40:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:39,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:40:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:39,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:40:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:40:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:40:39,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:40:39,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381421634] [2024-10-13 04:40:39,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381421634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:40:39,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:40:39,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 04:40:39,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737299681] [2024-10-13 04:40:39,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:40:39,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 04:40:39,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:40:39,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 04:40:39,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-13 04:40:39,594 INFO L87 Difference]: Start difference. First operand 690 states and 995 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:42,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:40:42,661 INFO L93 Difference]: Finished difference Result 1364 states and 1944 transitions. [2024-10-13 04:40:42,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 04:40:42,662 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-10-13 04:40:42,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:40:42,667 INFO L225 Difference]: With dead ends: 1364 [2024-10-13 04:40:42,667 INFO L226 Difference]: Without dead ends: 898 [2024-10-13 04:40:42,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2024-10-13 04:40:42,669 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 339 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 04:40:42,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 494 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 04:40:42,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-10-13 04:40:42,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 726. [2024-10-13 04:40:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 651 states have (on average 1.3978494623655915) internal successors, (910), 651 states have internal predecessors, (910), 65 states have call successors, (65), 9 states have call predecessors, (65), 9 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-13 04:40:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1040 transitions. [2024-10-13 04:40:42,726 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1040 transitions. Word has length 94 [2024-10-13 04:40:42,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:40:42,727 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1040 transitions. [2024-10-13 04:40:42,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:40:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1040 transitions. [2024-10-13 04:40:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 04:40:42,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:40:42,729 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:40:42,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 04:40:42,729 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:40:42,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:40:42,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1330888373, now seen corresponding path program 1 times [2024-10-13 04:40:42,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:40:42,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204992846] [2024-10-13 04:40:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:40:42,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:40:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat