./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-1loop_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.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 7566a205875353a7a53577ca4c9ca94a9d2d53458c01e4aa6bab26ab44feec5a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:08:15,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:08:15,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:08:15,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:08:15,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:08:15,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:08:15,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:08:15,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:08:15,712 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:08:15,713 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:08:15,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:08:15,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:08:15,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:08:15,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:08:15,715 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:08:15,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:08:15,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:08:15,717 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:08:15,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:08:15,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:08:15,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:08:15,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:08:15,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:08:15,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:08:15,722 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:08:15,722 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:08:15,722 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:08:15,722 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:08:15,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:08:15,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:08:15,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:08:15,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:08:15,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:08:15,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:08:15,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:08:15,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:08:15,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:08:15,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:08:15,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:08:15,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:08:15,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:08:15,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:08:15,725 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 -> 7566a205875353a7a53577ca4c9ca94a9d2d53458c01e4aa6bab26ab44feec5a [2024-10-13 04:08:15,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:08:15,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:08:15,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:08:15,957 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:08:15,957 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:08:15,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.i [2024-10-13 04:08:17,238 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:08:17,487 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:08:17,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.i [2024-10-13 04:08:17,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e9916dfb/66ac51b07eaf4fe39f0f1f58726f4b38/FLAGa79024873 [2024-10-13 04:08:17,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e9916dfb/66ac51b07eaf4fe39f0f1f58726f4b38 [2024-10-13 04:08:17,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:08:17,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:08:17,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:08:17,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:08:17,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:08:17,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:08:17" (1/1) ... [2024-10-13 04:08:17,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd631dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:08:17, skipping insertion in model container [2024-10-13 04:08:17,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:08:17" (1/1) ... [2024-10-13 04:08:17,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:08:17,706 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_25-1loop_file-41.i[915,928] [2024-10-13 04:08:17,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:08:17,749 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:08:17,759 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_25-1loop_file-41.i[915,928] [2024-10-13 04:08:17,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:08:17,784 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:08:17,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:08:17 WrapperNode [2024-10-13 04:08:17,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:08:17,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:08:17,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:08:17,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:08:17,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:08:17" (1/1) ... [2024-10-13 04:08:17,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:08:17" (1/1) ... [2024-10-13 04:08:17,816 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-10-13 04:08:17,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:08:17,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:08:17,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:08:17,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:08:17,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:08:17" (1/1) ... [2024-10-13 04:08:17,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:08:17" (1/1) ... [2024-10-13 04:08:17,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:08:17" (1/1) ... [2024-10-13 04:08:17,844 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:08:17,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:08:17" (1/1) ... [2024-10-13 04:08:17,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:08:17" (1/1) ... [2024-10-13 04:08:17,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:08:17" (1/1) ... [2024-10-13 04:08:17,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:08:17" (1/1) ... [2024-10-13 04:08:17,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:08:17" (1/1) ... [2024-10-13 04:08:17,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:08:17" (1/1) ... [2024-10-13 04:08:17,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:08:17,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:08:17,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:08:17,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:08:17,854 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:08:17" (1/1) ... [2024-10-13 04:08:17,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:08:17,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:08:17,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:08:17,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:08:17,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:08:17,955 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:08:17,956 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:08:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:08:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:08:17,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:08:18,034 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:08:18,038 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:08:18,213 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-13 04:08:18,214 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:08:18,268 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:08:18,269 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:08:18,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:08:18 BoogieIcfgContainer [2024-10-13 04:08:18,270 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:08:18,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:08:18,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:08:18,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:08:18,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:08:17" (1/3) ... [2024-10-13 04:08:18,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c9bc0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:08:18, skipping insertion in model container [2024-10-13 04:08:18,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:08:17" (2/3) ... [2024-10-13 04:08:18,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c9bc0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:08:18, skipping insertion in model container [2024-10-13 04:08:18,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:08:18" (3/3) ... [2024-10-13 04:08:18,279 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-41.i [2024-10-13 04:08:18,293 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:08:18,294 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:08:18,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:08:18,363 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;@5cf0b1cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:08:18,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:08:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 04:08:18,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 04:08:18,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:08:18,390 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:08:18,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:08:18,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:08:18,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2117070649, now seen corresponding path program 1 times [2024-10-13 04:08:18,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:08:18,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700582887] [2024-10-13 04:08:18,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:08:18,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:08:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:18,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:08:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:18,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:08:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:18,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:08:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:18,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:08:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:18,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:08:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:18,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:08:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:18,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:08:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:18,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:08:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:18,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:08:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:18,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:08:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:18,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:08:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:18,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:08:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:18,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:08:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:18,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:08:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:18,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:08:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:18,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:08:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:08:18,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:08:18,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700582887] [2024-10-13 04:08:18,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700582887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:08:18,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:08:18,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:08:18,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345222160] [2024-10-13 04:08:18,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:08:18,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:08:18,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:08:18,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:08:18,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:08:18,708 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 04:08:18,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:08:18,741 INFO L93 Difference]: Finished difference Result 88 states and 151 transitions. [2024-10-13 04:08:18,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:08:18,743 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 99 [2024-10-13 04:08:18,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:08:18,749 INFO L225 Difference]: With dead ends: 88 [2024-10-13 04:08:18,749 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 04:08:18,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:08:18,755 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:08:18,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:08:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 04:08:18,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-13 04:08:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 04:08:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2024-10-13 04:08:18,788 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 99 [2024-10-13 04:08:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:08:18,789 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2024-10-13 04:08:18,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 04:08:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2024-10-13 04:08:18,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 04:08:18,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:08:18,792 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:08:18,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:08:18,793 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:08:18,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:08:18,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1105653959, now seen corresponding path program 1 times [2024-10-13 04:08:18,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:08:18,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533474522] [2024-10-13 04:08:18,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:08:18,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:08:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:20,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:08:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:20,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:08:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:20,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:08:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:20,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:08:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:20,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:08:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:20,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:08:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:20,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:08:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:20,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:08:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:20,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:08:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:20,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:08:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:20,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:08:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:20,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:08:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:20,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:08:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:20,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:08:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:20,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:08:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:20,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:08:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:08:20,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:08:20,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533474522] [2024-10-13 04:08:20,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533474522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:08:20,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:08:20,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:08:20,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501114441] [2024-10-13 04:08:20,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:08:20,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:08:20,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:08:20,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:08:20,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:08:20,193 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:08:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:08:20,457 INFO L93 Difference]: Finished difference Result 103 states and 138 transitions. [2024-10-13 04:08:20,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:08:20,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-10-13 04:08:20,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:08:20,460 INFO L225 Difference]: With dead ends: 103 [2024-10-13 04:08:20,461 INFO L226 Difference]: Without dead ends: 101 [2024-10-13 04:08:20,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:08:20,463 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 78 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:08:20,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 223 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:08:20,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-13 04:08:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2024-10-13 04:08:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 55 states have internal predecessors, (65), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 04:08:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2024-10-13 04:08:20,491 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 99 [2024-10-13 04:08:20,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:08:20,492 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2024-10-13 04:08:20,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:08:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2024-10-13 04:08:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 04:08:20,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:08:20,495 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:08:20,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:08:20,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:08:20,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:08:20,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1414305975, now seen corresponding path program 1 times [2024-10-13 04:08:20,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:08:20,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504966176] [2024-10-13 04:08:20,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:08:20,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:08:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:21,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:08:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:21,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:08:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:21,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:08:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:21,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:08:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:21,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:08:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:21,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:08:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:21,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:08:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:21,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:08:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:21,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:08:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:21,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:08:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:21,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:08:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:21,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:08:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:21,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:08:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:21,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:08:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:21,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:08:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:21,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:08:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:08:21,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:08:21,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504966176] [2024-10-13 04:08:21,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504966176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:08:21,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:08:21,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:08:21,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747820410] [2024-10-13 04:08:21,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:08:21,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:08:21,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:08:21,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:08:21,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:08:21,163 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:08:21,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:08:21,362 INFO L93 Difference]: Finished difference Result 176 states and 244 transitions. [2024-10-13 04:08:21,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:08:21,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-10-13 04:08:21,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:08:21,364 INFO L225 Difference]: With dead ends: 176 [2024-10-13 04:08:21,364 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 04:08:21,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:08:21,366 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 48 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:08:21,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 296 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:08:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 04:08:21,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2024-10-13 04:08:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 49 states have internal predecessors, (58), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 04:08:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2024-10-13 04:08:21,388 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 99 [2024-10-13 04:08:21,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:08:21,389 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2024-10-13 04:08:21,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:08:21,389 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2024-10-13 04:08:21,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 04:08:21,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:08:21,392 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:08:21,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:08:21,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:08:21,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:08:21,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1785712329, now seen corresponding path program 1 times [2024-10-13 04:08:21,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:08:21,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973592872] [2024-10-13 04:08:21,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:08:21,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:08:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:08:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:08:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:08:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:08:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:08:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:08:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:08:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:08:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:08:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:08:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:08:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:08:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:08:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:08:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:08:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:08:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:08:22,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:08:22,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973592872] [2024-10-13 04:08:22,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973592872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:08:22,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:08:22,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:08:22,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422910792] [2024-10-13 04:08:22,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:08:22,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:08:22,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:08:22,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:08:22,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:08:22,057 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:08:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:08:22,190 INFO L93 Difference]: Finished difference Result 96 states and 126 transitions. [2024-10-13 04:08:22,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:08:22,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-10-13 04:08:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:08:22,193 INFO L225 Difference]: With dead ends: 96 [2024-10-13 04:08:22,193 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 04:08:22,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:08:22,194 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 26 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:08:22,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 186 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:08:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 04:08:22,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2024-10-13 04:08:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 55 states have internal predecessors, (66), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 04:08:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2024-10-13 04:08:22,207 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 99 [2024-10-13 04:08:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:08:22,208 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2024-10-13 04:08:22,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:08:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2024-10-13 04:08:22,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 04:08:22,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:08:22,210 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:08:22,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 04:08:22,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:08:22,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:08:22,210 INFO L85 PathProgramCache]: Analyzing trace with hash -734247605, now seen corresponding path program 1 times [2024-10-13 04:08:22,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:08:22,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423683642] [2024-10-13 04:08:22,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:08:22,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:08:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:08:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:08:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:08:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:08:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:08:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:08:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:08:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:08:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:08:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:08:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:08:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:08:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:08:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:08:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:08:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:08:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:08:22,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:08:22,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423683642] [2024-10-13 04:08:22,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423683642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:08:22,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:08:22,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:08:22,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620399836] [2024-10-13 04:08:22,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:08:22,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:08:22,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:08:22,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:08:22,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:08:22,838 INFO L87 Difference]: Start difference. First operand 80 states and 110 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:08:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:08:23,002 INFO L93 Difference]: Finished difference Result 96 states and 126 transitions. [2024-10-13 04:08:23,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:08:23,003 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-10-13 04:08:23,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:08:23,004 INFO L225 Difference]: With dead ends: 96 [2024-10-13 04:08:23,004 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 04:08:23,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:08:23,005 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 22 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:08:23,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 268 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:08:23,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 04:08:23,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2024-10-13 04:08:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.2) internal successors, (60), 51 states have internal predecessors, (60), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 04:08:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2024-10-13 04:08:23,016 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 99 [2024-10-13 04:08:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:08:23,016 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2024-10-13 04:08:23,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:08:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2024-10-13 04:08:23,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 04:08:23,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:08:23,018 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:08:23,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 04:08:23,018 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:08:23,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:08:23,018 INFO L85 PathProgramCache]: Analyzing trace with hash -93998736, now seen corresponding path program 1 times [2024-10-13 04:08:23,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:08:23,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477096219] [2024-10-13 04:08:23,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:08:23,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:08:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:23,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:08:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:23,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:08:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:23,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:08:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:23,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:08:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:23,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:08:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:23,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:08:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:23,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:08:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:23,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:08:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:23,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:08:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:23,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:08:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:08:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:23,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:08:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:23,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:08:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:23,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:08:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:23,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:08:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:23,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:08:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:08:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:08:23,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:08:23,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477096219] [2024-10-13 04:08:23,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477096219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:08:23,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:08:23,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:08:23,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531601148] [2024-10-13 04:08:23,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:08:23,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:08:23,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:08:23,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:08:23,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:08:23,099 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:08:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:08:23,122 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2024-10-13 04:08:23,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:08:23,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2024-10-13 04:08:23,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:08:23,124 INFO L225 Difference]: With dead ends: 142 [2024-10-13 04:08:23,124 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 04:08:23,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:08:23,127 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:08:23,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:08:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 04:08:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 04:08:23,130 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-10-13 04:08:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 04:08:23,131 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2024-10-13 04:08:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:08:23,131 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 04:08:23,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:08:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 04:08:23,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 04:08:23,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:08:23,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 04:08:23,139 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 04:08:23,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 04:08:23,482 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:08:23,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:08:23 BoogieIcfgContainer [2024-10-13 04:08:23,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:08:23,498 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:08:23,498 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:08:23,498 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:08:23,498 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:08:18" (3/4) ... [2024-10-13 04:08:23,499 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 04:08:23,502 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 04:08:23,506 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-13 04:08:23,507 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-13 04:08:23,507 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 04:08:23,507 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 04:08:23,583 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 04:08:23,587 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 04:08:23,587 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:08:23,587 INFO L158 Benchmark]: Toolchain (without parser) took 6069.41ms. Allocated memory was 165.7MB in the beginning and 356.5MB in the end (delta: 190.8MB). Free memory was 93.4MB in the beginning and 211.6MB in the end (delta: -118.1MB). Peak memory consumption was 75.7MB. Max. memory is 16.1GB. [2024-10-13 04:08:23,587 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 165.7MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:08:23,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.12ms. Allocated memory is still 165.7MB. Free memory was 93.3MB in the beginning and 79.7MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 04:08:23,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.41ms. Allocated memory is still 165.7MB. Free memory was 79.7MB in the beginning and 77.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:08:23,588 INFO L158 Benchmark]: Boogie Preprocessor took 35.51ms. Allocated memory is still 165.7MB. Free memory was 77.7MB in the beginning and 75.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:08:23,588 INFO L158 Benchmark]: RCFGBuilder took 416.55ms. Allocated memory was 165.7MB in the beginning and 232.8MB in the end (delta: 67.1MB). Free memory was 75.6MB in the beginning and 189.2MB in the end (delta: -113.6MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-10-13 04:08:23,589 INFO L158 Benchmark]: TraceAbstraction took 5224.86ms. Allocated memory was 232.8MB in the beginning and 356.5MB in the end (delta: 123.7MB). Free memory was 188.1MB in the beginning and 217.8MB in the end (delta: -29.7MB). Peak memory consumption was 94.0MB. Max. memory is 16.1GB. [2024-10-13 04:08:23,589 INFO L158 Benchmark]: Witness Printer took 89.12ms. Allocated memory is still 356.5MB. Free memory was 217.8MB in the beginning and 211.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 04:08:23,590 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.15ms. Allocated memory is still 165.7MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.12ms. Allocated memory is still 165.7MB. Free memory was 93.3MB in the beginning and 79.7MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.41ms. Allocated memory is still 165.7MB. Free memory was 79.7MB in the beginning and 77.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.51ms. Allocated memory is still 165.7MB. Free memory was 77.7MB in the beginning and 75.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 416.55ms. Allocated memory was 165.7MB in the beginning and 232.8MB in the end (delta: 67.1MB). Free memory was 75.6MB in the beginning and 189.2MB in the end (delta: -113.6MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5224.86ms. Allocated memory was 232.8MB in the beginning and 356.5MB in the end (delta: 123.7MB). Free memory was 188.1MB in the beginning and 217.8MB in the end (delta: -29.7MB). Peak memory consumption was 94.0MB. Max. memory is 16.1GB. * Witness Printer took 89.12ms. Allocated memory is still 356.5MB. Free memory was 217.8MB in the beginning and 211.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 1131 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 756 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 484 IncrementalHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 375 mSDtfsCounter, 484 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=2, InterpolantAutomatonStates: 33, 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, 6 MinimizatonAttempts, 70 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 589 ConstructedInterpolants, 0 QuantifiedInterpolants, 1870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 2880/2880 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: (((((var_1_8 == 1) && (var_1_9 != 0)) || (var_1_8 == 0)) && ((var_1_8 != 0) || (var_1_9 == 0))) || (var_1_5 == 0)) RESULT: Ultimate proved your program to be correct! [2024-10-13 04:08:23,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE