./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_100-while_file-30.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_100-while_file-30.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 5536eec27f0e30a34c1a96e838ac5cf11c75a521ed3ec15ff2fb1a338cbfa9d3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:23:36,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:23:36,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:23:36,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:23:36,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:23:36,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:23:36,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:23:36,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:23:36,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:23:36,241 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:23:36,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:23:36,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:23:36,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:23:36,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:23:36,243 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:23:36,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:23:36,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:23:36,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:23:36,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:23:36,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:23:36,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:23:36,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:23:36,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:23:36,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:23:36,253 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:23:36,253 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:23:36,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:23:36,254 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:23:36,254 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:23:36,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:23:36,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:23:36,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:23:36,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:23:36,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:23:36,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:23:36,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:23:36,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:23:36,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:23:36,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:23:36,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:23:36,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:23:36,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:23:36,272 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 -> 5536eec27f0e30a34c1a96e838ac5cf11c75a521ed3ec15ff2fb1a338cbfa9d3 [2024-10-14 11:23:36,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:23:36,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:23:36,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:23:36,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:23:36,601 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:23:36,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-30.i [2024-10-14 11:23:38,101 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:23:38,319 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:23:38,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-30.i [2024-10-14 11:23:38,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb39335ae/1d243dd5601b40789a24ad69655cf217/FLAG7daad3ffd [2024-10-14 11:23:38,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb39335ae/1d243dd5601b40789a24ad69655cf217 [2024-10-14 11:23:38,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:23:38,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:23:38,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:23:38,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:23:38,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:23:38,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:23:38" (1/1) ... [2024-10-14 11:23:38,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d88b888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:23:38, skipping insertion in model container [2024-10-14 11:23:38,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:23:38" (1/1) ... [2024-10-14 11:23:38,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:23:38,885 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_100-while_file-30.i[916,929] [2024-10-14 11:23:38,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:23:38,987 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:23:38,998 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_100-while_file-30.i[916,929] [2024-10-14 11:23:39,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:23:39,060 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:23:39,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:23:39 WrapperNode [2024-10-14 11:23:39,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:23:39,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:23:39,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:23:39,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:23:39,070 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:23:39" (1/1) ... [2024-10-14 11:23:39,082 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:23:39" (1/1) ... [2024-10-14 11:23:39,133 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2024-10-14 11:23:39,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:23:39,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:23:39,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:23:39,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:23:39,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:23:39" (1/1) ... [2024-10-14 11:23:39,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:23:39" (1/1) ... [2024-10-14 11:23:39,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:23:39" (1/1) ... [2024-10-14 11:23:39,193 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:23:39,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:23:39" (1/1) ... [2024-10-14 11:23:39,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:23:39" (1/1) ... [2024-10-14 11:23:39,215 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:23:39" (1/1) ... [2024-10-14 11:23:39,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:23:39" (1/1) ... [2024-10-14 11:23:39,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:23:39" (1/1) ... [2024-10-14 11:23:39,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:23:39" (1/1) ... [2024-10-14 11:23:39,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:23:39,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:23:39,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:23:39,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:23:39,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:23:39" (1/1) ... [2024-10-14 11:23:39,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:23:39,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:23:39,291 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:23:39,295 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:23:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:23:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:23:39,349 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:23:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:23:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:23:39,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:23:39,444 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:23:39,446 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:23:40,081 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-14 11:23:40,082 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:23:40,121 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:23:40,121 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:23:40,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:23:40 BoogieIcfgContainer [2024-10-14 11:23:40,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:23:40,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:23:40,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:23:40,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:23:40,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:23:38" (1/3) ... [2024-10-14 11:23:40,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3316e1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:23:40, skipping insertion in model container [2024-10-14 11:23:40,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:23:39" (2/3) ... [2024-10-14 11:23:40,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3316e1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:23:40, skipping insertion in model container [2024-10-14 11:23:40,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:23:40" (3/3) ... [2024-10-14 11:23:40,133 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-30.i [2024-10-14 11:23:40,154 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:23:40,154 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:23:40,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:23:40,254 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;@76201dea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:23:40,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:23:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 11:23:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 11:23:40,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:23:40,290 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:40,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:23:40,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:23:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1747532600, now seen corresponding path program 1 times [2024-10-14 11:23:40,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:23:40,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203391895] [2024-10-14 11:23:40,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:23:40,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:23:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:23:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:23:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:23:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:23:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:23:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:23:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:23:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:23:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:23:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:23:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:23:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:23:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:23:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:23:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:23:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:23:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:23:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:23:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:23:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:23:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:23:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:23:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:23:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:23:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 11:23:40,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:23:40,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203391895] [2024-10-14 11:23:40,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203391895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:23:40,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:23:40,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:23:40,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349171939] [2024-10-14 11:23:40,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:23:40,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:23:40,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:23:40,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:23:40,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:23:40,882 INFO L87 Difference]: Start difference. First operand has 96 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 70 states have internal predecessors, (104), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 11:23:40,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:23:40,938 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2024-10-14 11:23:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:23:40,941 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-10-14 11:23:40,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:23:40,949 INFO L225 Difference]: With dead ends: 184 [2024-10-14 11:23:40,950 INFO L226 Difference]: Without dead ends: 89 [2024-10-14 11:23:40,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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:23:40,960 INFO L432 NwaCegarLoop]: 134 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, 134 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-14 11:23:40,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:23:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-14 11:23:41,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-14 11:23:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 63 states have internal predecessors, (89), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 11:23:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2024-10-14 11:23:41,022 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 137 transitions. Word has length 161 [2024-10-14 11:23:41,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:23:41,023 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 137 transitions. [2024-10-14 11:23:41,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 11:23:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 137 transitions. [2024-10-14 11:23:41,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 11:23:41,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:23:41,028 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:41,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:23:41,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:23:41,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:23:41,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1439463292, now seen corresponding path program 1 times [2024-10-14 11:23:41,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:23:41,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179423490] [2024-10-14 11:23:41,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:23:41,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:23:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:23:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:23:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:23:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:23:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:23:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:23:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:23:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:23:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:23:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:23:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:23:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:23:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:23:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:23:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:23:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:23:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:23:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:23:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:23:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:23:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:23:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:23:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:23:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:23:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 11:23:41,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:23:41,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179423490] [2024-10-14 11:23:41,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179423490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:23:41,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:23:41,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:23:41,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44214861] [2024-10-14 11:23:41,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:23:41,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:23:41,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:23:41,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:23:41,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:23:41,910 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 11:23:42,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:23:42,209 INFO L93 Difference]: Finished difference Result 323 states and 491 transitions. [2024-10-14 11:23:42,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 11:23:42,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-14 11:23:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:23:42,219 INFO L225 Difference]: With dead ends: 323 [2024-10-14 11:23:42,219 INFO L226 Difference]: Without dead ends: 235 [2024-10-14 11:23:42,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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:23:42,222 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 193 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:23:42,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 458 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:23:42,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-14 11:23:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 169. [2024-10-14 11:23:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 118 states have (on average 1.3728813559322033) internal successors, (162), 118 states have internal predecessors, (162), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 11:23:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 258 transitions. [2024-10-14 11:23:42,281 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 258 transitions. Word has length 161 [2024-10-14 11:23:42,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:23:42,282 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 258 transitions. [2024-10-14 11:23:42,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 11:23:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 258 transitions. [2024-10-14 11:23:42,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 11:23:42,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:23:42,287 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:42,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:23:42,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:23:42,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:23:42,289 INFO L85 PathProgramCache]: Analyzing trace with hash -34783078, now seen corresponding path program 1 times [2024-10-14 11:23:42,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:23:42,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904653256] [2024-10-14 11:23:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:23:42,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:23:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:23:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:23:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:23:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:23:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:23:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:23:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:23:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:23:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:23:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:23:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:23:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:23:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:23:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:23:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:23:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:23:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:23:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:23:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:23:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:23:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:23:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:23:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:23:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:23:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-14 11:23:43,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:23:43,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904653256] [2024-10-14 11:23:43,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904653256] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:23:43,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538555511] [2024-10-14 11:23:43,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:23:43,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:23:43,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:23:43,727 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:23:43,729 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:23:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:43,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 11:23:43,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:23:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 552 proven. 57 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-10-14 11:23:44,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:23:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 99 proven. 36 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-14 11:23:44,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538555511] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:23:44,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 11:23:44,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 18 [2024-10-14 11:23:44,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688911080] [2024-10-14 11:23:44,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 11:23:44,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 11:23:44,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:23:44,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 11:23:44,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-10-14 11:23:44,779 INFO L87 Difference]: Start difference. First operand 169 states and 258 transitions. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-10-14 11:23:45,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:23:45,869 INFO L93 Difference]: Finished difference Result 373 states and 548 transitions. [2024-10-14 11:23:45,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-14 11:23:45,870 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 162 [2024-10-14 11:23:45,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:23:45,872 INFO L225 Difference]: With dead ends: 373 [2024-10-14 11:23:45,873 INFO L226 Difference]: Without dead ends: 205 [2024-10-14 11:23:45,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 365 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=510, Invalid=1296, Unknown=0, NotChecked=0, Total=1806 [2024-10-14 11:23:45,876 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 624 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 11:23:45,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 538 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 11:23:45,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-14 11:23:45,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 97. [2024-10-14 11:23:45,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 11:23:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2024-10-14 11:23:45,905 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 162 [2024-10-14 11:23:45,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:23:45,906 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2024-10-14 11:23:45,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-10-14 11:23:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2024-10-14 11:23:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-14 11:23:45,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:23:45,909 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:45,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 11:23:46,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:23:46,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:23:46,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:23:46,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1747380376, now seen corresponding path program 1 times [2024-10-14 11:23:46,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:23:46,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195507784] [2024-10-14 11:23:46,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:23:46,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:23:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:52,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:23:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:52,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:23:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:52,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:23:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:52,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:23:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:52,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:23:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:52,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:23:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:52,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:23:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:52,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:23:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:23:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:23:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 11:23:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:23:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 11:23:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:23:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 11:23:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:23:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 11:23:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:23:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:23:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:23:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:23:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:23:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:23:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:23:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 93 proven. 39 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-10-14 11:23:53,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:23:53,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195507784] [2024-10-14 11:23:53,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195507784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:23:53,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678087243] [2024-10-14 11:23:53,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:23:53,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:23:53,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:23:53,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:23:53,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 11:23:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:23:53,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-14 11:23:53,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:23:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 703 proven. 57 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2024-10-14 11:23:56,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:24:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 183 proven. 75 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2024-10-14 11:24:05,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678087243] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:24:05,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 11:24:05,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 20] total 50 [2024-10-14 11:24:05,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200715055] [2024-10-14 11:24:05,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 11:24:05,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 11:24:05,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:24:05,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 11:24:05,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=2014, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 11:24:05,743 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 50 states, 49 states have (on average 3.1020408163265305) internal successors, (152), 48 states have internal predecessors, (152), 11 states have call successors, (72), 5 states have call predecessors, (72), 13 states have return successors, (72), 13 states have call predecessors, (72), 11 states have call successors, (72)