./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.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-while_file-39.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 f5eff424b13e274e9264f217cb93b9f92431d9f38ae53b99fcf8d948b0cbf8ce --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:18:21,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:18:21,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:18:21,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:18:21,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:18:21,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:18:21,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:18:21,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:18:21,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:18:21,973 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:18:21,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:18:21,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:18:21,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:18:21,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:18:21,989 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:18:21,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:18:21,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:18:21,990 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:18:21,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:18:21,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:18:21,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:18:21,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:18:21,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:18:21,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:18:21,997 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:18:21,997 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:18:21,997 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:18:21,997 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:18:21,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:18:21,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:18:21,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:18:21,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:18:21,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:18:21,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:18:21,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:18:21,999 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:18:22,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:18:22,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:18:22,000 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:18:22,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:18:22,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:18:22,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:18:22,002 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 -> f5eff424b13e274e9264f217cb93b9f92431d9f38ae53b99fcf8d948b0cbf8ce [2024-10-13 04:18:22,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:18:22,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:18:22,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:18:22,287 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:18:22,287 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:18:22,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i [2024-10-13 04:18:23,771 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:18:23,963 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:18:23,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-39.i [2024-10-13 04:18:23,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d81f7f16/b7af3fb5d95244c3a43a455e5e47a403/FLAGadf2ad829 [2024-10-13 04:18:24,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d81f7f16/b7af3fb5d95244c3a43a455e5e47a403 [2024-10-13 04:18:24,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:18:24,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:18:24,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:18:24,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:18:24,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:18:24,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:18:24" (1/1) ... [2024-10-13 04:18:24,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@687f1907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:24, skipping insertion in model container [2024-10-13 04:18:24,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:18:24" (1/1) ... [2024-10-13 04:18:24,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:18:24,526 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-while_file-39.i[915,928] [2024-10-13 04:18:24,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:18:24,585 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:18:24,597 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-while_file-39.i[915,928] [2024-10-13 04:18:24,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:18:24,631 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:18:24,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:24 WrapperNode [2024-10-13 04:18:24,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:18:24,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:18:24,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:18:24,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:18:24,639 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:18:24" (1/1) ... [2024-10-13 04:18:24,663 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:18:24" (1/1) ... [2024-10-13 04:18:24,732 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-10-13 04:18:24,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:18:24,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:18:24,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:18:24,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:18:24,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:24" (1/1) ... [2024-10-13 04:18:24,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:24" (1/1) ... [2024-10-13 04:18:24,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:24" (1/1) ... [2024-10-13 04:18:24,763 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:18:24,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:24" (1/1) ... [2024-10-13 04:18:24,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:24" (1/1) ... [2024-10-13 04:18:24,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:24" (1/1) ... [2024-10-13 04:18:24,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:24" (1/1) ... [2024-10-13 04:18:24,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:24" (1/1) ... [2024-10-13 04:18:24,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:24" (1/1) ... [2024-10-13 04:18:24,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:18:24,779 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:18:24,779 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:18:24,779 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:18:24,780 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:24" (1/1) ... [2024-10-13 04:18:24,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:18:24,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:18:24,827 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:18:24,830 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:18:24,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:18:24,881 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:18:24,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:18:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:18:24,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:18:24,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:18:24,964 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:18:24,967 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:18:25,262 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 04:18:25,262 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:18:25,318 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:18:25,319 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:18:25,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:18:25 BoogieIcfgContainer [2024-10-13 04:18:25,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:18:25,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:18:25,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:18:25,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:18:25,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:18:24" (1/3) ... [2024-10-13 04:18:25,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fca593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:18:25, skipping insertion in model container [2024-10-13 04:18:25,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:24" (2/3) ... [2024-10-13 04:18:25,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fca593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:18:25, skipping insertion in model container [2024-10-13 04:18:25,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:18:25" (3/3) ... [2024-10-13 04:18:25,336 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-39.i [2024-10-13 04:18:25,351 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:18:25,351 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:18:25,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:18:25,408 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;@12aad8e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:18:25,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:18:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 04:18:25,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-13 04:18:25,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:18:25,429 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:25,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:18:25,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:18:25,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1160943542, now seen corresponding path program 1 times [2024-10-13 04:18:25,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:18:25,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133103966] [2024-10-13 04:18:25,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:25,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:18:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:27,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:18:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:27,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:18:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:27,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:18:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:27,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:18:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:27,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 04:18:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:27,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 04:18:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:27,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 04:18:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:27,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 04:18:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:27,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 04:18:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:27,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 04:18:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:27,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:18:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:27,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:18:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:27,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:18:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:18:27,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:18:27,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133103966] [2024-10-13 04:18:27,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133103966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:18:27,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:18:27,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:18:27,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372622201] [2024-10-13 04:18:27,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:18:27,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:18:27,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:18:27,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:18:27,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:18:27,921 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-13 04:18:28,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:18:28,484 INFO L93 Difference]: Finished difference Result 146 states and 264 transitions. [2024-10-13 04:18:28,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:18:28,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 83 [2024-10-13 04:18:28,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:18:28,497 INFO L225 Difference]: With dead ends: 146 [2024-10-13 04:18:28,497 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 04:18:28,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:18:28,506 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 64 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:18:28,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 231 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:18:28,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 04:18:28,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2024-10-13 04:18:28,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 04:18:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2024-10-13 04:18:28,580 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 83 [2024-10-13 04:18:28,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:18:28,581 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2024-10-13 04:18:28,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-13 04:18:28,582 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2024-10-13 04:18:28,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-13 04:18:28,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:18:28,585 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:28,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:18:28,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:18:28,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:18:28,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1380550262, now seen corresponding path program 1 times [2024-10-13 04:18:28,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:18:28,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797022025] [2024-10-13 04:18:28,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:28,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:18:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:29,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:18:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:29,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:18:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:29,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:18:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:29,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:18:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:29,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 04:18:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:29,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 04:18:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:29,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 04:18:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:29,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 04:18:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:29,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 04:18:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:29,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 04:18:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:29,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:18:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:29,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:18:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:29,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:18:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:18:29,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:18:29,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797022025] [2024-10-13 04:18:29,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797022025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:18:29,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:18:29,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 04:18:29,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042239224] [2024-10-13 04:18:29,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:18:29,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 04:18:29,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:18:29,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 04:18:29,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:18:29,659 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:18:29,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:18:29,848 INFO L93 Difference]: Finished difference Result 106 states and 147 transitions. [2024-10-13 04:18:29,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 04:18:29,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2024-10-13 04:18:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:18:29,851 INFO L225 Difference]: With dead ends: 106 [2024-10-13 04:18:29,851 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 04:18:29,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:18:29,853 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 31 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:18:29,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 161 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:18:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 04:18:29,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2024-10-13 04:18:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 60 states have internal predecessors, (76), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 04:18:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-10-13 04:18:29,879 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 84 [2024-10-13 04:18:29,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:18:29,881 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-10-13 04:18:29,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:18:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-10-13 04:18:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-13 04:18:29,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:18:29,887 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:29,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:18:29,887 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:18:29,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:18:29,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1380490680, now seen corresponding path program 1 times [2024-10-13 04:18:29,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:18:29,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457308202] [2024-10-13 04:18:29,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:29,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:18:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:30,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:18:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:30,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:18:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:30,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:18:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:18:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:30,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 04:18:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:30,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 04:18:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:30,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 04:18:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:30,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 04:18:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:30,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 04:18:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:30,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 04:18:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:18:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:30,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:18:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:30,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:18:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:18:30,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:18:30,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457308202] [2024-10-13 04:18:30,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457308202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:18:30,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:18:30,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 04:18:30,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240767700] [2024-10-13 04:18:30,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:18:30,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 04:18:30,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:18:30,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 04:18:30,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:18:30,741 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:18:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:18:30,888 INFO L93 Difference]: Finished difference Result 107 states and 150 transitions. [2024-10-13 04:18:30,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 04:18:30,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2024-10-13 04:18:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:18:30,891 INFO L225 Difference]: With dead ends: 107 [2024-10-13 04:18:30,891 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 04:18:30,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:18:30,892 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:18:30,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 229 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:18:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 04:18:30,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2024-10-13 04:18:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 65 states have internal predecessors, (84), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 04:18:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-13 04:18:30,917 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 84 [2024-10-13 04:18:30,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:18:30,920 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-13 04:18:30,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:18:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-13 04:18:30,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-13 04:18:30,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:18:30,922 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:30,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:18:30,923 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:18:30,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:18:30,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1639892609, now seen corresponding path program 1 times [2024-10-13 04:18:30,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:18:30,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747391872] [2024-10-13 04:18:30,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:30,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:18:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:31,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:18:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:31,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:18:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:31,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:18:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:31,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:18:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:31,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 04:18:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:31,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 04:18:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:31,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 04:18:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:31,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 04:18:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:31,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 04:18:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:31,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 04:18:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:31,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:18:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:31,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:18:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:31,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:18:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 04:18:31,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:18:31,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747391872] [2024-10-13 04:18:31,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747391872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:18:31,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:18:31,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:18:31,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640523991] [2024-10-13 04:18:31,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:18:31,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:18:31,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:18:31,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:18:31,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:18:31,096 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:18:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:18:31,187 INFO L93 Difference]: Finished difference Result 226 states and 325 transitions. [2024-10-13 04:18:31,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:18:31,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2024-10-13 04:18:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:18:31,190 INFO L225 Difference]: With dead ends: 226 [2024-10-13 04:18:31,190 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 04:18:31,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:18:31,192 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 36 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:18:31,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 157 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:18:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 04:18:31,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2024-10-13 04:18:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.244186046511628) internal successors, (107), 86 states have internal predecessors, (107), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 04:18:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 185 transitions. [2024-10-13 04:18:31,220 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 185 transitions. Word has length 84 [2024-10-13 04:18:31,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:18:31,220 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 185 transitions. [2024-10-13 04:18:31,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:18:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 185 transitions. [2024-10-13 04:18:31,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 04:18:31,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:18:31,223 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:31,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 04:18:31,223 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:18:31,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:18:31,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1141709522, now seen corresponding path program 1 times [2024-10-13 04:18:31,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:18:31,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002852949] [2024-10-13 04:18:31,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:31,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:18:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:18:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:18:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:18:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:18:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 04:18:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 04:18:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 04:18:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 04:18:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 04:18:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 04:18:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:18:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:18:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:18:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:18:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:18:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:18:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:18:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:18:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 04:18:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 04:18:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 04:18:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 04:18:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 04:18:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 04:18:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 04:18:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 04:18:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-10-13 04:18:32,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:18:32,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002852949] [2024-10-13 04:18:32,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002852949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:18:32,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:18:32,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 04:18:32,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556574329] [2024-10-13 04:18:32,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:18:32,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 04:18:32,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:18:32,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 04:18:32,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:18:32,962 INFO L87 Difference]: Start difference. First operand 129 states and 185 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:18:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:18:33,655 INFO L93 Difference]: Finished difference Result 150 states and 206 transitions. [2024-10-13 04:18:33,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 04:18:33,655 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 167 [2024-10-13 04:18:33,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:18:33,657 INFO L225 Difference]: With dead ends: 150 [2024-10-13 04:18:33,657 INFO L226 Difference]: Without dead ends: 148 [2024-10-13 04:18:33,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2024-10-13 04:18:33,658 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 30 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:18:33,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 223 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:18:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-13 04:18:33,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 124. [2024-10-13 04:18:33,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 04:18:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 177 transitions. [2024-10-13 04:18:33,689 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 177 transitions. Word has length 167 [2024-10-13 04:18:33,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:18:33,690 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 177 transitions. [2024-10-13 04:18:33,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:18:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 177 transitions. [2024-10-13 04:18:33,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-13 04:18:33,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:18:33,695 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:33,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 04:18:33,696 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:18:33,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:18:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1298593554, now seen corresponding path program 1 times [2024-10-13 04:18:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:18:33,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306162986] [2024-10-13 04:18:33,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:33,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:18:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:18:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:18:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:18:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:18:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 04:18:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 04:18:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 04:18:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 04:18:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 04:18:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 04:18:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:18:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:18:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:18:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:18:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:18:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:18:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:18:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:18:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 04:18:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 04:18:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 04:18:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 04:18:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 04:18:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 04:18:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 04:18:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 04:18:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:34,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2024-10-13 04:18:34,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:18:34,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306162986] [2024-10-13 04:18:34,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306162986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:18:34,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:18:34,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 04:18:34,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641563567] [2024-10-13 04:18:34,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:18:34,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 04:18:34,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:18:34,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 04:18:34,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:18:34,930 INFO L87 Difference]: Start difference. First operand 124 states and 177 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:18:35,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:18:35,103 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2024-10-13 04:18:35,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 04:18:35,103 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 168 [2024-10-13 04:18:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:18:35,108 INFO L225 Difference]: With dead ends: 144 [2024-10-13 04:18:35,108 INFO L226 Difference]: Without dead ends: 142 [2024-10-13 04:18:35,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:18:35,109 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 29 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:18:35,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 299 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:18:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-13 04:18:35,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2024-10-13 04:18:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 81 states have internal predecessors, (99), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 04:18:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 177 transitions. [2024-10-13 04:18:35,154 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 177 transitions. Word has length 168 [2024-10-13 04:18:35,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:18:35,155 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 177 transitions. [2024-10-13 04:18:35,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:18:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 177 transitions. [2024-10-13 04:18:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-13 04:18:35,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:18:35,157 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:35,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 04:18:35,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:18:35,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:18:35,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1298533972, now seen corresponding path program 1 times [2024-10-13 04:18:35,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:18:35,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996638094] [2024-10-13 04:18:35,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:35,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:18:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:35,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:18:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:35,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:18:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:35,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:18:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:35,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:18:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:35,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 04:18:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:35,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 04:18:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:35,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 04:18:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:35,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 04:18:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:35,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 04:18:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:35,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 04:18:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:35,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:18:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:36,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:18:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:36,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:18:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:36,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:18:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:36,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:18:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:36,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:18:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:36,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:18:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:36,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:18:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:36,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 04:18:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:36,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 04:18:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:36,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 04:18:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:36,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 04:18:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:36,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 04:18:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:36,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 04:18:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:36,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 04:18:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:36,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 04:18:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2024-10-13 04:18:36,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:18:36,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996638094] [2024-10-13 04:18:36,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996638094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:18:36,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:18:36,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 04:18:36,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009575815] [2024-10-13 04:18:36,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:18:36,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 04:18:36,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:18:36,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 04:18:36,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:18:36,025 INFO L87 Difference]: Start difference. First operand 124 states and 177 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:18:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:18:36,174 INFO L93 Difference]: Finished difference Result 138 states and 194 transitions. [2024-10-13 04:18:36,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 04:18:36,174 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 168 [2024-10-13 04:18:36,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:18:36,175 INFO L225 Difference]: With dead ends: 138 [2024-10-13 04:18:36,175 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 04:18:36,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:18:36,177 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 27 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:18:36,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 205 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:18:36,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 04:18:36,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 04:18:36,181 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:18:36,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 04:18:36,181 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 168 [2024-10-13 04:18:36,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:18:36,181 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 04:18:36,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 04:18:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 04:18:36,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 04:18:36,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:18:36,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 04:18:36,188 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:36,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 04:18:36,354 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:18:36,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:18:36 BoogieIcfgContainer [2024-10-13 04:18:36,368 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:18:36,368 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:18:36,368 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:18:36,369 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:18:36,369 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:18:25" (3/4) ... [2024-10-13 04:18:36,371 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 04:18:36,374 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 04:18:36,379 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-13 04:18:36,379 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 04:18:36,379 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 04:18:36,380 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 04:18:36,478 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 04:18:36,478 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 04:18:36,478 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:18:36,479 INFO L158 Benchmark]: Toolchain (without parser) took 12133.97ms. Allocated memory was 159.4MB in the beginning and 346.0MB in the end (delta: 186.6MB). Free memory was 92.7MB in the beginning and 130.3MB in the end (delta: -37.7MB). Peak memory consumption was 151.1MB. Max. memory is 16.1GB. [2024-10-13 04:18:36,479 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:18:36,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.64ms. Allocated memory is still 159.4MB. Free memory was 92.5MB in the beginning and 78.6MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 04:18:36,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.30ms. Allocated memory is still 159.4MB. Free memory was 78.4MB in the beginning and 130.1MB in the end (delta: -51.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 04:18:36,480 INFO L158 Benchmark]: Boogie Preprocessor took 42.44ms. Allocated memory is still 159.4MB. Free memory was 130.1MB in the beginning and 125.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:18:36,480 INFO L158 Benchmark]: RCFGBuilder took 541.11ms. Allocated memory is still 159.4MB. Free memory was 125.9MB in the beginning and 107.9MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 04:18:36,480 INFO L158 Benchmark]: TraceAbstraction took 11042.75ms. Allocated memory was 159.4MB in the beginning and 346.0MB in the end (delta: 186.6MB). Free memory was 107.6MB in the beginning and 135.6MB in the end (delta: -27.9MB). Peak memory consumption was 161.8MB. Max. memory is 16.1GB. [2024-10-13 04:18:36,481 INFO L158 Benchmark]: Witness Printer took 110.13ms. Allocated memory is still 346.0MB. Free memory was 135.6MB in the beginning and 130.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:18:36,482 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.16ms. Allocated memory is still 104.9MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.64ms. Allocated memory is still 159.4MB. Free memory was 92.5MB in the beginning and 78.6MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.30ms. Allocated memory is still 159.4MB. Free memory was 78.4MB in the beginning and 130.1MB in the end (delta: -51.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.44ms. Allocated memory is still 159.4MB. Free memory was 130.1MB in the beginning and 125.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 541.11ms. Allocated memory is still 159.4MB. Free memory was 125.9MB in the beginning and 107.9MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11042.75ms. Allocated memory was 159.4MB in the beginning and 346.0MB in the end (delta: 186.6MB). Free memory was 107.6MB in the beginning and 135.6MB in the end (delta: -27.9MB). Peak memory consumption was 161.8MB. Max. memory is 16.1GB. * Witness Printer took 110.13ms. Allocated memory is still 346.0MB. Free memory was 135.6MB in the beginning and 130.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 7, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 227 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 1505 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1119 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 705 IncrementalHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 386 mSDtfsCounter, 705 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 334 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=4, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 103 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 838 NumberOfCodeBlocks, 838 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 831 ConstructedInterpolants, 0 QuantifiedInterpolants, 4190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 5237/5237 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: 94]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-13 04:18:36,510 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