./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.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 66787726949481a4f01caef79c3e8fdad3a573b5b9ad657da2a70c5a83f1feb5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:12:52,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:12:52,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:12:52,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:12:52,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:12:52,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:12:52,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:12:52,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:12:52,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:12:52,754 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:12:52,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:12:52,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:12:52,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:12:52,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:12:52,758 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:12:52,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:12:52,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:12:52,764 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:12:52,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:12:52,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:12:52,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:12:52,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:12:52,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:12:52,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:12:52,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:12:52,766 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:12:52,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:12:52,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:12:52,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:12:52,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:12:52,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:12:52,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:12:52,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:12:52,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:12:52,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:12:52,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:12:52,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:12:52,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:12:52,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:12:52,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:12:52,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:12:52,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:12:52,776 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 -> 66787726949481a4f01caef79c3e8fdad3a573b5b9ad657da2a70c5a83f1feb5 [2024-11-12 06:12:53,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:12:53,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:12:53,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:12:53,150 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:12:53,150 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:12:53,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i [2024-11-12 06:12:54,859 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:12:55,023 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:12:55,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i [2024-11-12 06:12:55,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f85e07d24/1b09798048214fdfb08779a4cb454a61/FLAGc1f49c5ef [2024-11-12 06:12:55,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f85e07d24/1b09798048214fdfb08779a4cb454a61 [2024-11-12 06:12:55,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:12:55,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:12:55,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:12:55,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:12:55,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:12:55,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:12:55" (1/1) ... [2024-11-12 06:12:55,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da5130a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:12:55, skipping insertion in model container [2024-11-12 06:12:55,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:12:55" (1/1) ... [2024-11-12 06:12:55,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:12:55,301 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i[915,928] [2024-11-12 06:12:55,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:12:55,351 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:12:55,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i[915,928] [2024-11-12 06:12:55,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:12:55,396 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:12:55,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:12:55 WrapperNode [2024-11-12 06:12:55,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:12:55,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:12:55,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:12:55,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:12:55,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:12:55" (1/1) ... [2024-11-12 06:12:55,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:12:55" (1/1) ... [2024-11-12 06:12:55,438 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 73 [2024-11-12 06:12:55,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:12:55,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:12:55,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:12:55,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:12:55,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:12:55" (1/1) ... [2024-11-12 06:12:55,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:12:55" (1/1) ... [2024-11-12 06:12:55,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:12:55" (1/1) ... [2024-11-12 06:12:55,463 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 06:12:55,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:12:55" (1/1) ... [2024-11-12 06:12:55,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:12:55" (1/1) ... [2024-11-12 06:12:55,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:12:55" (1/1) ... [2024-11-12 06:12:55,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:12:55" (1/1) ... [2024-11-12 06:12:55,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:12:55" (1/1) ... [2024-11-12 06:12:55,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:12:55" (1/1) ... [2024-11-12 06:12:55,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:12:55,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:12:55,474 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:12:55,474 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:12:55,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:12:55" (1/1) ... [2024-11-12 06:12:55,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:12:55,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:12:55,504 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:12:55,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:12:55,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:12:55,553 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:12:55,554 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:12:55,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:12:55,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:12:55,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:12:55,608 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:12:55,610 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:12:55,759 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 06:12:55,759 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:12:55,780 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:12:55,780 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:12:55,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:12:55 BoogieIcfgContainer [2024-11-12 06:12:55,781 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:12:55,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:12:55,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:12:55,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:12:55,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:12:55" (1/3) ... [2024-11-12 06:12:55,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d0ffa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:12:55, skipping insertion in model container [2024-11-12 06:12:55,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:12:55" (2/3) ... [2024-11-12 06:12:55,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d0ffa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:12:55, skipping insertion in model container [2024-11-12 06:12:55,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:12:55" (3/3) ... [2024-11-12 06:12:55,798 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-43.i [2024-11-12 06:12:55,816 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:12:55,816 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:12:55,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:12:55,884 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;@6984f167, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:12:55,884 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:12:55,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:12:55,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 06:12:55,898 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:12:55,899 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:12:55,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:12:55,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:12:55,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2124186055, now seen corresponding path program 1 times [2024-11-12 06:12:55,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:12:55,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306296103] [2024-11-12 06:12:55,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:12:55,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:12:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:56,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:12:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:56,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:12:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:56,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:12:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:56,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:12:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:56,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:12:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:56,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:12:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:56,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:12:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:56,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:12:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:56,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:12:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:56,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:12:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-12 06:12:56,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:12:56,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306296103] [2024-11-12 06:12:56,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306296103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:12:56,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:12:56,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:12:56,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901335666] [2024-11-12 06:12:56,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:12:56,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:12:56,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:12:56,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:12:56,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:12:56,964 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:12:57,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:12:57,061 INFO L93 Difference]: Finished difference Result 83 states and 132 transitions. [2024-11-12 06:12:57,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:12:57,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2024-11-12 06:12:57,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:12:57,106 INFO L225 Difference]: With dead ends: 83 [2024-11-12 06:12:57,107 INFO L226 Difference]: Without dead ends: 48 [2024-11-12 06:12:57,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:12:57,122 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 18 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:12:57,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 181 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:12:57,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-12 06:12:57,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2024-11-12 06:12:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:12:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-12 06:12:57,247 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 66 [2024-11-12 06:12:57,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:12:57,251 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-12 06:12:57,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:12:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-12 06:12:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 06:12:57,255 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:12:57,256 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:12:57,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:12:57,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:12:57,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:12:57,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2122339013, now seen corresponding path program 1 times [2024-11-12 06:12:57,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:12:57,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035762524] [2024-11-12 06:12:57,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:12:57,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:12:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:57,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:12:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:57,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:12:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:57,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:12:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:57,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:12:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:57,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:12:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:57,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:12:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:57,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:12:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:57,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:12:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:57,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:12:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:57,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:12:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-12 06:12:57,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:12:57,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035762524] [2024-11-12 06:12:57,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035762524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:12:57,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:12:57,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:12:57,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58263565] [2024-11-12 06:12:57,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:12:57,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:12:57,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:12:57,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:12:57,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:12:57,741 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:12:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:12:57,881 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2024-11-12 06:12:57,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:12:57,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2024-11-12 06:12:57,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:12:57,883 INFO L225 Difference]: With dead ends: 48 [2024-11-12 06:12:57,883 INFO L226 Difference]: Without dead ends: 46 [2024-11-12 06:12:57,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:12:57,885 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 11 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:12:57,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 219 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:12:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-12 06:12:57,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2024-11-12 06:12:57,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:12:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-12 06:12:57,898 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 66 [2024-11-12 06:12:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:12:57,901 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-12 06:12:57,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:12:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-12 06:12:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 06:12:57,907 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:12:57,907 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:12:57,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:12:57,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:12:57,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:12:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1880376511, now seen corresponding path program 1 times [2024-11-12 06:12:57,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:12:57,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008243716] [2024-11-12 06:12:57,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:12:57,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:12:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:12:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:12:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:12:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:12:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:12:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:12:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:12:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:12:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:12:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:12:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-12 06:12:58,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:12:58,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008243716] [2024-11-12 06:12:58,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008243716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:12:58,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:12:58,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 06:12:58,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666789846] [2024-11-12 06:12:58,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:12:58,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 06:12:58,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:12:58,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 06:12:58,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:12:58,289 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:12:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:12:58,413 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2024-11-12 06:12:58,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 06:12:58,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2024-11-12 06:12:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:12:58,416 INFO L225 Difference]: With dead ends: 45 [2024-11-12 06:12:58,417 INFO L226 Difference]: Without dead ends: 43 [2024-11-12 06:12:58,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 06:12:58,418 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:12:58,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 235 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:12:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-12 06:12:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2024-11-12 06:12:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:12:58,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-12 06:12:58,431 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 66 [2024-11-12 06:12:58,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:12:58,431 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-12 06:12:58,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:12:58,432 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-12 06:12:58,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 06:12:58,433 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:12:58,433 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:12:58,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:12:58,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:12:58,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:12:58,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1602309983, now seen corresponding path program 1 times [2024-11-12 06:12:58,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:12:58,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103392738] [2024-11-12 06:12:58,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:12:58,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:12:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:12:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:12:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:12:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:12:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:12:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:12:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:12:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:12:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:12:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:12:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:58,756 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-12 06:12:58,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:12:58,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103392738] [2024-11-12 06:12:58,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103392738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:12:58,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:12:58,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:12:58,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810993909] [2024-11-12 06:12:58,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:12:58,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:12:58,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:12:58,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:12:58,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:12:58,758 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:12:58,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:12:58,880 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2024-11-12 06:12:58,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:12:58,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-12 06:12:58,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:12:58,881 INFO L225 Difference]: With dead ends: 51 [2024-11-12 06:12:58,881 INFO L226 Difference]: Without dead ends: 49 [2024-11-12 06:12:58,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:12:58,882 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 16 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:12:58,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 215 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:12:58,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-12 06:12:58,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2024-11-12 06:12:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:12:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-12 06:12:58,891 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 67 [2024-11-12 06:12:58,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:12:58,891 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-12 06:12:58,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:12:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-12 06:12:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 06:12:58,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:12:58,895 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:12:58,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 06:12:58,895 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:12:58,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:12:58,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1604157025, now seen corresponding path program 1 times [2024-11-12 06:12:58,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:12:58,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980438134] [2024-11-12 06:12:58,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:12:58,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:12:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:59,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:12:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:59,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:12:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:59,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:12:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:59,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:12:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:59,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:12:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:59,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:12:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:59,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:12:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:59,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:12:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:59,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:12:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:59,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:12:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:12:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-12 06:12:59,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:12:59,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980438134] [2024-11-12 06:12:59,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980438134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:12:59,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:12:59,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:12:59,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282799636] [2024-11-12 06:12:59,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:12:59,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:12:59,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:12:59,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:12:59,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:12:59,044 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:12:59,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:12:59,110 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2024-11-12 06:12:59,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:12:59,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-12 06:12:59,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:12:59,111 INFO L225 Difference]: With dead ends: 46 [2024-11-12 06:12:59,111 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 06:12:59,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:12:59,113 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 14 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:12:59,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 214 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:12:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 06:12:59,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 06:12:59,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 06:12:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 06:12:59,115 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2024-11-12 06:12:59,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:12:59,115 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 06:12:59,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:12:59,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 06:12:59,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 06:12:59,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:12:59,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 06:12:59,122 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 06:12:59,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 06:12:59,147 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:12:59,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:12:59 BoogieIcfgContainer [2024-11-12 06:12:59,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:12:59,166 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:12:59,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:12:59,167 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:12:59,167 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:12:55" (3/4) ... [2024-11-12 06:12:59,170 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 06:12:59,174 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 06:12:59,178 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-12 06:12:59,178 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 06:12:59,179 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 06:12:59,179 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 06:12:59,261 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 06:12:59,262 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 06:12:59,262 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:12:59,262 INFO L158 Benchmark]: Toolchain (without parser) took 4215.52ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 79.1MB in the beginning and 108.9MB in the end (delta: -29.8MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2024-11-12 06:12:59,263 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 151.0MB. Free memory was 105.2MB in the beginning and 105.1MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:12:59,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.01ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 78.9MB in the beginning and 172.3MB in the end (delta: -93.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 06:12:59,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.57ms. Allocated memory is still 201.3MB. Free memory was 172.3MB in the beginning and 170.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:12:59,264 INFO L158 Benchmark]: Boogie Preprocessor took 33.90ms. Allocated memory is still 201.3MB. Free memory was 170.2MB in the beginning and 169.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:12:59,264 INFO L158 Benchmark]: RCFGBuilder took 307.49ms. Allocated memory is still 201.3MB. Free memory was 168.1MB in the beginning and 155.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:12:59,264 INFO L158 Benchmark]: TraceAbstraction took 3382.14ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 114.2MB in the end (delta: 40.3MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2024-11-12 06:12:59,264 INFO L158 Benchmark]: Witness Printer took 95.53ms. Allocated memory is still 201.3MB. Free memory was 114.2MB in the beginning and 108.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 06:12:59,266 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.21ms. Allocated memory is still 151.0MB. Free memory was 105.2MB in the beginning and 105.1MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.01ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 78.9MB in the beginning and 172.3MB in the end (delta: -93.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.57ms. Allocated memory is still 201.3MB. Free memory was 172.3MB in the beginning and 170.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.90ms. Allocated memory is still 201.3MB. Free memory was 170.2MB in the beginning and 169.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 307.49ms. Allocated memory is still 201.3MB. Free memory was 168.1MB in the beginning and 155.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3382.14ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 114.2MB in the end (delta: 40.3MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * Witness Printer took 95.53ms. Allocated memory is still 201.3MB. Free memory was 114.2MB in the beginning and 108.9MB 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 1064 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 818 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 193 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 246 mSDtfsCounter, 193 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 900/900 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: 72]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) RESULT: Ultimate proved your program to be correct! [2024-11-12 06:12:59,298 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