./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product53.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/product-lines/minepump_spec3_product53.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 e1c4d106eb612b91999bdca4bb49f57df1223b70f35ecd881d6daa6062cb1b0b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:53:53,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:53:53,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 07:53:53,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:53:53,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:53:53,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:53:53,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:53:53,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:53:53,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:53:53,584 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:53:53,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:53:53,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:53:53,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:53:53,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:53:53,588 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:53:53,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:53:53,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:53:53,589 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:53:53,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 07:53:53,590 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:53:53,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:53:53,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:53:53,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:53:53,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:53:53,595 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:53:53,595 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:53:53,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:53:53,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:53:53,596 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:53:53,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:53:53,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:53:53,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:53:53,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:53:53,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:53:53,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:53:53,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:53:53,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 07:53:53,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 07:53:53,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:53:53,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:53:53,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:53:53,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:53:53,600 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 -> e1c4d106eb612b91999bdca4bb49f57df1223b70f35ecd881d6daa6062cb1b0b [2024-11-16 07:53:53,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:53:53,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:53:53,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:53:53,910 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:53:53,911 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:53:53,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product53.cil.c [2024-11-16 07:53:55,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:53:55,700 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:53:55,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product53.cil.c [2024-11-16 07:53:55,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1554201f1/b2bf393be32340a6b4daad42c5c933df/FLAGdb4b2ab3f [2024-11-16 07:53:55,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1554201f1/b2bf393be32340a6b4daad42c5c933df [2024-11-16 07:53:55,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:53:55,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:53:55,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:53:55,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:53:55,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:53:55,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:53:55" (1/1) ... [2024-11-16 07:53:55,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea5ca62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:55, skipping insertion in model container [2024-11-16 07:53:55,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:53:55" (1/1) ... [2024-11-16 07:53:55,805 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:53:55,978 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_product53.cil.c[1605,1618] [2024-11-16 07:53:56,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:53:56,137 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:53:56,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2024-11-16 07:53:56,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [58] [2024-11-16 07:53:56,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [96] [2024-11-16 07:53:56,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [165] [2024-11-16 07:53:56,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [398] [2024-11-16 07:53:56,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [502] [2024-11-16 07:53:56,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [536] [2024-11-16 07:53:56,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [902] [2024-11-16 07:53:56,158 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_product53.cil.c[1605,1618] [2024-11-16 07:53:56,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:53:56,257 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:53:56,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:56 WrapperNode [2024-11-16 07:53:56,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:53:56,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:53:56,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:53:56,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:53:56,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:56" (1/1) ... [2024-11-16 07:53:56,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:56" (1/1) ... [2024-11-16 07:53:56,311 INFO L138 Inliner]: procedures = 56, calls = 103, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 227 [2024-11-16 07:53:56,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:53:56,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:53:56,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:53:56,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:53:56,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:56" (1/1) ... [2024-11-16 07:53:56,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:56" (1/1) ... [2024-11-16 07:53:56,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:56" (1/1) ... [2024-11-16 07:53:56,356 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-16 07:53:56,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:56" (1/1) ... [2024-11-16 07:53:56,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:56" (1/1) ... [2024-11-16 07:53:56,368 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:56" (1/1) ... [2024-11-16 07:53:56,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:56" (1/1) ... [2024-11-16 07:53:56,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:56" (1/1) ... [2024-11-16 07:53:56,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:56" (1/1) ... [2024-11-16 07:53:56,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:53:56,381 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:53:56,381 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:53:56,381 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:53:56,382 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:56" (1/1) ... [2024-11-16 07:53:56,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:53:56,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:53:56,429 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-16 07:53:56,433 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-16 07:53:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:53:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-16 07:53:56,487 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-16 07:53:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-16 07:53:56,487 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-16 07:53:56,487 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-16 07:53:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-16 07:53:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-16 07:53:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-16 07:53:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-16 07:53:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-16 07:53:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-16 07:53:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-16 07:53:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__lowWaterSensor [2024-11-16 07:53:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__lowWaterSensor [2024-11-16 07:53:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-16 07:53:56,490 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-16 07:53:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 07:53:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-16 07:53:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-16 07:53:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:53:56,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:53:56,590 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:53:56,593 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:53:56,657 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L444: #res := ~retValue_acc~6; [2024-11-16 07:53:56,757 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L312-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~2#1; [2024-11-16 07:53:56,757 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L321-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~3#1; [2024-11-16 07:53:56,757 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L476-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; [2024-11-16 07:53:56,850 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L93-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2024-11-16 07:53:56,850 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-1: main_#res#1 := main_~retValue_acc~13#1; [2024-11-16 07:53:56,890 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L376-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~4#1; [2024-11-16 07:53:56,890 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L490-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~8#1; [2024-11-16 07:53:56,925 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L499-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~9#1; [2024-11-16 07:53:56,926 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L395-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~5#1; [2024-11-16 07:53:56,951 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-16 07:53:56,951 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:53:56,968 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:53:56,968 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:53:56,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:53:56 BoogieIcfgContainer [2024-11-16 07:53:56,968 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:53:56,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:53:56,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:53:56,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:53:56,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:53:55" (1/3) ... [2024-11-16 07:53:56,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b995e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:53:56, skipping insertion in model container [2024-11-16 07:53:56,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:56" (2/3) ... [2024-11-16 07:53:56,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b995e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:53:56, skipping insertion in model container [2024-11-16 07:53:56,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:53:56" (3/3) ... [2024-11-16 07:53:56,995 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product53.cil.c [2024-11-16 07:53:57,012 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:53:57,012 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:53:57,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:53:57,097 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;@5333e0d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:53:57,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:53:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 91 states have internal predecessors, (110), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 07:53:57,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-16 07:53:57,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:57,110 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] [2024-11-16 07:53:57,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:57,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:57,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1792594779, now seen corresponding path program 1 times [2024-11-16 07:53:57,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:53:57,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768152136] [2024-11-16 07:53:57,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:57,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:53:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:57,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 07:53:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:57,346 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-16 07:53:57,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:53:57,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768152136] [2024-11-16 07:53:57,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768152136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:57,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:57,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 07:53:57,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122635415] [2024-11-16 07:53:57,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:57,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 07:53:57,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:53:57,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 07:53:57,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 07:53:57,381 INFO L87 Difference]: Start difference. First operand has 108 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 91 states have internal predecessors, (110), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-16 07:53:57,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:57,430 INFO L93 Difference]: Finished difference Result 207 states and 278 transitions. [2024-11-16 07:53:57,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 07:53:57,434 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 27 [2024-11-16 07:53:57,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:57,445 INFO L225 Difference]: With dead ends: 207 [2024-11-16 07:53:57,446 INFO L226 Difference]: Without dead ends: 97 [2024-11-16 07:53:57,452 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-16 07:53:57,456 INFO L432 NwaCegarLoop]: 135 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, 135 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-16 07:53:57,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:57,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-16 07:53:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-16 07:53:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 81 states have internal predecessors, (94), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 07:53:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2024-11-16 07:53:57,515 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 27 [2024-11-16 07:53:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:57,520 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2024-11-16 07:53:57,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-16 07:53:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2024-11-16 07:53:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-16 07:53:57,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:57,526 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-16 07:53:57,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 07:53:57,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:57,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:57,527 INFO L85 PathProgramCache]: Analyzing trace with hash -368065782, now seen corresponding path program 1 times [2024-11-16 07:53:57,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:53:57,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244416031] [2024-11-16 07:53:57,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:57,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:53:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:57,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:53:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:57,700 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-16 07:53:57,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:53:57,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244416031] [2024-11-16 07:53:57,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244416031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:57,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:57,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:53:57,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728082324] [2024-11-16 07:53:57,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:57,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:53:57,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:53:57,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:53:57,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:53:57,708 INFO L87 Difference]: Start difference. First operand 97 states and 125 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-16 07:53:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:57,735 INFO L93 Difference]: Finished difference Result 157 states and 203 transitions. [2024-11-16 07:53:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:53:57,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 30 [2024-11-16 07:53:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:57,737 INFO L225 Difference]: With dead ends: 157 [2024-11-16 07:53:57,737 INFO L226 Difference]: Without dead ends: 86 [2024-11-16 07:53:57,738 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-16 07:53:57,740 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 11 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 203 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-16 07:53:57,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 203 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:57,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-16 07:53:57,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-16 07:53:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.328125) internal successors, (85), 73 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-16 07:53:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2024-11-16 07:53:57,754 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 30 [2024-11-16 07:53:57,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:57,754 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2024-11-16 07:53:57,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-16 07:53:57,755 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2024-11-16 07:53:57,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-16 07:53:57,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:57,757 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] [2024-11-16 07:53:57,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 07:53:57,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:57,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:57,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1302173799, now seen corresponding path program 1 times [2024-11-16 07:53:57,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:53:57,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659708506] [2024-11-16 07:53:57,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:57,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:53:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:57,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:53:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:57,888 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-16 07:53:57,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:53:57,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659708506] [2024-11-16 07:53:57,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659708506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:57,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:57,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:53:57,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115372552] [2024-11-16 07:53:57,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:57,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:53:57,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:53:57,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:53:57,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:53:57,895 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-16 07:53:57,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:57,926 INFO L93 Difference]: Finished difference Result 165 states and 216 transitions. [2024-11-16 07:53:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:53:57,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2024-11-16 07:53:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:57,929 INFO L225 Difference]: With dead ends: 165 [2024-11-16 07:53:57,929 INFO L226 Difference]: Without dead ends: 86 [2024-11-16 07:53:57,930 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-16 07:53:57,934 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 109 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-16 07:53:57,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 109 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-16 07:53:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-16 07:53:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.3125) internal successors, (84), 73 states have internal predecessors, (84), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-16 07:53:57,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2024-11-16 07:53:57,950 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 32 [2024-11-16 07:53:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:57,951 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2024-11-16 07:53:57,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-16 07:53:57,951 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2024-11-16 07:53:57,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-16 07:53:57,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:57,953 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:53:57,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 07:53:57,954 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:57,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:57,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1954983221, now seen corresponding path program 1 times [2024-11-16 07:53:57,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:53:57,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944100680] [2024-11-16 07:53:57,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:57,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:53:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:58,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:53:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:58,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 07:53:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:58,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 07:53:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 07:53:58,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:53:58,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944100680] [2024-11-16 07:53:58,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944100680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:58,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:58,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 07:53:58,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526451961] [2024-11-16 07:53:58,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:58,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 07:53:58,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:53:58,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 07:53:58,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 07:53:58,066 INFO L87 Difference]: Start difference. First operand 86 states and 110 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 07:53:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:58,288 INFO L93 Difference]: Finished difference Result 251 states and 325 transitions. [2024-11-16 07:53:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:53:58,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-11-16 07:53:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:58,291 INFO L225 Difference]: With dead ends: 251 [2024-11-16 07:53:58,291 INFO L226 Difference]: Without dead ends: 172 [2024-11-16 07:53:58,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:53:58,299 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 158 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:58,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 228 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:53:58,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-16 07:53:58,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 163. [2024-11-16 07:53:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 123 states have (on average 1.2845528455284554) internal successors, (158), 131 states have internal predecessors, (158), 19 states have call successors, (19), 15 states have call predecessors, (19), 20 states have return successors, (30), 21 states have call predecessors, (30), 19 states have call successors, (30) [2024-11-16 07:53:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 207 transitions. [2024-11-16 07:53:58,323 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 207 transitions. Word has length 45 [2024-11-16 07:53:58,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:58,323 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 207 transitions. [2024-11-16 07:53:58,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 07:53:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 207 transitions. [2024-11-16 07:53:58,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 07:53:58,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:58,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:58,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 07:53:58,325 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:58,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:58,326 INFO L85 PathProgramCache]: Analyzing trace with hash -833439663, now seen corresponding path program 1 times [2024-11-16 07:53:58,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:53:58,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751200040] [2024-11-16 07:53:58,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:58,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:53:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:58,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:53:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:58,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:53:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:58,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 07:53:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:58,576 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-16 07:53:58,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:53:58,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751200040] [2024-11-16 07:53:58,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751200040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:58,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:58,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:53:58,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095267686] [2024-11-16 07:53:58,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:58,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:53:58,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:53:58,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:53:58,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:53:58,581 INFO L87 Difference]: Start difference. First operand 163 states and 207 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:53:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:58,776 INFO L93 Difference]: Finished difference Result 325 states and 419 transitions. [2024-11-16 07:53:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 07:53:58,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-16 07:53:58,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:58,783 INFO L225 Difference]: With dead ends: 325 [2024-11-16 07:53:58,783 INFO L226 Difference]: Without dead ends: 169 [2024-11-16 07:53:58,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 07:53:58,785 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 62 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:58,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 438 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:53:58,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-16 07:53:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2024-11-16 07:53:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 126 states have (on average 1.2777777777777777) internal successors, (161), 134 states have internal predecessors, (161), 19 states have call successors, (19), 15 states have call predecessors, (19), 20 states have return successors, (30), 21 states have call predecessors, (30), 19 states have call successors, (30) [2024-11-16 07:53:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 210 transitions. [2024-11-16 07:53:58,824 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 210 transitions. Word has length 51 [2024-11-16 07:53:58,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:58,826 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 210 transitions. [2024-11-16 07:53:58,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:53:58,827 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 210 transitions. [2024-11-16 07:53:58,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 07:53:58,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:58,828 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:58,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 07:53:58,832 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:58,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:58,832 INFO L85 PathProgramCache]: Analyzing trace with hash 411324818, now seen corresponding path program 1 times [2024-11-16 07:53:58,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:53:58,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118356835] [2024-11-16 07:53:58,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:58,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:53:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:58,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:53:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:58,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:53:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:58,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 07:53:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:58,983 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-16 07:53:58,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:53:58,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118356835] [2024-11-16 07:53:58,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118356835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:58,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:58,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:53:58,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99075171] [2024-11-16 07:53:58,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:58,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:53:58,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:53:58,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:53:58,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:53:58,987 INFO L87 Difference]: Start difference. First operand 166 states and 210 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:53:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:59,151 INFO L93 Difference]: Finished difference Result 330 states and 430 transitions. [2024-11-16 07:53:59,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:53:59,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-16 07:53:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:59,153 INFO L225 Difference]: With dead ends: 330 [2024-11-16 07:53:59,154 INFO L226 Difference]: Without dead ends: 171 [2024-11-16 07:53:59,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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-16 07:53:59,156 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 61 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:59,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 341 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:53:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-16 07:53:59,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2024-11-16 07:53:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 128 states have (on average 1.2734375) internal successors, (163), 136 states have internal predecessors, (163), 19 states have call successors, (19), 15 states have call predecessors, (19), 20 states have return successors, (30), 21 states have call predecessors, (30), 19 states have call successors, (30) [2024-11-16 07:53:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 212 transitions. [2024-11-16 07:53:59,186 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 212 transitions. Word has length 51 [2024-11-16 07:53:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:59,186 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 212 transitions. [2024-11-16 07:53:59,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:53:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 212 transitions. [2024-11-16 07:53:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 07:53:59,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:59,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:59,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 07:53:59,189 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:59,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:59,190 INFO L85 PathProgramCache]: Analyzing trace with hash 551873428, now seen corresponding path program 1 times [2024-11-16 07:53:59,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:53:59,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375022928] [2024-11-16 07:53:59,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:59,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:53:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:59,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:53:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:59,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:53:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:59,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 07:53:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:59,319 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-16 07:53:59,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:53:59,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375022928] [2024-11-16 07:53:59,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375022928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:59,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:59,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:53:59,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739451077] [2024-11-16 07:53:59,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:59,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:53:59,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:53:59,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:53:59,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:53:59,321 INFO L87 Difference]: Start difference. First operand 168 states and 212 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 07:53:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:59,620 INFO L93 Difference]: Finished difference Result 473 states and 617 transitions. [2024-11-16 07:53:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:53:59,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2024-11-16 07:53:59,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:59,623 INFO L225 Difference]: With dead ends: 473 [2024-11-16 07:53:59,623 INFO L226 Difference]: Without dead ends: 312 [2024-11-16 07:53:59,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:53:59,628 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 233 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:59,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 343 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:53:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-16 07:53:59,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 300. [2024-11-16 07:53:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 227 states have (on average 1.251101321585903) internal successors, (284), 239 states have internal predecessors, (284), 36 states have call successors, (36), 33 states have call predecessors, (36), 36 states have return successors, (62), 37 states have call predecessors, (62), 36 states have call successors, (62) [2024-11-16 07:53:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 382 transitions. [2024-11-16 07:53:59,670 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 382 transitions. Word has length 51 [2024-11-16 07:53:59,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:59,671 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 382 transitions. [2024-11-16 07:53:59,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 07:53:59,671 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 382 transitions. [2024-11-16 07:53:59,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-16 07:53:59,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:59,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:59,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 07:53:59,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:59,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:59,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1803956690, now seen corresponding path program 1 times [2024-11-16 07:53:59,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:53:59,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063592544] [2024-11-16 07:53:59,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:59,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:53:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:59,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:53:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:59,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:53:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:59,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:53:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:59,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 07:53:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:59,809 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-16 07:53:59,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:53:59,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063592544] [2024-11-16 07:53:59,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063592544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:59,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:59,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:53:59,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366982199] [2024-11-16 07:53:59,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:59,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:53:59,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:53:59,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:53:59,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:53:59,812 INFO L87 Difference]: Start difference. First operand 300 states and 382 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 07:54:00,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:54:00,050 INFO L93 Difference]: Finished difference Result 594 states and 757 transitions. [2024-11-16 07:54:00,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:54:00,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2024-11-16 07:54:00,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:54:00,053 INFO L225 Difference]: With dead ends: 594 [2024-11-16 07:54:00,054 INFO L226 Difference]: Without dead ends: 301 [2024-11-16 07:54:00,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-16 07:54:00,055 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 121 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:54:00,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 379 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:54:00,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-16 07:54:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 298. [2024-11-16 07:54:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 225 states have (on average 1.2444444444444445) internal successors, (280), 237 states have internal predecessors, (280), 36 states have call successors, (36), 33 states have call predecessors, (36), 36 states have return successors, (62), 37 states have call predecessors, (62), 36 states have call successors, (62) [2024-11-16 07:54:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 378 transitions. [2024-11-16 07:54:00,081 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 378 transitions. Word has length 53 [2024-11-16 07:54:00,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:54:00,081 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 378 transitions. [2024-11-16 07:54:00,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 07:54:00,081 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 378 transitions. [2024-11-16 07:54:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-16 07:54:00,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:54:00,082 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:54:00,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 07:54:00,083 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:54:00,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:54:00,083 INFO L85 PathProgramCache]: Analyzing trace with hash 969717238, now seen corresponding path program 1 times [2024-11-16 07:54:00,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:54:00,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163554411] [2024-11-16 07:54:00,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:00,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:54:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:00,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:54:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:00,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 07:54:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:00,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:54:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:00,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 07:54:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:00,192 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-16 07:54:00,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:54:00,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163554411] [2024-11-16 07:54:00,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163554411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:54:00,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:54:00,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 07:54:00,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201943349] [2024-11-16 07:54:00,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:54:00,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 07:54:00,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:54:00,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 07:54:00,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 07:54:00,194 INFO L87 Difference]: Start difference. First operand 298 states and 378 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-16 07:54:00,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:54:00,756 INFO L93 Difference]: Finished difference Result 578 states and 745 transitions. [2024-11-16 07:54:00,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 07:54:00,757 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2024-11-16 07:54:00,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:54:00,760 INFO L225 Difference]: With dead ends: 578 [2024-11-16 07:54:00,761 INFO L226 Difference]: Without dead ends: 339 [2024-11-16 07:54:00,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2024-11-16 07:54:00,764 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 338 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 07:54:00,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 477 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 07:54:00,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-16 07:54:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 333. [2024-11-16 07:54:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 252 states have (on average 1.2142857142857142) internal successors, (306), 267 states have internal predecessors, (306), 41 states have call successors, (41), 33 states have call predecessors, (41), 39 states have return successors, (58), 42 states have call predecessors, (58), 41 states have call successors, (58) [2024-11-16 07:54:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 405 transitions. [2024-11-16 07:54:00,799 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 405 transitions. Word has length 55 [2024-11-16 07:54:00,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:54:00,800 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 405 transitions. [2024-11-16 07:54:00,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-16 07:54:00,800 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 405 transitions. [2024-11-16 07:54:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 07:54:00,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:54:00,801 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:54:00,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 07:54:00,801 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:54:00,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:54:00,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1548160310, now seen corresponding path program 1 times [2024-11-16 07:54:00,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:54:00,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726554605] [2024-11-16 07:54:00,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:00,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:54:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:00,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:54:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:00,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 07:54:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:00,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:54:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:00,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:54:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:00,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 07:54:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:00,901 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-16 07:54:00,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:54:00,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726554605] [2024-11-16 07:54:00,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726554605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:54:00,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:54:00,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:54:00,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989577020] [2024-11-16 07:54:00,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:54:00,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:54:00,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:54:00,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:54:00,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:54:00,903 INFO L87 Difference]: Start difference. First operand 333 states and 405 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 07:54:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:54:01,159 INFO L93 Difference]: Finished difference Result 608 states and 750 transitions. [2024-11-16 07:54:01,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:54:01,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-16 07:54:01,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:54:01,162 INFO L225 Difference]: With dead ends: 608 [2024-11-16 07:54:01,162 INFO L226 Difference]: Without dead ends: 336 [2024-11-16 07:54:01,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-16 07:54:01,164 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 147 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:54:01,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 270 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:54:01,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-16 07:54:01,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 330. [2024-11-16 07:54:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 249 states have (on average 1.21285140562249) internal successors, (302), 264 states have internal predecessors, (302), 41 states have call successors, (41), 33 states have call predecessors, (41), 39 states have return successors, (58), 42 states have call predecessors, (58), 41 states have call successors, (58) [2024-11-16 07:54:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 401 transitions. [2024-11-16 07:54:01,188 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 401 transitions. Word has length 57 [2024-11-16 07:54:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:54:01,188 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 401 transitions. [2024-11-16 07:54:01,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 07:54:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 401 transitions. [2024-11-16 07:54:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 07:54:01,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:54:01,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:54:01,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 07:54:01,190 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:54:01,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:54:01,190 INFO L85 PathProgramCache]: Analyzing trace with hash -529049033, now seen corresponding path program 1 times [2024-11-16 07:54:01,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:54:01,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368087633] [2024-11-16 07:54:01,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:01,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:54:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:01,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:54:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:01,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 07:54:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:01,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:54:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:01,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:54:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:01,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 07:54:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:01,303 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-16 07:54:01,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:54:01,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368087633] [2024-11-16 07:54:01,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368087633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:54:01,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:54:01,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 07:54:01,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297143873] [2024-11-16 07:54:01,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:54:01,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 07:54:01,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:54:01,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 07:54:01,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:54:01,305 INFO L87 Difference]: Start difference. First operand 330 states and 401 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 07:54:01,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:54:01,624 INFO L93 Difference]: Finished difference Result 576 states and 708 transitions. [2024-11-16 07:54:01,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 07:54:01,624 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-16 07:54:01,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:54:01,627 INFO L225 Difference]: With dead ends: 576 [2024-11-16 07:54:01,628 INFO L226 Difference]: Without dead ends: 307 [2024-11-16 07:54:01,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-16 07:54:01,630 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 144 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:54:01,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 350 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:54:01,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-16 07:54:01,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2024-11-16 07:54:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 228 states have (on average 1.2105263157894737) internal successors, (276), 242 states have internal predecessors, (276), 38 states have call successors, (38), 30 states have call predecessors, (38), 34 states have return successors, (49), 37 states have call predecessors, (49), 38 states have call successors, (49) [2024-11-16 07:54:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 363 transitions. [2024-11-16 07:54:01,657 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 363 transitions. Word has length 57 [2024-11-16 07:54:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:54:01,657 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 363 transitions. [2024-11-16 07:54:01,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 07:54:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 363 transitions. [2024-11-16 07:54:01,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-16 07:54:01,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:54:01,659 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:54:01,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 07:54:01,659 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:54:01,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:54:01,659 INFO L85 PathProgramCache]: Analyzing trace with hash 501913943, now seen corresponding path program 1 times [2024-11-16 07:54:01,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:54:01,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735039281] [2024-11-16 07:54:01,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:01,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:54:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:01,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:54:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:01,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:54:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:01,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:54:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:01,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:54:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:01,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 07:54:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:01,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 07:54:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:01,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 07:54:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:01,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 07:54:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 07:54:01,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:54:01,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735039281] [2024-11-16 07:54:01,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735039281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:54:01,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227984746] [2024-11-16 07:54:01,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:01,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:54:01,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:54:01,890 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:54:01,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 07:54:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:01,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 07:54:02,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:54:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-16 07:54:02,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:54:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 07:54:02,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227984746] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:54:02,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:54:02,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 20 [2024-11-16 07:54:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938342523] [2024-11-16 07:54:02,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:54:02,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-16 07:54:02,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:54:02,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-16 07:54:02,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-16 07:54:02,650 INFO L87 Difference]: Start difference. First operand 301 states and 363 transitions. Second operand has 20 states, 20 states have (on average 6.85) internal successors, (137), 14 states have internal predecessors, (137), 6 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (22), 8 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-16 07:54:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:54:04,391 INFO L93 Difference]: Finished difference Result 907 states and 1181 transitions. [2024-11-16 07:54:04,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-16 07:54:04,392 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.85) internal successors, (137), 14 states have internal predecessors, (137), 6 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (22), 8 states have call predecessors, (22), 6 states have call successors, (22) Word has length 92 [2024-11-16 07:54:04,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:54:04,393 INFO L225 Difference]: With dead ends: 907 [2024-11-16 07:54:04,393 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 07:54:04,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 195 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=892, Invalid=3664, Unknown=0, NotChecked=0, Total=4556 [2024-11-16 07:54:04,397 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 577 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 07:54:04,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 752 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 07:54:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 07:54:04,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 07:54:04,398 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-16 07:54:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 07:54:04,399 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2024-11-16 07:54:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:54:04,399 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 07:54:04,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.85) internal successors, (137), 14 states have internal predecessors, (137), 6 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (22), 8 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-16 07:54:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 07:54:04,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 07:54:04,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 07:54:04,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 07:54:04,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-16 07:54:04,609 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:54:04,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 07:54:07,570 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 07:54:07,582 WARN L156 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (<= ~waterLevel~0 1) (= 1 ~systemActive~0) (<= 1 |old(~pumpRunning~0)|)) Eliminated clause: (and (<= 1 ~pumpRunning~0) (<= ~waterLevel~0 1) (= 1 ~systemActive~0)) [2024-11-16 07:54:07,599 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (and (or (= |old(~methaneLevelCritical~0)| 0) (not (= ~methaneLevelCritical~0 0))) (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (<= ~waterLevel~0 2))) (or (and (= ~pumpRunning~0 0) .cse0 .cse1) (and (<= 1 ~pumpRunning~0) .cse0 .cse1)))) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (<= ~waterLevel~0 2))) (or (and (= ~pumpRunning~0 0) .cse0 .cse1) (and (<= 1 ~pumpRunning~0) .cse0 .cse1))) [2024-11-16 07:54:07,609 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (<= |old(~waterLevel~0)| 2))) (or (and .cse0 .cse1 (<= 1 |old(~pumpRunning~0)|)) (and .cse0 (= |old(~pumpRunning~0)| 0) .cse1)))) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (<= ~waterLevel~0 2))) (or (and (= ~pumpRunning~0 0) .cse0 .cse1) (and (<= 1 ~pumpRunning~0) .cse0 .cse1))) [2024-11-16 07:54:07,623 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (= |old(~pumpRunning~0)| 0) (<= ~waterLevel~0 2)) (and (<= ~waterLevel~0 1) .cse0 (<= 1 |old(~pumpRunning~0)|))))) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~pumpRunning~0 0) .cse0 (<= ~waterLevel~0 2)) (and (<= 1 ~pumpRunning~0) (<= ~waterLevel~0 1) .cse0))) [2024-11-16 07:54:07,631 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse0 (= 1 ~systemActive~0))) (or (and (<= 1 ~pumpRunning~0) .cse0 (<= |old(~waterLevel~0)| 2)) (and (= ~pumpRunning~0 0) .cse0 (<= |old(~waterLevel~0)| 1)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and (<= 1 ~pumpRunning~0) .cse0 (<= ~waterLevel~0 2)) (and (= ~pumpRunning~0 0) (<= ~waterLevel~0 1) .cse0))) [2024-11-16 07:54:07,639 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__lowWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (= |old(~pumpRunning~0)| 0) (<= ~waterLevel~0 2)) (and (<= ~waterLevel~0 1) .cse0 (<= 1 |old(~pumpRunning~0)|))))) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~pumpRunning~0 0) .cse0 (<= ~waterLevel~0 2)) (and (<= 1 ~pumpRunning~0) (<= ~waterLevel~0 1) .cse0))) [2024-11-16 07:54:07,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:54:07 BoogieIcfgContainer [2024-11-16 07:54:07,648 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 07:54:07,648 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 07:54:07,649 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 07:54:07,649 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 07:54:07,649 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:53:56" (3/4) ... [2024-11-16 07:54:07,652 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 07:54:07,655 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-11-16 07:54:07,656 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-16 07:54:07,656 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-16 07:54:07,656 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-11-16 07:54:07,656 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-16 07:54:07,656 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-16 07:54:07,656 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-11-16 07:54:07,656 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-16 07:54:07,656 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__lowWaterSensor [2024-11-16 07:54:07,664 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2024-11-16 07:54:07,664 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-16 07:54:07,664 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-16 07:54:07,665 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 07:54:07,665 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 07:54:07,791 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 07:54:07,791 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 07:54:07,791 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 07:54:07,792 INFO L158 Benchmark]: Toolchain (without parser) took 12052.92ms. Allocated memory was 142.6MB in the beginning and 230.7MB in the end (delta: 88.1MB). Free memory was 86.2MB in the beginning and 90.6MB in the end (delta: -4.4MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. [2024-11-16 07:54:07,792 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 142.6MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:54:07,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.03ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 64.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 07:54:07,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.70ms. Allocated memory is still 142.6MB. Free memory was 64.2MB in the beginning and 62.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:54:07,793 INFO L158 Benchmark]: Boogie Preprocessor took 68.10ms. Allocated memory is still 142.6MB. Free memory was 62.1MB in the beginning and 60.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:54:07,793 INFO L158 Benchmark]: IcfgBuilder took 587.49ms. Allocated memory is still 142.6MB. Free memory was 60.0MB in the beginning and 38.6MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 07:54:07,794 INFO L158 Benchmark]: TraceAbstraction took 10662.38ms. Allocated memory was 142.6MB in the beginning and 230.7MB in the end (delta: 88.1MB). Free memory was 112.5MB in the beginning and 99.0MB in the end (delta: 13.5MB). Peak memory consumption was 137.6MB. Max. memory is 16.1GB. [2024-11-16 07:54:07,794 INFO L158 Benchmark]: Witness Printer took 142.84ms. Allocated memory is still 230.7MB. Free memory was 99.0MB in the beginning and 90.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 07:54:07,795 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 142.6MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.03ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 64.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.70ms. Allocated memory is still 142.6MB. Free memory was 64.2MB in the beginning and 62.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.10ms. Allocated memory is still 142.6MB. Free memory was 62.1MB in the beginning and 60.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 587.49ms. Allocated memory is still 142.6MB. Free memory was 60.0MB in the beginning and 38.6MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10662.38ms. Allocated memory was 142.6MB in the beginning and 230.7MB in the end (delta: 88.1MB). Free memory was 112.5MB in the beginning and 99.0MB in the end (delta: 13.5MB). Peak memory consumption was 137.6MB. Max. memory is 16.1GB. * Witness Printer took 142.84ms. Allocated memory is still 230.7MB. Free memory was 99.0MB in the beginning and 90.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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,"wsllib_check.i","") [49] - GenericResultAtLocation [Line: 58]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [58] - GenericResultAtLocation [Line: 96]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [96] - GenericResultAtLocation [Line: 165]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [165] - GenericResultAtLocation [Line: 398]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [398] - GenericResultAtLocation [Line: 502]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [502] - GenericResultAtLocation [Line: 536]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [536] - GenericResultAtLocation [Line: 902]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [902] * 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: 54]: 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 10 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1985 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1944 mSDsluCounter, 4025 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2820 mSDsCounter, 612 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2877 IncrementalHoareTripleChecker+Invalid, 3489 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 612 mSolverCounterUnsat, 1205 mSDtfsCounter, 2877 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 429 GetRequests, 290 SyntacticMatches, 8 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=9, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 48 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 693 NumberOfCodeBlocks, 693 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 771 ConstructedInterpolants, 0 QuantifiedInterpolants, 1544 SizeOfPredicates, 2 NumberOfNonLiveVariables, 300 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 61/84 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: 111]: Location Invariant Derived location invariant: null - InvariantResult [Line: 914]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 296]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: (((1 <= pumpRunning) && (waterLevel <= 1)) && (1 == systemActive)) Ensures: (((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= \old(pumpRunning))) && (((((systemActive == \old(systemActive)) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 203]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 == systemActive)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) Ensures: (((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 == systemActive)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 426]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || (((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2))) Ensures: (((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || (((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2))) && (((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (head == \old(head))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 438]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) Ensures: (((\result == methaneLevelCritical) && ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 904]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((systemActive == \old(systemActive)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 179]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || (((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2))) Ensures: ((((((((((pumpRunning == \old(pumpRunning)) && (waterLevel <= 1)) && (1 == systemActive)) && (waterLevel <= \old(waterLevel))) || (\old(pumpRunning) < 1)) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (waterLevel <= \old(waterLevel)))) && (((((1 <= pumpRunning) && (2 == waterLevel)) && (\old(waterLevel) == 2)) || (\old(pumpRunning) != 0)) || ((pumpRunning == 0) && (\old(waterLevel) == waterLevel)))) && (((((1 <= pumpRunning) && (2 == waterLevel)) && (\old(waterLevel) == 2)) || (\old(pumpRunning) != 0)) || (\old(waterLevel) < 2))) && (((1 == systemActive) && (\old(pumpRunning) == 0)) || ((\old(waterLevel) <= 2) && (1 <= \old(pumpRunning))))) && ((((systemActive == \old(systemActive)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 211]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || (((1 <= pumpRunning) && (waterLevel <= 1)) && (1 == systemActive))) Ensures: (((((((\old(pumpRunning) != 0) || (pumpRunning == 0)) || ((1 <= pumpRunning) && (2 == waterLevel))) && ((pumpRunning == \old(pumpRunning)) || (\old(pumpRunning) < 1))) && (((1 == systemActive) && (\old(pumpRunning) == 0)) || (((waterLevel <= 1) && (1 == systemActive)) && (1 <= \old(pumpRunning))))) && (((1 <= pumpRunning) && (2 == waterLevel)) || (waterLevel < 2))) && (((((systemActive == \old(systemActive)) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 414]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) Ensures: (((((((pumpRunning != 0) || (2 == waterLevel)) || (\old(waterLevel) != 1)) && ((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel))) && (waterLevel <= ((long long) \old(waterLevel) + 1))) && ((((1 <= pumpRunning) && (1 == systemActive)) && (\old(waterLevel) <= 2)) || (((pumpRunning == 0) && (1 == systemActive)) && (\old(waterLevel) <= 1)))) && (((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 237]: Procedure Contract for processEnvironment__wrappee__lowWaterSensor Derived contract for procedure processEnvironment__wrappee__lowWaterSensor. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || (((1 <= pumpRunning) && (waterLevel <= 1)) && (1 == systemActive))) Ensures: (((((((\old(pumpRunning) != 0) || (pumpRunning == 0)) || ((1 <= pumpRunning) && (2 == waterLevel))) && (((1 == systemActive) && (\old(pumpRunning) == 0)) || (((waterLevel <= 1) && (1 == systemActive)) && (1 <= \old(pumpRunning))))) && (((1 <= pumpRunning) && (2 == waterLevel)) || (waterLevel < 2))) && (((pumpRunning == \old(pumpRunning)) || (pumpRunning == 0)) || (\old(pumpRunning) < 1))) && (((((systemActive == \old(systemActive)) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) RESULT: Ultimate proved your program to be correct! [2024-11-16 07:54:07,830 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