./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-1loop_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-1loop_file-47.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 059f7a6c0899b06ba004380f6be8b1c0033ac1c2805d5b3b9126b44593bc1ee1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:57:08,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:57:08,571 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:57:08,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:57:08,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:57:08,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:57:08,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:57:08,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:57:08,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:57:08,617 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:57:08,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:57:08,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:57:08,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:57:08,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:57:08,620 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:57:08,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:57:08,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:57:08,621 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:57:08,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:57:08,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:57:08,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:57:08,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:57:08,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:57:08,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:57:08,627 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:57:08,627 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:57:08,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:57:08,628 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:57:08,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:57:08,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:57:08,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:57:08,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:57:08,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:57:08,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:57:08,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:57:08,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:57:08,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:57:08,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:57:08,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:57:08,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:57:08,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:57:08,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:57:08,641 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 -> 059f7a6c0899b06ba004380f6be8b1c0033ac1c2805d5b3b9126b44593bc1ee1 [2024-10-14 11:57:08,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:57:08,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:57:08,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:57:08,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:57:08,945 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:57:08,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-47.i [2024-10-14 11:57:10,380 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:57:10,609 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:57:10,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-47.i [2024-10-14 11:57:10,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4959f4bc3/2fb8745661c743c78acdc0f8e3785eda/FLAG0c1011fe0 [2024-10-14 11:57:10,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4959f4bc3/2fb8745661c743c78acdc0f8e3785eda [2024-10-14 11:57:10,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:57:10,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:57:10,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:57:10,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:57:10,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:57:10,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:57:10" (1/1) ... [2024-10-14 11:57:10,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102b2b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:10, skipping insertion in model container [2024-10-14 11:57:10,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:57:10" (1/1) ... [2024-10-14 11:57:10,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:57:10,839 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-1loop_file-47.i[915,928] [2024-10-14 11:57:10,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:57:10,923 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:57:10,935 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-1loop_file-47.i[915,928] [2024-10-14 11:57:10,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:57:10,984 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:57:10,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:10 WrapperNode [2024-10-14 11:57:10,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:57:10,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:57:10,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:57:10,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:57:10,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:10" (1/1) ... [2024-10-14 11:57:11,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:10" (1/1) ... [2024-10-14 11:57:11,074 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2024-10-14 11:57:11,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:57:11,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:57:11,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:57:11,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:57:11,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:10" (1/1) ... [2024-10-14 11:57:11,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:10" (1/1) ... [2024-10-14 11:57:11,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:10" (1/1) ... [2024-10-14 11:57:11,123 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-14 11:57:11,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:10" (1/1) ... [2024-10-14 11:57:11,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:10" (1/1) ... [2024-10-14 11:57:11,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:10" (1/1) ... [2024-10-14 11:57:11,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:10" (1/1) ... [2024-10-14 11:57:11,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:10" (1/1) ... [2024-10-14 11:57:11,149 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:10" (1/1) ... [2024-10-14 11:57:11,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:57:11,158 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:57:11,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:57:11,161 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:57:11,162 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:10" (1/1) ... [2024-10-14 11:57:11,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:57:11,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:57:11,205 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-14 11:57:11,212 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-14 11:57:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:57:11,273 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:57:11,273 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:57:11,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:57:11,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:57:11,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:57:11,406 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:57:11,408 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:57:11,836 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-14 11:57:11,836 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:57:11,865 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:57:11,865 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:57:11,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:57:11 BoogieIcfgContainer [2024-10-14 11:57:11,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:57:11,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:57:11,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:57:11,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:57:11,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:57:10" (1/3) ... [2024-10-14 11:57:11,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f41b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:57:11, skipping insertion in model container [2024-10-14 11:57:11,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:10" (2/3) ... [2024-10-14 11:57:11,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f41b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:57:11, skipping insertion in model container [2024-10-14 11:57:11,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:57:11" (3/3) ... [2024-10-14 11:57:11,874 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-47.i [2024-10-14 11:57:11,893 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:57:11,894 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:57:11,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:57:11,986 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;@2ee55dff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:57:11,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:57:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 60 states have internal predecessors, (90), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 11:57:12,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 11:57:12,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:57:12,010 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:57:12,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:57:12,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:57:12,016 INFO L85 PathProgramCache]: Analyzing trace with hash 745951277, now seen corresponding path program 1 times [2024-10-14 11:57:12,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:57:12,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44076100] [2024-10-14 11:57:12,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:57:12,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:57:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:57:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:57:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:57:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:57:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:57:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:57:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:57:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:57:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:57:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:57:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:57:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:57:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:57:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:57:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:57:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:57:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:57:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:57:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:57:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:57:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:57:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:12,444 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 11:57:12,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:57:12,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44076100] [2024-10-14 11:57:12,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44076100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:57:12,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:57:12,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:57:12,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299637052] [2024-10-14 11:57:12,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:57:12,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:57:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:57:12,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:57:12,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:57:12,481 INFO L87 Difference]: Start difference. First operand has 83 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 60 states have internal predecessors, (90), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 11:57:12,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:57:12,543 INFO L93 Difference]: Finished difference Result 165 states and 284 transitions. [2024-10-14 11:57:12,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:57:12,547 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2024-10-14 11:57:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:57:12,556 INFO L225 Difference]: With dead ends: 165 [2024-10-14 11:57:12,556 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 11:57:12,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-14 11:57:12,566 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:57:12,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:57:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 11:57:12,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-14 11:57:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 11:57:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 123 transitions. [2024-10-14 11:57:12,637 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 123 transitions. Word has length 136 [2024-10-14 11:57:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:57:12,638 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 123 transitions. [2024-10-14 11:57:12,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 11:57:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2024-10-14 11:57:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-14 11:57:12,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:57:12,643 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:57:12,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:57:12,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:57:12,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:57:12,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1570732428, now seen corresponding path program 1 times [2024-10-14 11:57:12,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:57:12,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758514329] [2024-10-14 11:57:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:57:12,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:57:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:57:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:57:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:57:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:57:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:57:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:57:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:57:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:57:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:57:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:57:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:57:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:57:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:57:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:57:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:57:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:57:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:57:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:57:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:57:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:57:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:57:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:13,553 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 11:57:13,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:57:13,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758514329] [2024-10-14 11:57:13,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758514329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:57:13,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:57:13,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 11:57:13,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851343935] [2024-10-14 11:57:13,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:57:13,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 11:57:13,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:57:13,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 11:57:13,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:57:13,557 INFO L87 Difference]: Start difference. First operand 81 states and 123 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 11:57:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:57:13,956 INFO L93 Difference]: Finished difference Result 352 states and 532 transitions. [2024-10-14 11:57:13,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 11:57:13,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 137 [2024-10-14 11:57:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:57:13,963 INFO L225 Difference]: With dead ends: 352 [2024-10-14 11:57:13,963 INFO L226 Difference]: Without dead ends: 272 [2024-10-14 11:57:13,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:57:13,966 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 292 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:57:13,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 489 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:57:13,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-14 11:57:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 171. [2024-10-14 11:57:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 126 states have (on average 1.3888888888888888) internal successors, (175), 126 states have internal predecessors, (175), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 11:57:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 259 transitions. [2024-10-14 11:57:14,022 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 259 transitions. Word has length 137 [2024-10-14 11:57:14,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:57:14,023 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 259 transitions. [2024-10-14 11:57:14,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 11:57:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 259 transitions. [2024-10-14 11:57:14,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-14 11:57:14,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:57:14,028 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:57:14,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:57:14,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:57:14,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:57:14,030 INFO L85 PathProgramCache]: Analyzing trace with hash -423412278, now seen corresponding path program 1 times [2024-10-14 11:57:14,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:57:14,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45000974] [2024-10-14 11:57:14,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:57:14,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:57:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:57:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:57:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:57:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:57:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:57:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:57:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:57:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:57:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:57:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:57:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:57:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:57:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:57:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:57:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:57:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:57:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:57:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:57:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:57:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:57:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:57:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 11:57:14,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:57:14,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45000974] [2024-10-14 11:57:14,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45000974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:57:14,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:57:14,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:57:14,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476648299] [2024-10-14 11:57:14,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:57:14,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:57:14,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:57:14,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:57:14,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:57:14,583 INFO L87 Difference]: Start difference. First operand 171 states and 259 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 11:57:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:57:14,826 INFO L93 Difference]: Finished difference Result 332 states and 499 transitions. [2024-10-14 11:57:14,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:57:14,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 137 [2024-10-14 11:57:14,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:57:14,831 INFO L225 Difference]: With dead ends: 332 [2024-10-14 11:57:14,831 INFO L226 Difference]: Without dead ends: 162 [2024-10-14 11:57:14,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-14 11:57:14,836 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 84 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:57:14,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 326 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:57:14,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-14 11:57:14,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 132. [2024-10-14 11:57:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 87 states have internal predecessors, (114), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 11:57:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 198 transitions. [2024-10-14 11:57:14,877 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 198 transitions. Word has length 137 [2024-10-14 11:57:14,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:57:14,880 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 198 transitions. [2024-10-14 11:57:14,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 11:57:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 198 transitions. [2024-10-14 11:57:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 11:57:14,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:57:14,883 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:57:14,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:57:14,883 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:57:14,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:57:14,887 INFO L85 PathProgramCache]: Analyzing trace with hash -881170059, now seen corresponding path program 1 times [2024-10-14 11:57:14,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:57:14,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533096123] [2024-10-14 11:57:14,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:57:14,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:57:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:57:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:57:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:57:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:57:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:57:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:57:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:57:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:57:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:57:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:57:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:57:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:57:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:57:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:57:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:57:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:57:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:57:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:57:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:57:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:57:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:57:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 11:57:15,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:57:15,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533096123] [2024-10-14 11:57:15,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533096123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:57:15,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:57:15,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 11:57:15,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099951882] [2024-10-14 11:57:15,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:57:15,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 11:57:15,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:57:15,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 11:57:15,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:57:15,301 INFO L87 Difference]: Start difference. First operand 132 states and 198 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 11:57:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:57:15,779 INFO L93 Difference]: Finished difference Result 387 states and 584 transitions. [2024-10-14 11:57:15,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 11:57:15,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2024-10-14 11:57:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:57:15,783 INFO L225 Difference]: With dead ends: 387 [2024-10-14 11:57:15,786 INFO L226 Difference]: Without dead ends: 307 [2024-10-14 11:57:15,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:57:15,787 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 159 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 11:57:15,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 423 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 11:57:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-14 11:57:15,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 252. [2024-10-14 11:57:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 185 states have (on average 1.345945945945946) internal successors, (249), 185 states have internal predecessors, (249), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-14 11:57:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 375 transitions. [2024-10-14 11:57:15,841 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 375 transitions. Word has length 139 [2024-10-14 11:57:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:57:15,842 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 375 transitions. [2024-10-14 11:57:15,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 11:57:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 375 transitions. [2024-10-14 11:57:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 11:57:15,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:57:15,844 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:57:15,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:57:15,844 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:57:15,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:57:15,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1579389621, now seen corresponding path program 1 times [2024-10-14 11:57:15,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:57:15,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029430822] [2024-10-14 11:57:15,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:57:15,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:57:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:57:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:57:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:57:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:57:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:57:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:57:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:57:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:57:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:57:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:57:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:57:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:57:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:57:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:57:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:57:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:57:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:57:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:57:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:57:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:57:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 11:57:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 114 proven. 48 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-10-14 11:57:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:57:16,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029430822] [2024-10-14 11:57:16,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029430822] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:57:16,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179473289] [2024-10-14 11:57:16,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:57:16,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:57:16,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:57:16,749 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:57:16,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 11:57:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:17,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 11:57:17,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:57:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 309 proven. 90 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-10-14 11:57:18,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:57:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 114 proven. 57 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2024-10-14 11:57:48,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179473289] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:57:48,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 11:57:48,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 12] total 34 [2024-10-14 11:57:48,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717654671] [2024-10-14 11:57:48,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 11:57:48,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-14 11:57:48,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:57:48,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-14 11:57:48,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=848, Unknown=7, NotChecked=0, Total=1122 [2024-10-14 11:57:48,717 INFO L87 Difference]: Start difference. First operand 252 states and 375 transitions. Second operand has 34 states, 32 states have (on average 3.875) internal successors, (124), 30 states have internal predecessors, (124), 10 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 13 states have call predecessors, (63), 10 states have call successors, (63)