./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_25-while_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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_25-while_file-27.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 6aef6b0d1df5b94d50511471039c073d3e3978d33dd37a94cbf88e18d72517ad --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:43:34,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:43:34,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:43:34,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:43:34,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:43:34,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:43:34,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:43:34,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:43:34,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:43:34,831 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:43:34,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:43:34,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:43:34,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:43:34,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:43:34,834 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:43:34,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:43:34,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:43:34,835 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:43:34,835 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:43:34,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:43:34,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:43:34,840 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:43:34,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:43:34,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:43:34,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:43:34,840 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:43:34,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:43:34,841 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:43:34,841 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:43:34,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:43:34,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:43:34,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:43:34,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:43:34,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:43:34,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:43:34,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:43:34,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:43:34,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:43:34,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:43:34,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:43:34,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:43:34,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:43:34,843 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 -> 6aef6b0d1df5b94d50511471039c073d3e3978d33dd37a94cbf88e18d72517ad [2024-11-20 06:43:35,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:43:35,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:43:35,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:43:35,076 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:43:35,076 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:43:35,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-27.i [2024-11-20 06:43:36,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:43:36,829 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:43:36,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-27.i [2024-11-20 06:43:36,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80ff8016b/5f4d6c59797548d8a800654ac6a23a33/FLAGe9d881dc0 [2024-11-20 06:43:37,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80ff8016b/5f4d6c59797548d8a800654ac6a23a33 [2024-11-20 06:43:37,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:43:37,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:43:37,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:43:37,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:43:37,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:43:37,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:43:37" (1/1) ... [2024-11-20 06:43:37,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e10fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:43:37, skipping insertion in model container [2024-11-20 06:43:37,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:43:37" (1/1) ... [2024-11-20 06:43:37,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:43:37,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-27.i[915,928] [2024-11-20 06:43:37,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:43:37,526 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:43:37,539 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-27.i[915,928] [2024-11-20 06:43:37,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:43:37,599 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:43:37,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:43:37 WrapperNode [2024-11-20 06:43:37,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:43:37,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:43:37,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:43:37,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:43:37,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:43:37" (1/1) ... [2024-11-20 06:43:37,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:43:37" (1/1) ... [2024-11-20 06:43:37,713 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-11-20 06:43:37,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:43:37,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:43:37,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:43:37,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:43:37,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:43:37" (1/1) ... [2024-11-20 06:43:37,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:43:37" (1/1) ... [2024-11-20 06:43:37,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:43:37" (1/1) ... [2024-11-20 06:43:37,751 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:43:37,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:43:37" (1/1) ... [2024-11-20 06:43:37,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:43:37" (1/1) ... [2024-11-20 06:43:37,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:43:37" (1/1) ... [2024-11-20 06:43:37,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:43:37" (1/1) ... [2024-11-20 06:43:37,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:43:37" (1/1) ... [2024-11-20 06:43:37,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:43:37" (1/1) ... [2024-11-20 06:43:37,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:43:37,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:43:37,796 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:43:37,796 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:43:37,797 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:43:37" (1/1) ... [2024-11-20 06:43:37,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:43:37,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:43:37,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:43:37,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:43:37,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:43:37,888 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:43:37,888 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:43:37,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:43:37,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:43:37,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:43:37,956 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:43:37,959 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:43:38,264 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 06:43:38,265 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:43:38,297 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:43:38,297 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:43:38,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:43:38 BoogieIcfgContainer [2024-11-20 06:43:38,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:43:38,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:43:38,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:43:38,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:43:38,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:43:37" (1/3) ... [2024-11-20 06:43:38,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1307717c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:43:38, skipping insertion in model container [2024-11-20 06:43:38,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:43:37" (2/3) ... [2024-11-20 06:43:38,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1307717c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:43:38, skipping insertion in model container [2024-11-20 06:43:38,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:43:38" (3/3) ... [2024-11-20 06:43:38,313 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-27.i [2024-11-20 06:43:38,331 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:43:38,332 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:43:38,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:43:38,413 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;@309b925b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:43:38,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:43:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 06:43:38,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-20 06:43:38,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:43:38,430 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:43:38,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:43:38,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:43:38,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1601827997, now seen corresponding path program 1 times [2024-11-20 06:43:38,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:43:38,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416671659] [2024-11-20 06:43:38,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:43:38,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:43:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:43:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:43:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:43:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:43:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:43:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:43:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:43:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:43:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:43:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:43:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:43:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:43:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:43:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:43:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:43:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:43:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 06:43:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:38,938 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 06:43:38,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:43:38,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416671659] [2024-11-20 06:43:38,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416671659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:43:38,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:43:38,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:43:38,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912841385] [2024-11-20 06:43:38,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:43:38,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:43:38,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:43:38,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:43:38,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:43:38,969 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 06:43:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:43:38,993 INFO L93 Difference]: Finished difference Result 93 states and 157 transitions. [2024-11-20 06:43:38,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:43:38,995 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2024-11-20 06:43:38,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:43:39,001 INFO L225 Difference]: With dead ends: 93 [2024-11-20 06:43:39,002 INFO L226 Difference]: Without dead ends: 46 [2024-11-20 06:43:39,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:43:39,008 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:43:39,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:43:39,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-20 06:43:39,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-20 06:43:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 06:43:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2024-11-20 06:43:39,050 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 107 [2024-11-20 06:43:39,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:43:39,051 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2024-11-20 06:43:39,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 06:43:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2024-11-20 06:43:39,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-20 06:43:39,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:43:39,055 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:43:39,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:43:39,055 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:43:39,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:43:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1732167579, now seen corresponding path program 1 times [2024-11-20 06:43:39,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:43:39,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629482760] [2024-11-20 06:43:39,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:43:39,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:43:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:43:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:43:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:43:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:43:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:43:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:43:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:43:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:43:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:43:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:43:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:43:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:43:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:43:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:43:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:43:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:43:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 06:43:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 06:43:41,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:43:41,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629482760] [2024-11-20 06:43:41,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629482760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:43:41,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:43:41,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 06:43:41,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457312265] [2024-11-20 06:43:41,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:43:41,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 06:43:41,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:43:41,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 06:43:41,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:43:41,518 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 06:43:42,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:43:42,315 INFO L93 Difference]: Finished difference Result 137 states and 183 transitions. [2024-11-20 06:43:42,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 06:43:42,315 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-11-20 06:43:42,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:43:42,318 INFO L225 Difference]: With dead ends: 137 [2024-11-20 06:43:42,318 INFO L226 Difference]: Without dead ends: 135 [2024-11-20 06:43:42,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-20 06:43:42,321 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 120 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 06:43:42,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 325 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 06:43:42,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-20 06:43:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2024-11-20 06:43:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 06:43:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2024-11-20 06:43:42,351 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 107 [2024-11-20 06:43:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:43:42,352 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2024-11-20 06:43:42,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 06:43:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2024-11-20 06:43:42,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-20 06:43:42,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:43:42,355 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:43:42,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:43:42,356 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:43:42,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:43:42,356 INFO L85 PathProgramCache]: Analyzing trace with hash 42839783, now seen corresponding path program 1 times [2024-11-20 06:43:42,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:43:42,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206350921] [2024-11-20 06:43:42,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:43:42,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:43:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:43:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:43:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:43:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:43:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:43:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:43:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:43:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:43:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:43:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:43:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:43:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:43:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:43:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:43:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:43:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:43:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 06:43:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 06:43:43,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:43:43,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206350921] [2024-11-20 06:43:43,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206350921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:43:43,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:43:43,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 06:43:43,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370716629] [2024-11-20 06:43:43,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:43:43,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 06:43:43,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:43:43,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 06:43:43,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-20 06:43:43,652 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 06:43:44,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:43:44,307 INFO L93 Difference]: Finished difference Result 133 states and 179 transitions. [2024-11-20 06:43:44,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 06:43:44,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-11-20 06:43:44,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:43:44,310 INFO L225 Difference]: With dead ends: 133 [2024-11-20 06:43:44,310 INFO L226 Difference]: Without dead ends: 131 [2024-11-20 06:43:44,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-20 06:43:44,312 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 122 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 06:43:44,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 352 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 06:43:44,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-20 06:43:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 97. [2024-11-20 06:43:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 06:43:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2024-11-20 06:43:44,341 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 107 [2024-11-20 06:43:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:43:44,342 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2024-11-20 06:43:44,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 06:43:44,342 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2024-11-20 06:43:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-20 06:43:44,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:43:44,343 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:43:44,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:43:44,344 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:43:44,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:43:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1052109209, now seen corresponding path program 1 times [2024-11-20 06:43:44,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:43:44,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234807433] [2024-11-20 06:43:44,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:43:44,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:43:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:43:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:43:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:43:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:43:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:43:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:43:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:43:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:43:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:43:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:43:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:43:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:43:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:43:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:43:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:43:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:43:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 06:43:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,517 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 06:43:44,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:43:44,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234807433] [2024-11-20 06:43:44,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234807433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:43:44,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:43:44,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:43:44,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724879021] [2024-11-20 06:43:44,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:43:44,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:43:44,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:43:44,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:43:44,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:43:44,520 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 06:43:44,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:43:44,622 INFO L93 Difference]: Finished difference Result 193 states and 276 transitions. [2024-11-20 06:43:44,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 06:43:44,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-11-20 06:43:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:43:44,625 INFO L225 Difference]: With dead ends: 193 [2024-11-20 06:43:44,625 INFO L226 Difference]: Without dead ends: 99 [2024-11-20 06:43:44,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:43:44,629 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 54 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:43:44,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 245 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:43:44,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-20 06:43:44,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2024-11-20 06:43:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 06:43:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-11-20 06:43:44,646 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 107 [2024-11-20 06:43:44,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:43:44,648 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-11-20 06:43:44,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 06:43:44,649 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-11-20 06:43:44,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-20 06:43:44,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:43:44,654 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:43:44,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:43:44,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:43:44,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:43:44,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1905129425, now seen corresponding path program 1 times [2024-11-20 06:43:44,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:43:44,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511249044] [2024-11-20 06:43:44,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:43:44,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:43:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:43:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:43:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:43:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:43:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:43:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:43:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:43:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:43:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:43:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:43:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:43:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:43:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:43:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:43:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:43:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:43:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 06:43:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 06:43:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:43:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 06:43:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:43:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 06:43:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 06:43:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 06:43:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 06:43:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 06:43:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 06:43:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 06:43:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 06:43:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 06:43:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 06:43:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 06:43:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-20 06:43:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-20 06:43:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:43:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2279 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 2247 trivial. 0 not checked. [2024-11-20 06:43:44,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:43:44,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511249044] [2024-11-20 06:43:44,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511249044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:43:44,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:43:44,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:43:44,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431448661] [2024-11-20 06:43:44,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:43:44,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:43:44,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:43:44,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:43:44,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:43:44,839 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-20 06:43:44,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:43:44,957 INFO L93 Difference]: Finished difference Result 133 states and 191 transitions. [2024-11-20 06:43:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:43:44,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 212 [2024-11-20 06:43:44,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:43:44,958 INFO L225 Difference]: With dead ends: 133 [2024-11-20 06:43:44,958 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 06:43:44,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:43:44,960 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 35 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:43:44,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 76 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:43:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 06:43:44,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 06:43:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 06:43:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 06:43:44,962 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2024-11-20 06:43:44,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:43:44,962 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 06:43:44,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-20 06:43:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 06:43:44,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 06:43:44,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:43:44,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 06:43:44,970 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-20 06:43:44,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 06:43:45,093 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:43:45,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:43:45 BoogieIcfgContainer [2024-11-20 06:43:45,119 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:43:45,120 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:43:45,120 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:43:45,120 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:43:45,121 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:43:38" (3/4) ... [2024-11-20 06:43:45,122 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 06:43:45,125 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 06:43:45,130 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-20 06:43:45,130 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 06:43:45,130 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 06:43:45,131 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 06:43:45,224 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 06:43:45,224 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 06:43:45,224 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:43:45,225 INFO L158 Benchmark]: Toolchain (without parser) took 8071.00ms. Allocated memory was 184.5MB in the beginning and 312.5MB in the end (delta: 127.9MB). Free memory was 136.4MB in the beginning and 119.8MB in the end (delta: 16.6MB). Peak memory consumption was 146.1MB. Max. memory is 16.1GB. [2024-11-20 06:43:45,225 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:43:45,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.12ms. Allocated memory is still 184.5MB. Free memory was 135.9MB in the beginning and 121.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 06:43:45,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.25ms. Allocated memory is still 184.5MB. Free memory was 120.4MB in the beginning and 118.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:43:45,226 INFO L158 Benchmark]: Boogie Preprocessor took 81.28ms. Allocated memory is still 184.5MB. Free memory was 118.3MB in the beginning and 114.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:43:45,226 INFO L158 Benchmark]: RCFGBuilder took 502.49ms. Allocated memory is still 184.5MB. Free memory was 114.9MB in the beginning and 97.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 06:43:45,226 INFO L158 Benchmark]: TraceAbstraction took 6819.33ms. Allocated memory was 184.5MB in the beginning and 312.5MB in the end (delta: 127.9MB). Free memory was 97.3MB in the beginning and 125.0MB in the end (delta: -27.7MB). Peak memory consumption was 102.1MB. Max. memory is 16.1GB. [2024-11-20 06:43:45,227 INFO L158 Benchmark]: Witness Printer took 104.56ms. Allocated memory is still 312.5MB. Free memory was 125.0MB in the beginning and 119.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 06:43:45,228 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.12ms. Allocated memory is still 184.5MB. Free memory was 135.9MB in the beginning and 121.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.25ms. Allocated memory is still 184.5MB. Free memory was 120.4MB in the beginning and 118.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.28ms. Allocated memory is still 184.5MB. Free memory was 118.3MB in the beginning and 114.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 502.49ms. Allocated memory is still 184.5MB. Free memory was 114.9MB in the beginning and 97.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6819.33ms. Allocated memory was 184.5MB in the beginning and 312.5MB in the end (delta: 127.9MB). Free memory was 97.3MB in the beginning and 125.0MB in the end (delta: -27.7MB). Peak memory consumption was 102.1MB. Max. memory is 16.1GB. * Witness Printer took 104.56ms. Allocated memory is still 312.5MB. Free memory was 125.0MB in the beginning and 119.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 5, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 331 mSDsluCounter, 1064 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 764 mSDsCounter, 219 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 447 IncrementalHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 219 mSolverCounterUnsat, 300 mSDtfsCounter, 447 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=2, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 78 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 2113 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 4455/4455 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((long long) 128 + last_1_var_1_13) <= 0) && (((long long) 128 + var_1_13) <= 0)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((long long) 128 + last_1_var_1_13) <= 0) && (((long long) 128 + var_1_13) <= 0)) Ensures: (((((long long) 128 + last_1_var_1_13) <= 0) && (((long long) 128 + var_1_13) <= 0)) && ((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_5 == \old(var_1_5))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (last_1_var_1_9 == \old(last_1_var_1_9))) && (last_1_var_1_13 == \old(last_1_var_1_13)))) RESULT: Ultimate proved your program to be correct! [2024-11-20 06:43:45,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE