./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product03.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product03.cil.c -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 fd97c2884595bd9a9b703dc95e9a5caeaf3b95ed9b6ed8cf435c9ebd351e9142 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:06:06,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:06:06,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:06:06,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:06:06,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:06:06,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:06:06,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:06:06,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:06:06,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:06:06,767 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:06:06,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:06:06,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:06:06,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:06:06,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:06:06,770 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:06:06,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:06:06,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:06:06,773 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:06:06,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:06:06,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:06:06,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:06:06,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:06:06,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:06:06,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:06:06,778 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:06:06,778 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:06:06,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:06:06,778 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:06:06,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:06:06,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:06:06,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:06:06,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:06:06,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:06:06,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:06:06,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:06:06,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:06:06,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:06:06,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:06:06,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:06:06,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:06:06,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:06:06,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:06:06,785 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 -> fd97c2884595bd9a9b703dc95e9a5caeaf3b95ed9b6ed8cf435c9ebd351e9142 [2024-11-19 22:06:07,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:06:07,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:06:07,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:06:07,071 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:06:07,072 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:06:07,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product03.cil.c [2024-11-19 22:06:08,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:06:08,828 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:06:08,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product03.cil.c [2024-11-19 22:06:08,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77155a2bd/e2b167b1e9554cb9af6848c0cf5913a7/FLAG57e59ad63 [2024-11-19 22:06:09,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77155a2bd/e2b167b1e9554cb9af6848c0cf5913a7 [2024-11-19 22:06:09,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:06:09,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:06:09,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:06:09,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:06:09,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:06:09,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:06:09" (1/1) ... [2024-11-19 22:06:09,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df6490a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:09, skipping insertion in model container [2024-11-19 22:06:09,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:06:09" (1/1) ... [2024-11-19 22:06:09,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:06:09,541 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/product-lines/minepump_spec3_product03.cil.c[14430,14443] [2024-11-19 22:06:09,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:06:09,577 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:06:09,587 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2024-11-19 22:06:09,589 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] [2024-11-19 22:06:09,589 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [251] [2024-11-19 22:06:09,589 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [617] [2024-11-19 22:06:09,589 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [655] [2024-11-19 22:06:09,590 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [664] [2024-11-19 22:06:09,590 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [699] [2024-11-19 22:06:09,590 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [795] [2024-11-19 22:06:09,650 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/product-lines/minepump_spec3_product03.cil.c[14430,14443] [2024-11-19 22:06:09,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:06:09,677 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:06:09,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:09 WrapperNode [2024-11-19 22:06:09,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:06:09,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:06:09,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:06:09,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:06:09,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:09" (1/1) ... [2024-11-19 22:06:09,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:09" (1/1) ... [2024-11-19 22:06:09,741 INFO L138 Inliner]: procedures = 50, calls = 91, calls flagged for inlining = 19, calls inlined = 16, statements flattened = 146 [2024-11-19 22:06:09,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:06:09,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:06:09,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:06:09,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:06:09,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:09" (1/1) ... [2024-11-19 22:06:09,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:09" (1/1) ... [2024-11-19 22:06:09,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:09" (1/1) ... [2024-11-19 22:06:09,790 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-19 22:06:09,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:09" (1/1) ... [2024-11-19 22:06:09,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:09" (1/1) ... [2024-11-19 22:06:09,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:09" (1/1) ... [2024-11-19 22:06:09,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:09" (1/1) ... [2024-11-19 22:06:09,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:09" (1/1) ... [2024-11-19 22:06:09,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:09" (1/1) ... [2024-11-19 22:06:09,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:06:09,812 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:06:09,812 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:06:09,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:06:09,813 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:09" (1/1) ... [2024-11-19 22:06:09,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:06:09,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:06:09,849 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-19 22:06:09,855 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-19 22:06:09,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:06:09,900 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-19 22:06:09,900 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-19 22:06:09,900 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-19 22:06:09,901 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-19 22:06:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-19 22:06:09,901 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-19 22:06:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-19 22:06:09,901 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-19 22:06:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:06:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-19 22:06:09,901 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-19 22:06:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:06:09,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:06:09,965 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:06:09,967 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:06:10,187 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-19 22:06:10,187 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:06:10,203 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:06:10,203 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 22:06:10,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:06:10 BoogieIcfgContainer [2024-11-19 22:06:10,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:06:10,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:06:10,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:06:10,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:06:10,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:06:09" (1/3) ... [2024-11-19 22:06:10,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4a7103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:06:10, skipping insertion in model container [2024-11-19 22:06:10,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:09" (2/3) ... [2024-11-19 22:06:10,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4a7103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:06:10, skipping insertion in model container [2024-11-19 22:06:10,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:06:10" (3/3) ... [2024-11-19 22:06:10,215 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product03.cil.c [2024-11-19 22:06:10,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:06:10,235 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:06:10,295 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:06:10,302 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;@75f3a01b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:06:10,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:06:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 58 states have internal predecessors, (75), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 22:06:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 22:06:10,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:10,322 INFO L215 NwaCegarLoop]: trace histogram [1, 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-19 22:06:10,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:10,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:10,328 INFO L85 PathProgramCache]: Analyzing trace with hash 820054075, now seen corresponding path program 1 times [2024-11-19 22:06:10,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:06:10,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669007133] [2024-11-19 22:06:10,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:10,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:06:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:10,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:06:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:10,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:06:10,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669007133] [2024-11-19 22:06:10,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669007133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:10,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:10,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 22:06:10,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875900437] [2024-11-19 22:06:10,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:10,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 22:06:10,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:06:10,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 22:06:10,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 22:06:10,610 INFO L87 Difference]: Start difference. First operand has 68 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 58 states have internal predecessors, (75), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:06:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:10,634 INFO L93 Difference]: Finished difference Result 128 states and 173 transitions. [2024-11-19 22:06:10,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 22:06:10,636 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-19 22:06:10,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:10,642 INFO L225 Difference]: With dead ends: 128 [2024-11-19 22:06:10,643 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 22:06:10,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 22:06:10,652 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:10,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 22:06:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-19 22:06:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 22:06:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2024-11-19 22:06:10,712 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 25 [2024-11-19 22:06:10,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:10,713 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2024-11-19 22:06:10,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:06:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2024-11-19 22:06:10,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 22:06:10,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:10,717 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 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-19 22:06:10,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:06:10,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:10,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:10,735 INFO L85 PathProgramCache]: Analyzing trace with hash -633074439, now seen corresponding path program 1 times [2024-11-19 22:06:10,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:06:10,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317121470] [2024-11-19 22:06:10,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:10,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:06:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:10,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 22:06:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:10,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:10,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:06:10,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317121470] [2024-11-19 22:06:10,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317121470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:10,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:10,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:06:10,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761092712] [2024-11-19 22:06:10,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:10,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:06:10,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:06:10,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:06:10,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:10,857 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:06:10,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:10,878 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2024-11-19 22:06:10,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:06:10,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-19 22:06:10,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:10,881 INFO L225 Difference]: With dead ends: 80 [2024-11-19 22:06:10,882 INFO L226 Difference]: Without dead ends: 50 [2024-11-19 22:06:10,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:10,883 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 17 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:10,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-19 22:06:10,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-19 22:06:10,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 44 states have internal predecessors, (54), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 22:06:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2024-11-19 22:06:10,899 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 26 [2024-11-19 22:06:10,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:10,899 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2024-11-19 22:06:10,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:06:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2024-11-19 22:06:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 22:06:10,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:10,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-19 22:06:10,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:06:10,901 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:10,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:10,901 INFO L85 PathProgramCache]: Analyzing trace with hash -728107618, now seen corresponding path program 1 times [2024-11-19 22:06:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:06:10,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900170684] [2024-11-19 22:06:10,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:10,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:06:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:11,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:06:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:11,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:06:11,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900170684] [2024-11-19 22:06:11,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900170684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:11,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:11,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:06:11,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466535557] [2024-11-19 22:06:11,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:11,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:06:11,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:06:11,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:06:11,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:11,042 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:06:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:11,074 INFO L93 Difference]: Finished difference Result 135 states and 172 transitions. [2024-11-19 22:06:11,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:06:11,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-19 22:06:11,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:11,077 INFO L225 Difference]: With dead ends: 135 [2024-11-19 22:06:11,077 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 22:06:11,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:11,079 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:11,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 113 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 22:06:11,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2024-11-19 22:06:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 75 states have internal predecessors, (94), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 22:06:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2024-11-19 22:06:11,092 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 30 [2024-11-19 22:06:11,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:11,092 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2024-11-19 22:06:11,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:06:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2024-11-19 22:06:11,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 22:06:11,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:11,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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-19 22:06:11,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:06:11,094 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:11,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:11,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1676304469, now seen corresponding path program 1 times [2024-11-19 22:06:11,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:06:11,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010540472] [2024-11-19 22:06:11,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:11,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:06:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:11,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:06:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:11,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:06:11,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010540472] [2024-11-19 22:06:11,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010540472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:11,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:11,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:06:11,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033864287] [2024-11-19 22:06:11,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:11,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:06:11,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:06:11,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:06:11,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:06:11,282 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:06:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:11,381 INFO L93 Difference]: Finished difference Result 235 states and 311 transitions. [2024-11-19 22:06:11,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:06:11,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-19 22:06:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:11,392 INFO L225 Difference]: With dead ends: 235 [2024-11-19 22:06:11,394 INFO L226 Difference]: Without dead ends: 155 [2024-11-19 22:06:11,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:06:11,399 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 28 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:11,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 218 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:06:11,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-19 22:06:11,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-19 22:06:11,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 124 states have (on average 1.3225806451612903) internal successors, (164), 131 states have internal predecessors, (164), 16 states have call successors, (16), 16 states have call predecessors, (16), 14 states have return successors, (18), 14 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-19 22:06:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 198 transitions. [2024-11-19 22:06:11,432 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 198 transitions. Word has length 31 [2024-11-19 22:06:11,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:11,433 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 198 transitions. [2024-11-19 22:06:11,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:06:11,435 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2024-11-19 22:06:11,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 22:06:11,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:11,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:06:11,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:06:11,439 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:11,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:11,439 INFO L85 PathProgramCache]: Analyzing trace with hash 531580838, now seen corresponding path program 1 times [2024-11-19 22:06:11,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:06:11,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085055159] [2024-11-19 22:06:11,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:11,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:06:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:11,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 22:06:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:11,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:06:11,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085055159] [2024-11-19 22:06:11,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085055159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:11,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:11,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:06:11,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151020201] [2024-11-19 22:06:11,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:11,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:06:11,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:06:11,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:06:11,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:11,502 INFO L87 Difference]: Start difference. First operand 155 states and 198 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:06:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:11,533 INFO L93 Difference]: Finished difference Result 264 states and 341 transitions. [2024-11-19 22:06:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:06:11,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-11-19 22:06:11,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:11,535 INFO L225 Difference]: With dead ends: 264 [2024-11-19 22:06:11,535 INFO L226 Difference]: Without dead ends: 147 [2024-11-19 22:06:11,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:11,538 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:11,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 53 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:11,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-19 22:06:11,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-19 22:06:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 116 states have (on average 1.2758620689655173) internal successors, (148), 123 states have internal predecessors, (148), 16 states have call successors, (16), 16 states have call predecessors, (16), 14 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 22:06:11,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 180 transitions. [2024-11-19 22:06:11,559 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 180 transitions. Word has length 33 [2024-11-19 22:06:11,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:11,560 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 180 transitions. [2024-11-19 22:06:11,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:06:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 180 transitions. [2024-11-19 22:06:11,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 22:06:11,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:11,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:06:11,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:06:11,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:11,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:11,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1750273851, now seen corresponding path program 1 times [2024-11-19 22:06:11,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:06:11,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712184268] [2024-11-19 22:06:11,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:11,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:06:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:06:11,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 22:06:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:06:11,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 22:06:11,638 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 22:06:11,639 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 22:06:11,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:06:11,644 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-19 22:06:11,697 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 22:06:11,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:06:11 BoogieIcfgContainer [2024-11-19 22:06:11,706 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 22:06:11,707 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 22:06:11,707 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 22:06:11,707 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 22:06:11,707 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:06:10" (3/4) ... [2024-11-19 22:06:11,709 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 22:06:11,776 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 22:06:11,776 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 22:06:11,777 INFO L158 Benchmark]: Toolchain (without parser) took 2624.58ms. Allocated memory was 127.9MB in the beginning and 163.6MB in the end (delta: 35.7MB). Free memory was 58.4MB in the beginning and 55.4MB in the end (delta: 2.9MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2024-11-19 22:06:11,777 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 127.9MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:06:11,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.52ms. Allocated memory was 127.9MB in the beginning and 163.6MB in the end (delta: 35.7MB). Free memory was 58.2MB in the beginning and 120.4MB in the end (delta: -62.2MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-19 22:06:11,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.40ms. Allocated memory is still 163.6MB. Free memory was 120.4MB in the beginning and 118.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:06:11,778 INFO L158 Benchmark]: Boogie Preprocessor took 65.72ms. Allocated memory is still 163.6MB. Free memory was 118.3MB in the beginning and 116.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:06:11,779 INFO L158 Benchmark]: RCFGBuilder took 391.70ms. Allocated memory is still 163.6MB. Free memory was 116.2MB in the beginning and 100.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 22:06:11,779 INFO L158 Benchmark]: TraceAbstraction took 1500.58ms. Allocated memory is still 163.6MB. Free memory was 99.5MB in the beginning and 59.6MB in the end (delta: 39.8MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2024-11-19 22:06:11,779 INFO L158 Benchmark]: Witness Printer took 69.78ms. Allocated memory is still 163.6MB. Free memory was 59.6MB in the beginning and 55.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 22:06:11,781 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.30ms. Allocated memory is still 127.9MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 523.52ms. Allocated memory was 127.9MB in the beginning and 163.6MB in the end (delta: 35.7MB). Free memory was 58.2MB in the beginning and 120.4MB in the end (delta: -62.2MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.40ms. Allocated memory is still 163.6MB. Free memory was 120.4MB in the beginning and 118.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.72ms. Allocated memory is still 163.6MB. Free memory was 118.3MB in the beginning and 116.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 391.70ms. Allocated memory is still 163.6MB. Free memory was 116.2MB in the beginning and 100.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1500.58ms. Allocated memory is still 163.6MB. Free memory was 99.5MB in the beginning and 59.6MB in the end (delta: 39.8MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * Witness Printer took 69.78ms. Allocated memory is still 163.6MB. Free memory was 59.6MB in the beginning and 55.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] - GenericResultAtLocation [Line: 121]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] - GenericResultAtLocation [Line: 251]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [251] - GenericResultAtLocation [Line: 617]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [617] - GenericResultAtLocation [Line: 655]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [655] - GenericResultAtLocation [Line: 664]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [664] - GenericResultAtLocation [Line: 699]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [699] - GenericResultAtLocation [Line: 795]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [795] * 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 - CounterExampleResult [Line: 660]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L129] int pumpRunning = 0; [L130] int systemActive = 1; [L421] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L700] int cleanupTimeShifts = 4; [L796] int waterLevel = 1; [L797] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L773] int retValue_acc ; [L774] int tmp ; [L778] FCALL select_helpers() [L779] FCALL select_features() [L780] CALL, EXPR valid_product() [L647] int retValue_acc ; [L650] retValue_acc = 1 [L651] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L780] RET, EXPR valid_product() [L780] tmp = valid_product() [L782] COND TRUE \read(tmp) [L784] FCALL setup() [L785] CALL runTest() [L767] CALL test() [L56] int splverifierCounter ; [L57] int tmp ; [L58] int tmp___0 ; [L59] int tmp___1 ; [L60] int tmp___2 ; [L63] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L65] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L67] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L73] tmp = __VERIFIER_nondet_int() [L75] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L77] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L814] COND TRUE waterLevel < 2 [L815] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L77] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L110] CALL timeShift() VAL [\old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L137] COND FALSE !(\read(pumpRunning)) VAL [\old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L144] COND TRUE \read(systemActive) [L146] FCALL processEnvironment() [L152] CALL __utac_acc__Specification3_spec__1() [L667] int tmp ; [L668] int tmp___0 ; [L669] int tmp___1 ; VAL [\old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L673] CALL, EXPR isMethaneLevelCritical() VAL [\old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L835] int retValue_acc ; [L838] retValue_acc = methaneLevelCritical [L839] return (retValue_acc); VAL [\old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L673] RET, EXPR isMethaneLevelCritical() VAL [\old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L673] tmp = isMethaneLevelCritical() [L675] COND FALSE !(\read(tmp)) [L679] CALL, EXPR getWaterLevel() [L867] int retValue_acc ; [L870] retValue_acc = waterLevel [L871] return (retValue_acc); VAL [\old(waterLevel)=2, \result=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L679] RET, EXPR getWaterLevel() [L679] tmp___0 = getWaterLevel() [L681] COND TRUE tmp___0 == 2 [L683] CALL, EXPR isPumpRunning() [L192] int retValue_acc ; [L195] retValue_acc = pumpRunning [L196] return (retValue_acc); VAL [\old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L683] RET, EXPR isPumpRunning() [L683] tmp___1 = isPumpRunning() [L685] COND FALSE !(\read(tmp___1)) [L689] CALL __automaton_fail() [L660] reach_error() VAL [\old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 568 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 253 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 315 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=4, 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.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 258 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-19 22:06:11,800 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE