./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product62.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_spec5_product62.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 34b47c00ac265c7154b048b065075686f0b0d02157935b615817b802464c404c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:55:56,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:55:56,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 07:55:56,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:55:56,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:55:56,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:55:56,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:55:56,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:55:56,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:55:56,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:55:56,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:55:56,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:55:56,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:55:56,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:55:56,542 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:55:56,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:55:56,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:55:56,543 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:55:56,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 07:55:56,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:55:56,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:55:56,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:55:56,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:55:56,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:55:56,546 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:55:56,547 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:55:56,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:55:56,549 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:55:56,550 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:55:56,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:55:56,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:55:56,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:55:56,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:55:56,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:55:56,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:55:56,551 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:55:56,551 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 07:55:56,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 07:55:56,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:55:56,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:55:56,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:55:56,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:55:56,553 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 -> 34b47c00ac265c7154b048b065075686f0b0d02157935b615817b802464c404c [2024-11-16 07:55:56,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:55:56,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:55:56,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:55:56,808 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:55:56,809 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:55:56,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product62.cil.c [2024-11-16 07:55:58,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:55:58,326 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:55:58,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product62.cil.c [2024-11-16 07:55:58,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f4e41d69/11bf028bd7144874ba207aae6f42033d/FLAG5ed3751c4 [2024-11-16 07:55:58,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f4e41d69/11bf028bd7144874ba207aae6f42033d [2024-11-16 07:55:58,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:55:58,352 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:55:58,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:55:58,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:55:58,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:55:58,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:55:58" (1/1) ... [2024-11-16 07:55:58,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55765a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:58, skipping insertion in model container [2024-11-16 07:55:58,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:55:58" (1/1) ... [2024-11-16 07:55:58,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:55:58,676 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_spec5_product62.cil.c[19180,19193] [2024-11-16 07:55:58,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:55:58,695 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:55:58,703 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [49] [2024-11-16 07:55:58,704 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [313] [2024-11-16 07:55:58,705 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [364] [2024-11-16 07:55:58,705 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [434] [2024-11-16 07:55:58,705 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [800] [2024-11-16 07:55:58,705 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [903] [2024-11-16 07:55:58,705 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1003] [2024-11-16 07:55:58,705 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1012] [2024-11-16 07:55:58,756 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_spec5_product62.cil.c[19180,19193] [2024-11-16 07:55:58,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:55:58,775 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:55:58,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:58 WrapperNode [2024-11-16 07:55:58,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:55:58,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:55:58,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:55:58,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:55:58,782 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:55:58" (1/1) ... [2024-11-16 07:55:58,792 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:55:58" (1/1) ... [2024-11-16 07:55:58,810 INFO L138 Inliner]: procedures = 60, calls = 108, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 243 [2024-11-16 07:55:58,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:55:58,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:55:58,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:55:58,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:55:58,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:58" (1/1) ... [2024-11-16 07:55:58,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:58" (1/1) ... [2024-11-16 07:55:58,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:58" (1/1) ... [2024-11-16 07:55:58,835 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:55:58,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:58" (1/1) ... [2024-11-16 07:55:58,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:58" (1/1) ... [2024-11-16 07:55:58,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:58" (1/1) ... [2024-11-16 07:55:58,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:58" (1/1) ... [2024-11-16 07:55:58,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:58" (1/1) ... [2024-11-16 07:55:58,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:58" (1/1) ... [2024-11-16 07:55:58,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:55:58,850 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:55:58,850 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:55:58,850 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:55:58,851 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:58" (1/1) ... [2024-11-16 07:55:58,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:55:58,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:55:58,879 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:55:58,885 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:55:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:55:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-16 07:55:58,923 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-16 07:55:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-16 07:55:58,923 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-16 07:55:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-16 07:55:58,923 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-16 07:55:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-16 07:55:58,923 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-16 07:55:58,924 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-16 07:55:58,924 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-16 07:55:58,924 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2024-11-16 07:55:58,924 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2024-11-16 07:55:58,924 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2024-11-16 07:55:58,924 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2024-11-16 07:55:58,924 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2024-11-16 07:55:58,924 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2024-11-16 07:55:58,924 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-16 07:55:58,924 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-16 07:55:58,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 07:55:58,924 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-16 07:55:58,924 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-16 07:55:58,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:55:58,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:55:58,987 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:55:58,989 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:55:59,055 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L302-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~3#1; [2024-11-16 07:55:59,055 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L900-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~10#1; [2024-11-16 07:55:59,059 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L228: #res := ~retValue_acc~1; [2024-11-16 07:55:59,111 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L877-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~8#1; [2024-11-16 07:55:59,178 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000-1: main_#res#1 := main_~retValue_acc~11#1; [2024-11-16 07:55:59,178 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1044-1: valid_product_#res#1 := valid_product_~retValue_acc~13#1; [2024-11-16 07:55:59,203 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L283-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1; [2024-11-16 07:55:59,203 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L891-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~9#1; [2024-11-16 07:55:59,211 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L845-1: isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~7#1; [2024-11-16 07:55:59,211 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L219: #res#1 := ~retValue_acc~0#1; [2024-11-16 07:55:59,240 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-11-16 07:55:59,240 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:55:59,253 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:55:59,253 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:55:59,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:55:59 BoogieIcfgContainer [2024-11-16 07:55:59,254 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:55:59,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:55:59,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:55:59,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:55:59,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:55:58" (1/3) ... [2024-11-16 07:55:59,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d344a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:55:59, skipping insertion in model container [2024-11-16 07:55:59,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:55:58" (2/3) ... [2024-11-16 07:55:59,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d344a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:55:59, skipping insertion in model container [2024-11-16 07:55:59,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:55:59" (3/3) ... [2024-11-16 07:55:59,266 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product62.cil.c [2024-11-16 07:55:59,278 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:55:59,278 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:55:59,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:55:59,320 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;@4df1a7e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:55:59,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:55:59,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 100 states have internal predecessors, (120), 18 states have call successors, (18), 10 states have call predecessors, (18), 10 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 07:55:59,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-16 07:55:59,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:55:59,330 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] [2024-11-16 07:55:59,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:55:59,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:55:59,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1661518342, now seen corresponding path program 1 times [2024-11-16 07:55:59,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:55:59,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949780101] [2024-11-16 07:55:59,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:55:59,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:55:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:59,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 07:55:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:59,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:55:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:59,527 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:55:59,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:55:59,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949780101] [2024-11-16 07:55:59,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949780101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:55:59,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:55:59,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 07:55:59,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622515650] [2024-11-16 07:55:59,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:55:59,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 07:55:59,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:55:59,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 07:55:59,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 07:55:59,550 INFO L87 Difference]: Start difference. First operand has 120 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 100 states have internal predecessors, (120), 18 states have call successors, (18), 10 states have call predecessors, (18), 10 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:55:59,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:55:59,574 INFO L93 Difference]: Finished difference Result 230 states and 305 transitions. [2024-11-16 07:55:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 07:55:59,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-16 07:55:59,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:55:59,583 INFO L225 Difference]: With dead ends: 230 [2024-11-16 07:55:59,583 INFO L226 Difference]: Without dead ends: 109 [2024-11-16 07:55:59,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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:55:59,589 INFO L432 NwaCegarLoop]: 149 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, 149 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:55:59,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:55:59,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-16 07:55:59,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-16 07:55:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 90 states have internal predecessors, (104), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 07:55:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 139 transitions. [2024-11-16 07:55:59,626 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 139 transitions. Word has length 34 [2024-11-16 07:55:59,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:55:59,628 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 139 transitions. [2024-11-16 07:55:59,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:55:59,628 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 139 transitions. [2024-11-16 07:55:59,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-16 07:55:59,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:55:59,633 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] [2024-11-16 07:55:59,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 07:55:59,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:55:59,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:55:59,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1773723656, now seen corresponding path program 1 times [2024-11-16 07:55:59,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:55:59,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487443589] [2024-11-16 07:55:59,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:55:59,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:55:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:59,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:55:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:59,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-16 07:55:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:59,751 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:55:59,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:55:59,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487443589] [2024-11-16 07:55:59,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487443589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:55:59,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:55:59,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:55:59,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953655862] [2024-11-16 07:55:59,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:55:59,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:55:59,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:55:59,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:55:59,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:55:59,754 INFO L87 Difference]: Start difference. First operand 109 states and 139 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:55:59,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:55:59,774 INFO L93 Difference]: Finished difference Result 210 states and 273 transitions. [2024-11-16 07:55:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:55:59,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2024-11-16 07:55:59,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:55:59,777 INFO L225 Difference]: With dead ends: 210 [2024-11-16 07:55:59,777 INFO L226 Difference]: Without dead ends: 109 [2024-11-16 07:55:59,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:55:59,779 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:55:59,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 137 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:55:59,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-16 07:55:59,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-16 07:55:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.271604938271605) internal successors, (103), 90 states have internal predecessors, (103), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 07:55:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 138 transitions. [2024-11-16 07:55:59,790 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 138 transitions. Word has length 40 [2024-11-16 07:55:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:55:59,791 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 138 transitions. [2024-11-16 07:55:59,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:55:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 138 transitions. [2024-11-16 07:55:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 07:55:59,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:55:59,793 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, 1, 1, 1, 1, 1] [2024-11-16 07:55:59,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 07:55:59,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:55:59,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:55:59,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1807021803, now seen corresponding path program 1 times [2024-11-16 07:55:59,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:55:59,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845298054] [2024-11-16 07:55:59,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:55:59,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:55:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:59,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 07:55:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:59,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-16 07:55:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:59,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 07:55:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:59,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 07:55:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:55:59,878 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:55:59,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:55:59,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845298054] [2024-11-16 07:55:59,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845298054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:55:59,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:55:59,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 07:55:59,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157498480] [2024-11-16 07:55:59,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:55:59,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 07:55:59,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:55:59,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 07:55:59,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 07:55:59,880 INFO L87 Difference]: Start difference. First operand 109 states and 138 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 07:55:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:55:59,977 INFO L93 Difference]: Finished difference Result 198 states and 251 transitions. [2024-11-16 07:55:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 07:55:59,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2024-11-16 07:55:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:55:59,979 INFO L225 Difference]: With dead ends: 198 [2024-11-16 07:55:59,979 INFO L226 Difference]: Without dead ends: 117 [2024-11-16 07:55:59,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 07:55:59,981 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 79 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:55:59,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 226 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:55:59,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-16 07:56:00,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 98. [2024-11-16 07:56:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 82 states have internal predecessors, (94), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 07:56:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 124 transitions. [2024-11-16 07:56:00,022 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 124 transitions. Word has length 50 [2024-11-16 07:56:00,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:00,022 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 124 transitions. [2024-11-16 07:56:00,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 07:56:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 124 transitions. [2024-11-16 07:56:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-16 07:56:00,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:00,029 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:56:00,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 07:56:00,029 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:00,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:00,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1517781503, now seen corresponding path program 1 times [2024-11-16 07:56:00,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:00,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85509962] [2024-11-16 07:56:00,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:00,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:00,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:56:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:00,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 07:56:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:00,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 07:56:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:00,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 07:56:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:00,107 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:56:00,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:56:00,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85509962] [2024-11-16 07:56:00,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85509962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:56:00,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:56:00,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 07:56:00,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380882285] [2024-11-16 07:56:00,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:56:00,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 07:56:00,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:56:00,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 07:56:00,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 07:56:00,109 INFO L87 Difference]: Start difference. First operand 98 states and 124 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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:56:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:56:00,253 INFO L93 Difference]: Finished difference Result 281 states and 359 transitions. [2024-11-16 07:56:00,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:56:00,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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:56:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:56:00,256 INFO L225 Difference]: With dead ends: 281 [2024-11-16 07:56:00,256 INFO L226 Difference]: Without dead ends: 191 [2024-11-16 07:56:00,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:56:00,260 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 178 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:56:00,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 230 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:56:00,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-16 07:56:00,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 182. [2024-11-16 07:56:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 146 states have internal predecessors, (173), 22 states have call successors, (22), 17 states have call predecessors, (22), 22 states have return successors, (33), 24 states have call predecessors, (33), 22 states have call successors, (33) [2024-11-16 07:56:00,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 228 transitions. [2024-11-16 07:56:00,291 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 228 transitions. Word has length 53 [2024-11-16 07:56:00,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:00,291 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 228 transitions. [2024-11-16 07:56:00,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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:56:00,291 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 228 transitions. [2024-11-16 07:56:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-16 07:56:00,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:00,294 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:56:00,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 07:56:00,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:00,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:00,296 INFO L85 PathProgramCache]: Analyzing trace with hash 597734955, now seen corresponding path program 1 times [2024-11-16 07:56:00,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:00,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16798139] [2024-11-16 07:56:00,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:00,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:00,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:56:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:00,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 07:56:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:00,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:00,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:56:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:00,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 07:56:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:00,444 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:56:00,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:56:00,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16798139] [2024-11-16 07:56:00,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16798139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:56:00,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:56:00,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:56:00,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893747175] [2024-11-16 07:56:00,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:56:00,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:56:00,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:56:00,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:56:00,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:56:00,449 INFO L87 Difference]: Start difference. First operand 182 states and 228 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (6), 2 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:56:00,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:56:00,579 INFO L93 Difference]: Finished difference Result 361 states and 465 transitions. [2024-11-16 07:56:00,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:56:00,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (6), 2 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 61 [2024-11-16 07:56:00,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:56:00,582 INFO L225 Difference]: With dead ends: 361 [2024-11-16 07:56:00,584 INFO L226 Difference]: Without dead ends: 187 [2024-11-16 07:56:00,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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:56:00,585 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 69 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:56:00,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 331 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:56:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-16 07:56:00,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2024-11-16 07:56:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 139 states have (on average 1.2589928057553956) internal successors, (175), 148 states have internal predecessors, (175), 22 states have call successors, (22), 17 states have call predecessors, (22), 22 states have return successors, (33), 24 states have call predecessors, (33), 22 states have call successors, (33) [2024-11-16 07:56:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 230 transitions. [2024-11-16 07:56:00,615 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 230 transitions. Word has length 61 [2024-11-16 07:56:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:00,616 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 230 transitions. [2024-11-16 07:56:00,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (6), 2 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:56:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 230 transitions. [2024-11-16 07:56:00,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-16 07:56:00,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:00,621 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:56:00,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 07:56:00,621 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:00,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:00,622 INFO L85 PathProgramCache]: Analyzing trace with hash 664741708, now seen corresponding path program 1 times [2024-11-16 07:56:00,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:00,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189579780] [2024-11-16 07:56:00,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:00,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:00,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:56:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:00,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 07:56:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:00,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:00,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:56:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:00,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 07:56:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 07:56:00,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:56:00,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189579780] [2024-11-16 07:56:00,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189579780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:56:00,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:56:00,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 07:56:00,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965879237] [2024-11-16 07:56:00,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:56:00,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 07:56:00,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:56:00,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 07:56:00,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:56:00,837 INFO L87 Difference]: Start difference. First operand 184 states and 230 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 07:56:01,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:56:01,076 INFO L93 Difference]: Finished difference Result 361 states and 453 transitions. [2024-11-16 07:56:01,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 07:56:01,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-11-16 07:56:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:56:01,078 INFO L225 Difference]: With dead ends: 361 [2024-11-16 07:56:01,079 INFO L226 Difference]: Without dead ends: 185 [2024-11-16 07:56:01,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-16 07:56:01,084 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 144 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:56:01,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 480 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:56:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-16 07:56:01,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2024-11-16 07:56:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 137 states have (on average 1.2335766423357664) internal successors, (169), 146 states have internal predecessors, (169), 22 states have call successors, (22), 17 states have call predecessors, (22), 22 states have return successors, (33), 24 states have call predecessors, (33), 22 states have call successors, (33) [2024-11-16 07:56:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 224 transitions. [2024-11-16 07:56:01,116 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 224 transitions. Word has length 61 [2024-11-16 07:56:01,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:01,120 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 224 transitions. [2024-11-16 07:56:01,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 07:56:01,121 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2024-11-16 07:56:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 07:56:01,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:01,122 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, 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:56:01,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 07:56:01,123 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:01,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:01,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1066313898, now seen corresponding path program 1 times [2024-11-16 07:56:01,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:01,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479877005] [2024-11-16 07:56:01,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:01,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:56:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 07:56:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:56:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-16 07:56:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,234 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:56:01,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:56:01,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479877005] [2024-11-16 07:56:01,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479877005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:56:01,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:56:01,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:56:01,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184699841] [2024-11-16 07:56:01,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:56:01,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:56:01,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:56:01,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:56:01,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:56:01,236 INFO L87 Difference]: Start difference. First operand 182 states and 224 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (6), 2 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:56:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:56:01,382 INFO L93 Difference]: Finished difference Result 362 states and 458 transitions. [2024-11-16 07:56:01,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 07:56:01,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (6), 2 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 67 [2024-11-16 07:56:01,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:56:01,385 INFO L225 Difference]: With dead ends: 362 [2024-11-16 07:56:01,385 INFO L226 Difference]: Without dead ends: 188 [2024-11-16 07:56:01,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 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:56:01,386 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 70 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:56:01,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 424 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:56:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-16 07:56:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2024-11-16 07:56:01,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 140 states have (on average 1.2285714285714286) internal successors, (172), 149 states have internal predecessors, (172), 22 states have call successors, (22), 17 states have call predecessors, (22), 22 states have return successors, (33), 24 states have call predecessors, (33), 22 states have call successors, (33) [2024-11-16 07:56:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 227 transitions. [2024-11-16 07:56:01,409 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 227 transitions. Word has length 67 [2024-11-16 07:56:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:01,409 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 227 transitions. [2024-11-16 07:56:01,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (6), 2 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:56:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 227 transitions. [2024-11-16 07:56:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 07:56:01,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:01,411 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, 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:56:01,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 07:56:01,411 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:01,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:01,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1352389639, now seen corresponding path program 1 times [2024-11-16 07:56:01,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:01,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136656288] [2024-11-16 07:56:01,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:01,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:56:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 07:56:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:56:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-16 07:56:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,516 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:56:01,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:56:01,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136656288] [2024-11-16 07:56:01,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136656288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:56:01,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:56:01,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:56:01,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309891346] [2024-11-16 07:56:01,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:56:01,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:56:01,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:56:01,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:56:01,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:56:01,519 INFO L87 Difference]: Start difference. First operand 185 states and 227 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-16 07:56:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:56:01,729 INFO L93 Difference]: Finished difference Result 508 states and 650 transitions. [2024-11-16 07:56:01,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:56:01,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 67 [2024-11-16 07:56:01,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:56:01,731 INFO L225 Difference]: With dead ends: 508 [2024-11-16 07:56:01,732 INFO L226 Difference]: Without dead ends: 331 [2024-11-16 07:56:01,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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:56:01,733 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 246 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:56:01,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 347 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:56:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-16 07:56:01,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 328. [2024-11-16 07:56:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 247 states have (on average 1.2024291497975708) internal successors, (297), 260 states have internal predecessors, (297), 42 states have call successors, (42), 35 states have call predecessors, (42), 38 states have return successors, (68), 43 states have call predecessors, (68), 42 states have call successors, (68) [2024-11-16 07:56:01,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 407 transitions. [2024-11-16 07:56:01,758 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 407 transitions. Word has length 67 [2024-11-16 07:56:01,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:01,758 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 407 transitions. [2024-11-16 07:56:01,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-16 07:56:01,758 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 407 transitions. [2024-11-16 07:56:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-16 07:56:01,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:01,759 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, 1, 1, 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:56:01,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 07:56:01,760 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:01,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:01,760 INFO L85 PathProgramCache]: Analyzing trace with hash 944739909, now seen corresponding path program 1 times [2024-11-16 07:56:01,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:01,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668193301] [2024-11-16 07:56:01,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:01,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 07:56:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 07:56:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 07:56:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:56:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 07:56:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:01,912 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:56:01,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:56:01,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668193301] [2024-11-16 07:56:01,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668193301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:56:01,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:56:01,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 07:56:01,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692447049] [2024-11-16 07:56:01,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:56:01,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 07:56:01,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:56:01,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 07:56:01,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 07:56:01,914 INFO L87 Difference]: Start difference. First operand 328 states and 407 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-16 07:56:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:56:02,592 INFO L93 Difference]: Finished difference Result 978 states and 1265 transitions. [2024-11-16 07:56:02,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 07:56:02,593 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 71 [2024-11-16 07:56:02,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:56:02,596 INFO L225 Difference]: With dead ends: 978 [2024-11-16 07:56:02,596 INFO L226 Difference]: Without dead ends: 715 [2024-11-16 07:56:02,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-11-16 07:56:02,597 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 498 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 07:56:02,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 612 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 07:56:02,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-16 07:56:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 630. [2024-11-16 07:56:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 473 states have (on average 1.2029598308668077) internal successors, (569), 501 states have internal predecessors, (569), 82 states have call successors, (82), 62 states have call predecessors, (82), 74 states have return successors, (132), 84 states have call predecessors, (132), 82 states have call successors, (132) [2024-11-16 07:56:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 783 transitions. [2024-11-16 07:56:02,653 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 783 transitions. Word has length 71 [2024-11-16 07:56:02,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:02,654 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 783 transitions. [2024-11-16 07:56:02,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-16 07:56:02,654 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 783 transitions. [2024-11-16 07:56:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 07:56:02,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:02,655 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:02,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 07:56:02,656 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:02,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash 170702626, now seen corresponding path program 1 times [2024-11-16 07:56:02,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:02,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129278925] [2024-11-16 07:56:02,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:02,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:02,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 07:56:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:02,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 07:56:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:02,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 07:56:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:02,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:02,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:02,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:56:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:02,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 07:56:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:02,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 07:56:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:02,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 07:56:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:02,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 07:56:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:02,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:02,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 07:56:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 07:56:02,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:56:02,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129278925] [2024-11-16 07:56:02,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129278925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:56:02,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133968564] [2024-11-16 07:56:02,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:02,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:56:02,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:56:02,814 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:56:02,816 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:56:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:02,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 07:56:02,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:56:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:56:03,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:56:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 07:56:03,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133968564] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:56:03,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:56:03,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 15 [2024-11-16 07:56:03,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330571447] [2024-11-16 07:56:03,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:56:03,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 07:56:03,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:56:03,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 07:56:03,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-16 07:56:03,314 INFO L87 Difference]: Start difference. First operand 630 states and 783 transitions. Second operand has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 10 states have internal predecessors, (148), 6 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23) [2024-11-16 07:56:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:56:04,176 INFO L93 Difference]: Finished difference Result 1342 states and 1707 transitions. [2024-11-16 07:56:04,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-16 07:56:04,176 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 10 states have internal predecessors, (148), 6 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23) Word has length 126 [2024-11-16 07:56:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:56:04,179 INFO L225 Difference]: With dead ends: 1342 [2024-11-16 07:56:04,180 INFO L226 Difference]: Without dead ends: 775 [2024-11-16 07:56:04,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 283 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=441, Invalid=1451, Unknown=0, NotChecked=0, Total=1892 [2024-11-16 07:56:04,182 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 568 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 07:56:04,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 1019 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 07:56:04,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-16 07:56:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 698. [2024-11-16 07:56:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 520 states have (on average 1.1884615384615385) internal successors, (618), 556 states have internal predecessors, (618), 92 states have call successors, (92), 76 states have call predecessors, (92), 85 states have return successors, (124), 89 states have call predecessors, (124), 92 states have call successors, (124) [2024-11-16 07:56:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 834 transitions. [2024-11-16 07:56:04,219 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 834 transitions. Word has length 126 [2024-11-16 07:56:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:04,219 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 834 transitions. [2024-11-16 07:56:04,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 10 states have internal predecessors, (148), 6 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23) [2024-11-16 07:56:04,220 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 834 transitions. [2024-11-16 07:56:04,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-16 07:56:04,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:04,222 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:04,236 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:56:04,423 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,SelfDestructingSolverStorable9 [2024-11-16 07:56:04,423 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:04,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:04,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2091093811, now seen corresponding path program 1 times [2024-11-16 07:56:04,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:04,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250097621] [2024-11-16 07:56:04,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:04,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 07:56:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 07:56:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 07:56:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:56:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 07:56:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 07:56:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:56:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 07:56:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 07:56:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-16 07:56:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 07:56:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:56:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 07:56:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 07:56:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 07:56:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:56:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-16 07:56:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 91 proven. 35 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-16 07:56:04,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:56:04,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250097621] [2024-11-16 07:56:04,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250097621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:56:04,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979907333] [2024-11-16 07:56:04,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:04,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:56:04,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:56:04,841 INFO L229 MonitoredProcess]: Starting monitored process 3 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:56:04,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 07:56:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:04,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 07:56:04,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:56:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 171 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-16 07:56:05,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:56:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 85 proven. 40 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 07:56:05,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979907333] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:56:05,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:56:05,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 11] total 30 [2024-11-16 07:56:05,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916834349] [2024-11-16 07:56:05,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:56:05,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-16 07:56:05,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:56:05,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-16 07:56:05,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2024-11-16 07:56:05,578 INFO L87 Difference]: Start difference. First operand 698 states and 834 transitions. Second operand has 30 states, 30 states have (on average 8.066666666666666) internal successors, (242), 23 states have internal predecessors, (242), 10 states have call successors, (40), 8 states have call predecessors, (40), 11 states have return successors, (44), 12 states have call predecessors, (44), 10 states have call successors, (44) [2024-11-16 07:56:07,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:56:07,554 INFO L93 Difference]: Finished difference Result 1978 states and 2470 transitions. [2024-11-16 07:56:07,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-16 07:56:07,555 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.066666666666666) internal successors, (242), 23 states have internal predecessors, (242), 10 states have call successors, (40), 8 states have call predecessors, (40), 11 states have return successors, (44), 12 states have call predecessors, (44), 10 states have call successors, (44) Word has length 220 [2024-11-16 07:56:07,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:56:07,560 INFO L225 Difference]: With dead ends: 1978 [2024-11-16 07:56:07,560 INFO L226 Difference]: Without dead ends: 1288 [2024-11-16 07:56:07,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 484 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1782 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1154, Invalid=5652, Unknown=0, NotChecked=0, Total=6806 [2024-11-16 07:56:07,564 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1358 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:56:07,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 1241 Invalid, 2826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 07:56:07,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2024-11-16 07:56:07,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1190. [2024-11-16 07:56:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 900 states have (on average 1.13) internal successors, (1017), 940 states have internal predecessors, (1017), 156 states have call successors, (156), 134 states have call predecessors, (156), 133 states have return successors, (187), 143 states have call predecessors, (187), 156 states have call successors, (187) [2024-11-16 07:56:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1360 transitions. [2024-11-16 07:56:07,624 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1360 transitions. Word has length 220 [2024-11-16 07:56:07,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:07,625 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1360 transitions. [2024-11-16 07:56:07,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.066666666666666) internal successors, (242), 23 states have internal predecessors, (242), 10 states have call successors, (40), 8 states have call predecessors, (40), 11 states have return successors, (44), 12 states have call predecessors, (44), 10 states have call successors, (44) [2024-11-16 07:56:07,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1360 transitions. [2024-11-16 07:56:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-16 07:56:07,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:07,629 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:07,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 07:56:07,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-16 07:56:07,830 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:07,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:07,831 INFO L85 PathProgramCache]: Analyzing trace with hash -117314966, now seen corresponding path program 1 times [2024-11-16 07:56:07,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:07,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061232025] [2024-11-16 07:56:07,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:07,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:07,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 07:56:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:07,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 07:56:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 07:56:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:56:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 07:56:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 07:56:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:56:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 07:56:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 07:56:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 07:56:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 07:56:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 07:56:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 07:56:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:56:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 07:56:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 07:56:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 07:56:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-16 07:56:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-16 07:56:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-16 07:56:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:56:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-16 07:56:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 103 proven. 52 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-16 07:56:08,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:56:08,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061232025] [2024-11-16 07:56:08,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061232025] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:56:08,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548176599] [2024-11-16 07:56:08,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:08,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:56:08,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:56:08,146 INFO L229 MonitoredProcess]: Starting monitored process 4 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:56:08,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 07:56:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:08,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 07:56:08,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:56:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 216 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 07:56:08,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:56:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 111 proven. 62 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-16 07:56:08,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548176599] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:56:08,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:56:08,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 22 [2024-11-16 07:56:08,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586260302] [2024-11-16 07:56:08,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:56:08,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-16 07:56:08,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:56:08,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-16 07:56:08,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-11-16 07:56:08,885 INFO L87 Difference]: Start difference. First operand 1190 states and 1360 transitions. Second operand has 22 states, 22 states have (on average 11.636363636363637) internal successors, (256), 15 states have internal predecessors, (256), 7 states have call successors, (54), 8 states have call predecessors, (54), 11 states have return successors, (47), 9 states have call predecessors, (47), 7 states have call successors, (47) [2024-11-16 07:56:10,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:56:10,134 INFO L93 Difference]: Finished difference Result 2322 states and 2684 transitions. [2024-11-16 07:56:10,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-16 07:56:10,135 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 11.636363636363637) internal successors, (256), 15 states have internal predecessors, (256), 7 states have call successors, (54), 8 states have call predecessors, (54), 11 states have return successors, (47), 9 states have call predecessors, (47), 7 states have call successors, (47) Word has length 244 [2024-11-16 07:56:10,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:56:10,140 INFO L225 Difference]: With dead ends: 2322 [2024-11-16 07:56:10,140 INFO L226 Difference]: Without dead ends: 1250 [2024-11-16 07:56:10,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 542 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=483, Invalid=1869, Unknown=0, NotChecked=0, Total=2352 [2024-11-16 07:56:10,143 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 650 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 07:56:10,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 452 Invalid, 2042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1826 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 07:56:10,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-16 07:56:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1214. [2024-11-16 07:56:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 916 states have (on average 1.1233624454148472) internal successors, (1029), 956 states have internal predecessors, (1029), 156 states have call successors, (156), 142 states have call predecessors, (156), 141 states have return successors, (187), 143 states have call predecessors, (187), 156 states have call successors, (187) [2024-11-16 07:56:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1372 transitions. [2024-11-16 07:56:10,231 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1372 transitions. Word has length 244 [2024-11-16 07:56:10,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:10,232 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1372 transitions. [2024-11-16 07:56:10,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.636363636363637) internal successors, (256), 15 states have internal predecessors, (256), 7 states have call successors, (54), 8 states have call predecessors, (54), 11 states have return successors, (47), 9 states have call predecessors, (47), 7 states have call successors, (47) [2024-11-16 07:56:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1372 transitions. [2024-11-16 07:56:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-16 07:56:10,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:10,236 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:10,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 07:56:10,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:56:10,437 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:10,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:10,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1733893624, now seen corresponding path program 1 times [2024-11-16 07:56:10,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:10,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447815952] [2024-11-16 07:56:10,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:10,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 07:56:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 07:56:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 07:56:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:56:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 07:56:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 07:56:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:56:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 07:56:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 07:56:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 07:56:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 07:56:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-16 07:56:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 07:56:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:56:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 07:56:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 07:56:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-16 07:56:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-16 07:56:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-16 07:56:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-16 07:56:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:56:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-16 07:56:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 101 proven. 47 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-16 07:56:10,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:56:10,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447815952] [2024-11-16 07:56:10,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447815952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:56:10,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263441374] [2024-11-16 07:56:10,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:10,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:56:10,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:56:10,901 INFO L229 MonitoredProcess]: Starting monitored process 5 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:56:10,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 07:56:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:11,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 07:56:11,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:56:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 155 proven. 27 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-16 07:56:11,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:56:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 111 proven. 46 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-16 07:56:11,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263441374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:56:11,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:56:11,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 13] total 23 [2024-11-16 07:56:11,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561131370] [2024-11-16 07:56:11,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:56:11,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-16 07:56:11,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:56:11,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-16 07:56:11,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2024-11-16 07:56:11,676 INFO L87 Difference]: Start difference. First operand 1214 states and 1372 transitions. Second operand has 23 states, 23 states have (on average 11.130434782608695) internal successors, (256), 19 states have internal predecessors, (256), 14 states have call successors, (53), 11 states have call predecessors, (53), 13 states have return successors, (47), 14 states have call predecessors, (47), 14 states have call successors, (47) [2024-11-16 07:56:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:56:13,036 INFO L93 Difference]: Finished difference Result 2295 states and 2650 transitions. [2024-11-16 07:56:13,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-16 07:56:13,037 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 11.130434782608695) internal successors, (256), 19 states have internal predecessors, (256), 14 states have call successors, (53), 11 states have call predecessors, (53), 13 states have return successors, (47), 14 states have call predecessors, (47), 14 states have call successors, (47) Word has length 245 [2024-11-16 07:56:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:56:13,039 INFO L225 Difference]: With dead ends: 2295 [2024-11-16 07:56:13,039 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 07:56:13,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 541 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=869, Invalid=2913, Unknown=0, NotChecked=0, Total=3782 [2024-11-16 07:56:13,043 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 680 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 2045 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 2045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 07:56:13,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 540 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 2045 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 07:56:13,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 07:56:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 07:56:13,044 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:56:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 07:56:13,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 245 [2024-11-16 07:56:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:13,045 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 07:56:13,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.130434782608695) internal successors, (256), 19 states have internal predecessors, (256), 14 states have call successors, (53), 11 states have call predecessors, (53), 13 states have return successors, (47), 14 states have call predecessors, (47), 14 states have call successors, (47) [2024-11-16 07:56:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 07:56:13,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 07:56:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 07:56:13,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-16 07:56:13,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:56:13,255 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:56:13,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 07:56:23,025 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 07:56:23,035 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 ~switchedOnBeforeTS~0) (<= 1 |old(~pumpRunning~0)|)) Eliminated clause: (and (<= 1 ~pumpRunning~0) (<= ~waterLevel~0 1) (= 1 ~systemActive~0) (<= 1 ~switchedOnBeforeTS~0)) [2024-11-16 07:56:23,056 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (and (= |old(~methaneLevelCritical~0)| ~methaneLevelCritical~0) (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= 1 ~systemActive~0)) (.cse2 (<= ~waterLevel~0 2))) (or (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (<= 1 ~switchedOnBeforeTS~0)) (and (= ~pumpRunning~0 0) .cse1 .cse2))) (or (< ~pumpRunning~0 1) (= |old(~methaneLevelCritical~0)| 0))) Eliminated clause: (and (or (< ~pumpRunning~0 1) (= ~methaneLevelCritical~0 0)) (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= 1 ~systemActive~0)) (.cse2 (<= ~waterLevel~0 2))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and .cse0 .cse1 .cse2 (<= 1 ~switchedOnBeforeTS~0)) (and (= ~pumpRunning~0 0) .cse1 .cse2)))) [2024-11-16 07:56:23,078 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse0 (= ~pumpRunning~0 |old(~pumpRunning~0)|)) (.cse1 (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|)) (.cse3 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse5 (= |old(~pumpRunning~0)| 0)) (.cse2 (= 1 ~systemActive~0)) (.cse4 (= |old(~waterLevel~0)| 2))) (and (or (< 1 |old(~waterLevel~0)|) (and .cse0 .cse1 .cse2 .cse3 (<= 1 ~switchedOnBeforeTS~0)) (< |old(~pumpRunning~0)| 1)) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (not .cse4)) (or (and (= ~pumpRunning~0 0) .cse1 .cse3) (not .cse5)) (let ((.cse6 (<= 1 |old(~pumpRunning~0)|))) (or (and (<= |old(~waterLevel~0)| 1) .cse6) (and .cse2 .cse5 (<= |old(~waterLevel~0)| 2)) (and .cse2 .cse6 .cse4))))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int) (|old(~switchedOnBeforeTS~0)| Int) (|old(~waterLevel~0)| Int)) (let ((.cse0 (= ~pumpRunning~0 |old(~pumpRunning~0)|)) (.cse1 (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|)) (.cse3 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse5 (= |old(~pumpRunning~0)| 0)) (.cse2 (= 1 ~systemActive~0)) (.cse4 (= |old(~waterLevel~0)| 2))) (and (or (< 1 |old(~waterLevel~0)|) (and .cse0 .cse1 .cse2 .cse3 (<= 1 ~switchedOnBeforeTS~0)) (< |old(~pumpRunning~0)| 1)) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (not .cse4)) (or (and (= ~pumpRunning~0 0) .cse1 .cse3) (not .cse5)) (let ((.cse6 (<= 1 |old(~pumpRunning~0)|))) (or (and (<= |old(~waterLevel~0)| 1) .cse6) (and .cse2 .cse5 (<= |old(~waterLevel~0)| 2)) (and .cse2 .cse6 .cse4)))))) [2024-11-16 07:56:23,091 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-16 07:56:23,094 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 (= ~methaneLevelCritical~0 0) (<= ~waterLevel~0 1) .cse0 (<= 1 ~switchedOnBeforeTS~0) (<= 1 |old(~pumpRunning~0)|))))) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~pumpRunning~0 0) .cse0 (<= ~waterLevel~0 2)) (and (<= 1 ~pumpRunning~0) (= ~methaneLevelCritical~0 0) (<= ~waterLevel~0 1) .cse0 (<= 1 ~switchedOnBeforeTS~0)))) [2024-11-16 07:56:23,105 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse3 (= |old(~waterLevel~0)| 2)) (.cse4 (= ~pumpRunning~0 0)) (.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= ~methaneLevelCritical~0 0)) (.cse2 (= 1 ~systemActive~0)) (.cse5 (<= |old(~waterLevel~0)| 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse3) (and .cse4 .cse2 .cse5) (and .cse0 .cse1 .cse2 .cse5 (<= 1 ~switchedOnBeforeTS~0)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= ~methaneLevelCritical~0 0)) (.cse2 (<= ~waterLevel~0 1)) (.cse5 (= ~pumpRunning~0 0)) (.cse4 (= 2 ~waterLevel~0)) (.cse3 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 1 ~switchedOnBeforeTS~0)) (and .cse0 .cse4 .cse1 .cse3) (and .cse5 .cse2 .cse3) (and .cse5 .cse4 .cse3))) [2024-11-16 07:56:23,111 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__methaneQuery 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 (= ~methaneLevelCritical~0 0) (<= ~waterLevel~0 1) .cse0 (<= 1 ~switchedOnBeforeTS~0) (<= 1 |old(~pumpRunning~0)|))))) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~pumpRunning~0 0) .cse0 (<= ~waterLevel~0 2)) (and (<= 1 ~pumpRunning~0) (= ~methaneLevelCritical~0 0) (<= ~waterLevel~0 1) .cse0 (<= 1 ~switchedOnBeforeTS~0)))) [2024-11-16 07:56:23,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:56:23 BoogieIcfgContainer [2024-11-16 07:56:23,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 07:56:23,131 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 07:56:23,131 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 07:56:23,131 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 07:56:23,131 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:55:59" (3/4) ... [2024-11-16 07:56:23,134 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 07:56:23,137 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-11-16 07:56:23,137 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-16 07:56:23,137 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-16 07:56:23,137 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-16 07:56:23,137 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-16 07:56:23,138 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-11-16 07:56:23,138 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-16 07:56:23,138 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__methaneQuery [2024-11-16 07:56:23,138 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2024-11-16 07:56:23,138 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneAlarm [2024-11-16 07:56:23,147 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2024-11-16 07:56:23,148 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-16 07:56:23,148 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-16 07:56:23,149 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 07:56:23,149 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 07:56:23,266 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 07:56:23,267 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 07:56:23,267 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 07:56:23,267 INFO L158 Benchmark]: Toolchain (without parser) took 24915.11ms. Allocated memory was 184.5MB in the beginning and 570.4MB in the end (delta: 385.9MB). Free memory was 112.4MB in the beginning and 306.9MB in the end (delta: -194.5MB). Peak memory consumption was 193.2MB. Max. memory is 16.1GB. [2024-11-16 07:56:23,267 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:56:23,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.45ms. Allocated memory is still 184.5MB. Free memory was 112.2MB in the beginning and 145.9MB in the end (delta: -33.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 07:56:23,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.85ms. Allocated memory is still 184.5MB. Free memory was 145.9MB in the beginning and 143.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:56:23,268 INFO L158 Benchmark]: Boogie Preprocessor took 38.62ms. Allocated memory is still 184.5MB. Free memory was 143.8MB in the beginning and 141.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:56:23,268 INFO L158 Benchmark]: IcfgBuilder took 403.80ms. Allocated memory is still 184.5MB. Free memory was 141.5MB in the beginning and 118.7MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 07:56:23,268 INFO L158 Benchmark]: TraceAbstraction took 23871.46ms. Allocated memory was 184.5MB in the beginning and 570.4MB in the end (delta: 385.9MB). Free memory was 118.7MB in the beginning and 315.3MB in the end (delta: -196.6MB). Peak memory consumption was 314.8MB. Max. memory is 16.1GB. [2024-11-16 07:56:23,269 INFO L158 Benchmark]: Witness Printer took 136.17ms. Allocated memory is still 570.4MB. Free memory was 315.3MB in the beginning and 306.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 07:56:23,271 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.15ms. Allocated memory is still 184.5MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.45ms. Allocated memory is still 184.5MB. Free memory was 112.2MB in the beginning and 145.9MB in the end (delta: -33.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.85ms. Allocated memory is still 184.5MB. Free memory was 145.9MB in the beginning and 143.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.62ms. Allocated memory is still 184.5MB. Free memory was 143.8MB in the beginning and 141.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 403.80ms. Allocated memory is still 184.5MB. Free memory was 141.5MB in the beginning and 118.7MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 23871.46ms. Allocated memory was 184.5MB in the beginning and 570.4MB in the end (delta: 385.9MB). Free memory was 118.7MB in the beginning and 315.3MB in the end (delta: -196.6MB). Peak memory consumption was 314.8MB. Max. memory is 16.1GB. * Witness Printer took 136.17ms. Allocated memory is still 570.4MB. Free memory was 315.3MB in the beginning and 306.9MB 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,"MinePump.i","") [49] - GenericResultAtLocation [Line: 313]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [313] - GenericResultAtLocation [Line: 364]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [364] - GenericResultAtLocation [Line: 434]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [434] - GenericResultAtLocation [Line: 800]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [800] - GenericResultAtLocation [Line: 903]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [903] - GenericResultAtLocation [Line: 1003]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1003] - GenericResultAtLocation [Line: 1012]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1012] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 1008]: 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 11 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 13, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4730 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4669 mSDsluCounter, 6188 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4751 mSDsCounter, 1646 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8605 IncrementalHoareTripleChecker+Invalid, 10251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1646 mSolverCounterUnsat, 1437 mSDtfsCounter, 8605 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2251 GetRequests, 1951 SyntacticMatches, 16 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3629 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1214occurred in iteration=12, InterpolantAutomatonStates: 223, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 336 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 2174 NumberOfCodeBlocks, 2174 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2988 ConstructedInterpolants, 0 QuantifiedInterpolants, 6321 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2380 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 21 InterpolantComputations, 9 PerfectInterpolantSequences, 2233/2592 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: 378]: Location Invariant Derived location invariant: null - InvariantResult [Line: 915]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 203]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)) Ensures: ((((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)) && (1 <= \old(pumpRunning))) && ((((((systemActive == \old(systemActive)) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 93]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) Ensures: (((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 827]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((pumpRunning < 1) || (methaneLevelCritical == 0)) && (((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)))) Ensures: (((((methaneLevelCritical == 0) || (\old(methaneLevelCritical) == 0)) && ((\old(methaneLevelCritical) != 0) || (methaneLevelCritical != 0))) && (((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (\old(methaneLevelCritical) == 0)) && (1 == systemActive))) || (((((1 <= pumpRunning) && (\old(methaneLevelCritical) == 0)) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 905]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((systemActive == \old(systemActive)) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 66]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: ((((((((((1 < \old(waterLevel)) || (((pumpRunning == \old(pumpRunning)) && (waterLevel <= 0)) && (1 <= switchedOnBeforeTS))) || (\old(pumpRunning) < 1)) || (((pumpRunning == 0) && (waterLevel <= 0)) && (1 <= switchedOnBeforeTS))) && ((0 < \old(waterLevel)) || (\old(waterLevel) == waterLevel))) && ((((((pumpRunning == \old(pumpRunning)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS)) || (\old(waterLevel) != 2)) || (\old(pumpRunning) < 1)) || (((pumpRunning == 0) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS)))) && (((((1 <= pumpRunning) && (2 == waterLevel)) && (\old(waterLevel) == 2)) || (\old(pumpRunning) != 0)) || ((pumpRunning == 0) && (\old(waterLevel) == waterLevel)))) && ((((((1 == systemActive) && (1 <= \old(switchedOnBeforeTS))) && (\old(waterLevel) <= 1)) && (1 <= \old(pumpRunning))) || (((1 == systemActive) && (\old(pumpRunning) == 0)) && (\old(waterLevel) <= 2))) || (((1 == systemActive) && (1 <= \old(pumpRunning))) && (\old(waterLevel) == 2)))) && ((pumpRunning == 0) || (methaneLevelCritical == 0))) && ((((systemActive == \old(systemActive)) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 101]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) Ensures: (((((((((1 == systemActive) && (\old(pumpRunning) == 0)) && (waterLevel <= 2)) || (((waterLevel <= 1) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) && ((pumpRunning == \old(pumpRunning)) || (\old(pumpRunning) < 1))) && ((0 < pumpRunning) || (pumpRunning == 0))) && ((pumpRunning == 0) || (methaneLevelCritical == 0))) && (((1 < waterLevel) || (0 < \old(pumpRunning))) || ((pumpRunning == 0) && (\old(pumpRunning) == 0)))) && ((((((systemActive == \old(systemActive)) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 815]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) Ensures: ((((((2 == waterLevel) || (\old(waterLevel) != 2)) && (waterLevel <= ((long long) \old(waterLevel) + 1))) && ((((long long) \old(waterLevel) + 1) == waterLevel) || (2 == waterLevel))) && (((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (\old(waterLevel) == 2)) || (((pumpRunning == 0) && (1 == systemActive)) && (\old(waterLevel) == 2))) || (((pumpRunning == 0) && (1 == systemActive)) && (\old(waterLevel) <= 1))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (\old(waterLevel) <= 1)) && (1 <= switchedOnBeforeTS)))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 127]: Procedure Contract for processEnvironment__wrappee__methaneQuery Derived contract for procedure processEnvironment__wrappee__methaneQuery. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) Ensures: (((((((((1 == systemActive) && (\old(pumpRunning) == 0)) && (waterLevel <= 2)) || ((((methaneLevelCritical == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) && ((0 < pumpRunning) || (pumpRunning == 0))) && ((pumpRunning == 0) || (methaneLevelCritical == 0))) && (((1 < waterLevel) || (0 < \old(pumpRunning))) || ((pumpRunning == 0) && (\old(pumpRunning) == 0)))) && (((pumpRunning == \old(pumpRunning)) || (pumpRunning == 0)) || (\old(pumpRunning) < 1))) && ((((((systemActive == \old(systemActive)) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 222]: Procedure Contract for isPumpRunning Derived contract for procedure isPumpRunning. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) Ensures: (((pumpRunning == \result) && (((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)))) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) - ProcedureContractResult [Line: 211]: Procedure Contract for isMethaneAlarm Derived contract for procedure isMethaneAlarm. Requires: ((((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) Ensures: (((methaneLevelCritical == \result) && ((((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)))) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts)))) RESULT: Ultimate proved your program to be correct! [2024-11-16 07:56:23,328 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