./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_operatoramount_amount10_file-74.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_operatoramount_amount10_file-74.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 90bab71b19b8d294f6f33a089362abb0368c1684c0a986a46f18ec8b0de9ff87 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:01:49,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:01:49,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:01:49,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:01:49,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:01:49,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:01:49,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:01:49,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:01:49,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:01:49,595 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:01:49,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:01:49,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:01:49,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:01:49,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:01:49,597 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:01:49,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:01:49,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:01:49,599 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:01:49,599 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:01:49,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:01:49,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:01:49,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:01:49,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:01:49,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:01:49,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:01:49,603 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:01:49,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:01:49,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:01:49,604 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:01:49,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:01:49,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:01:49,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:01:49,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:01:49,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:01:49,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:01:49,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:01:49,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:01:49,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:01:49,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:01:49,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:01:49,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:01:49,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:01:49,612 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 -> 90bab71b19b8d294f6f33a089362abb0368c1684c0a986a46f18ec8b0de9ff87 [2024-10-13 05:01:49,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:01:49,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:01:49,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:01:49,870 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:01:49,872 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:01:49,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-74.i [2024-10-13 05:01:51,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:01:51,544 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:01:51,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-74.i [2024-10-13 05:01:51,554 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aeeb8f60/eb2d6ad90cfb4620a08f03418cb9cc7f/FLAG671294f81 [2024-10-13 05:01:51,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aeeb8f60/eb2d6ad90cfb4620a08f03418cb9cc7f [2024-10-13 05:01:51,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:01:51,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:01:51,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:01:51,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:01:51,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:01:51,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:01:51" (1/1) ... [2024-10-13 05:01:51,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a3c8240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:51, skipping insertion in model container [2024-10-13 05:01:51,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:01:51" (1/1) ... [2024-10-13 05:01:51,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:01:51,805 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_operatoramount_amount10_file-74.i[915,928] [2024-10-13 05:01:51,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:01:51,843 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:01:51,860 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_operatoramount_amount10_file-74.i[915,928] [2024-10-13 05:01:51,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:01:51,887 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:01:51,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:51 WrapperNode [2024-10-13 05:01:51,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:01:51,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:01:51,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:01:51,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:01:51,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:51" (1/1) ... [2024-10-13 05:01:51,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:51" (1/1) ... [2024-10-13 05:01:51,919 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-10-13 05:01:51,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:01:51,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:01:51,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:01:51,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:01:51,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:51" (1/1) ... [2024-10-13 05:01:51,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:51" (1/1) ... [2024-10-13 05:01:51,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:51" (1/1) ... [2024-10-13 05:01:51,941 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 05:01:51,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:51" (1/1) ... [2024-10-13 05:01:51,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:51" (1/1) ... [2024-10-13 05:01:51,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:51" (1/1) ... [2024-10-13 05:01:51,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:51" (1/1) ... [2024-10-13 05:01:51,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:51" (1/1) ... [2024-10-13 05:01:51,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:51" (1/1) ... [2024-10-13 05:01:51,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:01:51,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:01:51,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:01:51,956 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:01:51,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:51" (1/1) ... [2024-10-13 05:01:51,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:01:51,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:01:51,984 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 05:01:51,986 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 05:01:52,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:01:52,021 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:01:52,021 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:01:52,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:01:52,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:01:52,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:01:52,073 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:01:52,075 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:01:52,207 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 05:01:52,207 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:01:52,240 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:01:52,240 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:01:52,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:52 BoogieIcfgContainer [2024-10-13 05:01:52,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:01:52,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:01:52,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:01:52,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:01:52,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:01:51" (1/3) ... [2024-10-13 05:01:52,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b771df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:01:52, skipping insertion in model container [2024-10-13 05:01:52,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:51" (2/3) ... [2024-10-13 05:01:52,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b771df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:01:52, skipping insertion in model container [2024-10-13 05:01:52,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:52" (3/3) ... [2024-10-13 05:01:52,248 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-74.i [2024-10-13 05:01:52,260 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:01:52,261 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:01:52,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:01:52,327 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;@557be20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:01:52,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:01:52,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:01:52,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 05:01:52,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:52,349 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:01:52,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:52,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:52,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1187644946, now seen corresponding path program 1 times [2024-10-13 05:01:52,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:01:52,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934542815] [2024-10-13 05:01:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:52,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:01:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:52,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:01:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:52,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:01:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:52,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:01:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:52,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:01:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:52,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:01:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:52,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:01:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:52,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:01:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:52,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:01:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:52,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:01:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:52,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:01:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:52,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:01:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:52,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:01:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:52,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:01:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:52,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 05:01:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:52,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 05:01:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:52,634 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:01:52,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:01:52,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934542815] [2024-10-13 05:01:52,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934542815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:52,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:52,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:01:52,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873705996] [2024-10-13 05:01:52,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:52,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:01:52,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:01:52,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:01:52,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:01:52,665 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:01:52,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:52,689 INFO L93 Difference]: Finished difference Result 71 states and 125 transitions. [2024-10-13 05:01:52,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:01:52,692 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 88 [2024-10-13 05:01:52,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:52,697 INFO L225 Difference]: With dead ends: 71 [2024-10-13 05:01:52,697 INFO L226 Difference]: Without dead ends: 35 [2024-10-13 05:01:52,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:01:52,702 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:52,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:01:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-13 05:01:52,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-13 05:01:52,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:01:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 51 transitions. [2024-10-13 05:01:52,740 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 51 transitions. Word has length 88 [2024-10-13 05:01:52,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:52,740 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 51 transitions. [2024-10-13 05:01:52,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:01:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 51 transitions. [2024-10-13 05:01:52,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 05:01:52,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:52,743 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:01:52,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:01:52,744 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:52,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash -292076180, now seen corresponding path program 1 times [2024-10-13 05:01:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:01:52,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820302179] [2024-10-13 05:01:52,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:52,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:01:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:01:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:01:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:01:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:01:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:01:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:01:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:01:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:01:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:01:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:01:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:01:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:01:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:01:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 05:01:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 05:01:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:01:53,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:01:53,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820302179] [2024-10-13 05:01:53,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820302179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:53,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:53,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:01:53,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284783213] [2024-10-13 05:01:53,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:53,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:01:53,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:01:53,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:01:53,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:01:53,113 INFO L87 Difference]: Start difference. First operand 35 states and 51 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:01:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:53,256 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2024-10-13 05:01:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:01:53,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 88 [2024-10-13 05:01:53,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:53,259 INFO L225 Difference]: With dead ends: 41 [2024-10-13 05:01:53,259 INFO L226 Difference]: Without dead ends: 39 [2024-10-13 05:01:53,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:01:53,262 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:53,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 120 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:01:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-13 05:01:53,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-10-13 05:01:53,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:01:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2024-10-13 05:01:53,274 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 88 [2024-10-13 05:01:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:53,275 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2024-10-13 05:01:53,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:01:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2024-10-13 05:01:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 05:01:53,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:53,278 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:01:53,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:01:53,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:53,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:53,279 INFO L85 PathProgramCache]: Analyzing trace with hash -464431798, now seen corresponding path program 1 times [2024-10-13 05:01:53,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:01:53,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074272004] [2024-10-13 05:01:53,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:53,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:01:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:01:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:01:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:01:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:01:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:01:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:01:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:01:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:01:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:01:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:01:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:01:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:01:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:01:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 05:01:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 05:01:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:01:53,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:01:53,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074272004] [2024-10-13 05:01:53,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074272004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:53,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:53,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:01:53,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306344924] [2024-10-13 05:01:53,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:53,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:01:53,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:01:53,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:01:53,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:01:53,491 INFO L87 Difference]: Start difference. First operand 37 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:01:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:53,730 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2024-10-13 05:01:53,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:01:53,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 89 [2024-10-13 05:01:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:53,733 INFO L225 Difference]: With dead ends: 45 [2024-10-13 05:01:53,734 INFO L226 Difference]: Without dead ends: 43 [2024-10-13 05:01:53,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:01:53,736 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:53,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 139 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:01:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-13 05:01:53,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2024-10-13 05:01:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:01:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2024-10-13 05:01:53,748 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 89 [2024-10-13 05:01:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:53,749 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2024-10-13 05:01:53,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:01:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2024-10-13 05:01:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 05:01:53,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:01:53,752 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:01:53,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:01:53,753 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:01:53,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:01:53,754 INFO L85 PathProgramCache]: Analyzing trace with hash -464491380, now seen corresponding path program 1 times [2024-10-13 05:01:53,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:01:53,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328832613] [2024-10-13 05:01:53,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:01:53,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:01:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:01:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:01:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:01:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:01:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:01:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:01:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:01:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:01:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:01:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:01:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:01:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:01:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:01:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 05:01:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 05:01:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:01:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:01:53,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:01:53,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328832613] [2024-10-13 05:01:53,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328832613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:01:53,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:01:53,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:01:53,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749089678] [2024-10-13 05:01:53,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:01:53,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:01:53,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:01:53,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:01:53,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:01:53,957 INFO L87 Difference]: Start difference. First operand 37 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:01:54,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:01:54,084 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2024-10-13 05:01:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:01:54,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 89 [2024-10-13 05:01:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:01:54,085 INFO L225 Difference]: With dead ends: 43 [2024-10-13 05:01:54,086 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 05:01:54,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:01:54,096 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 7 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:01:54,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 172 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:01:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 05:01:54,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 05:01:54,098 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 05:01:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 05:01:54,098 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2024-10-13 05:01:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:01:54,099 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 05:01:54,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:01:54,099 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 05:01:54,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 05:01:54,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:01:54,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:01:54,105 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 05:01:54,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 05:01:54,142 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:01:54,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:01:54 BoogieIcfgContainer [2024-10-13 05:01:54,156 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:01:54,156 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:01:54,156 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:01:54,156 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:01:54,157 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:52" (3/4) ... [2024-10-13 05:01:54,163 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 05:01:54,167 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 05:01:54,173 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-13 05:01:54,176 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-13 05:01:54,177 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 05:01:54,177 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 05:01:54,250 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 05:01:54,250 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 05:01:54,250 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:01:54,251 INFO L158 Benchmark]: Toolchain (without parser) took 2672.43ms. Allocated memory was 155.2MB in the beginning and 232.8MB in the end (delta: 77.6MB). Free memory was 85.6MB in the beginning and 161.1MB in the end (delta: -75.5MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2024-10-13 05:01:54,251 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory was 111.0MB in the beginning and 110.8MB in the end (delta: 140.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:01:54,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.65ms. Allocated memory is still 155.2MB. Free memory was 85.3MB in the beginning and 122.6MB in the end (delta: -37.3MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-10-13 05:01:54,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.49ms. Allocated memory is still 155.2MB. Free memory was 122.6MB in the beginning and 121.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:01:54,252 INFO L158 Benchmark]: Boogie Preprocessor took 36.16ms. Allocated memory is still 155.2MB. Free memory was 120.5MB in the beginning and 118.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:01:54,252 INFO L158 Benchmark]: RCFGBuilder took 284.24ms. Allocated memory is still 155.2MB. Free memory was 118.9MB in the beginning and 104.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 05:01:54,252 INFO L158 Benchmark]: TraceAbstraction took 1913.65ms. Allocated memory was 155.2MB in the beginning and 232.8MB in the end (delta: 77.6MB). Free memory was 103.2MB in the beginning and 166.4MB in the end (delta: -63.2MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-10-13 05:01:54,253 INFO L158 Benchmark]: Witness Printer took 94.33ms. Allocated memory is still 232.8MB. Free memory was 166.4MB in the beginning and 161.1MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 05:01:54,254 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.17ms. Allocated memory is still 155.2MB. Free memory was 111.0MB in the beginning and 110.8MB in the end (delta: 140.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.65ms. Allocated memory is still 155.2MB. Free memory was 85.3MB in the beginning and 122.6MB in the end (delta: -37.3MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.49ms. Allocated memory is still 155.2MB. Free memory was 122.6MB in the beginning and 121.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.16ms. Allocated memory is still 155.2MB. Free memory was 120.5MB in the beginning and 118.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 284.24ms. Allocated memory is still 155.2MB. Free memory was 118.9MB in the beginning and 104.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1913.65ms. Allocated memory was 155.2MB in the beginning and 232.8MB in the end (delta: 77.6MB). Free memory was 103.2MB in the beginning and 166.4MB in the end (delta: -63.2MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Witness Printer took 94.33ms. Allocated memory is still 232.8MB. Free memory was 166.4MB in the beginning and 161.1MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 479 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 286 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 193 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 467 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1680/1680 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: 76]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-13 05:01:54,274 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