./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product46.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_product46.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 73b8e020dd9d30fdd676c81009d4f1b850aa716d63ef29ce3d475a261546f853 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:18:53,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:18:53,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:18:53,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:18:53,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:18:53,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:18:53,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:18:53,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:18:53,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:18:53,413 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:18:53,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:18:53,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:18:53,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:18:53,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:18:53,415 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:18:53,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:18:53,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:18:53,416 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:18:53,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:18:53,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:18:53,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:18:53,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:18:53,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:18:53,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:18:53,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:18:53,419 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:18:53,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:18:53,419 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:18:53,420 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:18:53,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:18:53,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:18:53,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:18:53,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:18:53,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:18:53,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:18:53,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:18:53,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:18:53,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:18:53,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:18:53,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:18:53,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:18:53,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:18:53,427 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 -> 73b8e020dd9d30fdd676c81009d4f1b850aa716d63ef29ce3d475a261546f853 [2024-11-09 23:18:53,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:18:53,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:18:53,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:18:53,727 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:18:53,728 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:18:53,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product46.cil.c [2024-11-09 23:18:55,168 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:18:55,422 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:18:55,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product46.cil.c [2024-11-09 23:18:55,441 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88306c10c/0f3a9b9fe76e43d7a4693b4554138603/FLAG537b6e7f4 [2024-11-09 23:18:55,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88306c10c/0f3a9b9fe76e43d7a4693b4554138603 [2024-11-09 23:18:55,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:18:55,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:18:55,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:18:55,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:18:55,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:18:55,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:18:55" (1/1) ... [2024-11-09 23:18:55,759 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 09.11 11:18:55, skipping insertion in model container [2024-11-09 23:18:55,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:18:55" (1/1) ... [2024-11-09 23:18:55,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:18:56,106 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_product46.cil.c[15211,15224] [2024-11-09 23:18:56,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:18:56,142 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:18:56,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [49] [2024-11-09 23:18:56,152 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [101] [2024-11-09 23:18:56,152 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [206] [2024-11-09 23:18:56,152 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [572] [2024-11-09 23:18:56,153 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [670] [2024-11-09 23:18:56,153 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [705] [2024-11-09 23:18:56,153 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [714] [2024-11-09 23:18:56,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [923] [2024-11-09 23:18:56,215 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_product46.cil.c[15211,15224] [2024-11-09 23:18:56,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:18:56,258 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:18:56,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:18:56 WrapperNode [2024-11-09 23:18:56,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:18:56,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:18:56,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:18:56,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:18:56,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:18:56" (1/1) ... [2024-11-09 23:18:56,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:18:56" (1/1) ... [2024-11-09 23:18:56,308 INFO L138 Inliner]: procedures = 57, calls = 103, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 213 [2024-11-09 23:18:56,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:18:56,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:18:56,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:18:56,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:18:56,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:18:56" (1/1) ... [2024-11-09 23:18:56,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:18:56" (1/1) ... [2024-11-09 23:18:56,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:18:56" (1/1) ... [2024-11-09 23:18:56,342 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-09 23:18:56,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:18:56" (1/1) ... [2024-11-09 23:18:56,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:18:56" (1/1) ... [2024-11-09 23:18:56,347 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:18:56" (1/1) ... [2024-11-09 23:18:56,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:18:56" (1/1) ... [2024-11-09 23:18:56,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:18:56" (1/1) ... [2024-11-09 23:18:56,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:18:56" (1/1) ... [2024-11-09 23:18:56,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:18:56,354 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:18:56,354 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:18:56,354 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:18:56,355 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:18:56" (1/1) ... [2024-11-09 23:18:56,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:18:56,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:18:56,419 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-09 23:18:56,422 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-09 23:18:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:18:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-09 23:18:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-09 23:18:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-09 23:18:56,488 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-09 23:18:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-09 23:18:56,489 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-09 23:18:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-09 23:18:56,489 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-09 23:18:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2024-11-09 23:18:56,489 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2024-11-09 23:18:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2024-11-09 23:18:56,489 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2024-11-09 23:18:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2024-11-09 23:18:56,490 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2024-11-09 23:18:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:18:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-09 23:18:56,490 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-09 23:18:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:18:56,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:18:56,553 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:18:56,556 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:18:56,680 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L653-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~5#1; [2024-11-09 23:18:56,770 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L702-1: valid_product_#res#1 := valid_product_~retValue_acc~8#1; [2024-11-09 23:18:56,770 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L203-1: main_#res#1 := main_~retValue_acc~0#1; [2024-11-09 23:18:56,816 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L667-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~6#1; [2024-11-09 23:18:56,816 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L912-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~11#1; [2024-11-09 23:18:56,820 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L857: #res := ~retValue_acc~10; [2024-11-09 23:18:56,832 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L848: #res#1 := ~retValue_acc~9#1; [2024-11-09 23:18:56,833 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L621-1: isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~4#1; [2024-11-09 23:18:56,866 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-09 23:18:56,867 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:18:56,888 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:18:56,891 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:18:56,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:18:56 BoogieIcfgContainer [2024-11-09 23:18:56,891 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:18:56,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:18:56,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:18:56,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:18:56,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:18:55" (1/3) ... [2024-11-09 23:18:56,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a678ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:18:56, skipping insertion in model container [2024-11-09 23:18:56,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:18:56" (2/3) ... [2024-11-09 23:18:56,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a678ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:18:56, skipping insertion in model container [2024-11-09 23:18:56,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:18:56" (3/3) ... [2024-11-09 23:18:56,899 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product46.cil.c [2024-11-09 23:18:56,911 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:18:56,912 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:18:56,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:18:56,980 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;@2042e364, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:18:56,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:18:56,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 87 states have internal predecessors, (106), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 23:18:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 23:18:56,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:18:57,000 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-09 23:18:57,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:18:57,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:18:57,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1510778337, now seen corresponding path program 1 times [2024-11-09 23:18:57,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:18:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440253680] [2024-11-09 23:18:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:18:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:18:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:57,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 23:18:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:57,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:18:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:57,224 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-09 23:18:57,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:18:57,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440253680] [2024-11-09 23:18:57,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440253680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:18:57,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:18:57,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:18:57,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076226676] [2024-11-09 23:18:57,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:18:57,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:18:57,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:18:57,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:18:57,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:18:57,262 INFO L87 Difference]: Start difference. First operand has 103 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 87 states have internal predecessors, (106), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) 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-09 23:18:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:18:57,295 INFO L93 Difference]: Finished difference Result 196 states and 261 transitions. [2024-11-09 23:18:57,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:18:57,298 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-09 23:18:57,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:18:57,306 INFO L225 Difference]: With dead ends: 196 [2024-11-09 23:18:57,307 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 23:18:57,310 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-09 23:18:57,313 INFO L432 NwaCegarLoop]: 127 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, 127 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-09 23:18:57,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:18:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 23:18:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 23:18:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 77 states have internal predecessors, (90), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 23:18:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 117 transitions. [2024-11-09 23:18:57,362 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 117 transitions. Word has length 34 [2024-11-09 23:18:57,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:18:57,362 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 117 transitions. [2024-11-09 23:18:57,362 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-09 23:18:57,362 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 117 transitions. [2024-11-09 23:18:57,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 23:18:57,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:18:57,368 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] [2024-11-09 23:18:57,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:18:57,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:18:57,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:18:57,370 INFO L85 PathProgramCache]: Analyzing trace with hash 968612012, now seen corresponding path program 1 times [2024-11-09 23:18:57,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:18:57,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633024111] [2024-11-09 23:18:57,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:18:57,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:18:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:57,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 23:18:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:57,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:18:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:57,568 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-09 23:18:57,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:18:57,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633024111] [2024-11-09 23:18:57,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633024111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:18:57,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:18:57,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:18:57,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415889840] [2024-11-09 23:18:57,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:18:57,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:18:57,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:18:57,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:18:57,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:18:57,576 INFO L87 Difference]: Start difference. First operand 92 states and 117 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-09 23:18:57,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:18:57,617 INFO L93 Difference]: Finished difference Result 176 states and 229 transitions. [2024-11-09 23:18:57,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:18:57,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 39 [2024-11-09 23:18:57,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:18:57,623 INFO L225 Difference]: With dead ends: 176 [2024-11-09 23:18:57,623 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 23:18:57,625 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-09 23:18:57,626 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 107 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 115 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-09 23:18:57,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 115 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:18:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 23:18:57,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 23:18:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 77 states have internal predecessors, (89), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 23:18:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2024-11-09 23:18:57,641 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 39 [2024-11-09 23:18:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:18:57,642 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2024-11-09 23:18:57,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-09 23:18:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2024-11-09 23:18:57,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 23:18:57,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:18:57,645 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] [2024-11-09 23:18:57,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:18:57,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:18:57,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:18:57,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1298231942, now seen corresponding path program 1 times [2024-11-09 23:18:57,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:18:57,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199135268] [2024-11-09 23:18:57,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:18:57,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:18:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:57,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 23:18:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:57,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 23:18:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:57,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:18:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:57,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:18:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:57,788 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-09 23:18:57,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:18:57,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199135268] [2024-11-09 23:18:57,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199135268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:18:57,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:18:57,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:18:57,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108628167] [2024-11-09 23:18:57,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:18:57,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:18:57,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:18:57,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:18:57,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:18:57,792 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 23:18:58,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:18:58,153 INFO L93 Difference]: Finished difference Result 300 states and 399 transitions. [2024-11-09 23:18:58,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:18:58,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 49 [2024-11-09 23:18:58,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:18:58,156 INFO L225 Difference]: With dead ends: 300 [2024-11-09 23:18:58,158 INFO L226 Difference]: Without dead ends: 216 [2024-11-09 23:18:58,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:18:58,164 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 255 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:18:58,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 377 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:18:58,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-09 23:18:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 191. [2024-11-09 23:18:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 146 states have (on average 1.226027397260274) internal successors, (179), 152 states have internal predecessors, (179), 26 states have call successors, (26), 18 states have call predecessors, (26), 18 states have return successors, (38), 26 states have call predecessors, (38), 24 states have call successors, (38) [2024-11-09 23:18:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 243 transitions. [2024-11-09 23:18:58,210 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 243 transitions. Word has length 49 [2024-11-09 23:18:58,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:18:58,211 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 243 transitions. [2024-11-09 23:18:58,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 23:18:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 243 transitions. [2024-11-09 23:18:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 23:18:58,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:18:58,213 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] [2024-11-09 23:18:58,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:18:58,213 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:18:58,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:18:58,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1058094358, now seen corresponding path program 1 times [2024-11-09 23:18:58,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:18:58,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732207080] [2024-11-09 23:18:58,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:18:58,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:18:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:58,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 23:18:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:58,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 23:18:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:58,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:18:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:58,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 23:18:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:58,424 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-09 23:18:58,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:18:58,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732207080] [2024-11-09 23:18:58,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732207080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:18:58,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:18:58,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:18:58,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119866371] [2024-11-09 23:18:58,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:18:58,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:18:58,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:18:58,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:18:58,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:18:58,428 INFO L87 Difference]: Start difference. First operand 191 states and 243 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 23:18:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:18:58,776 INFO L93 Difference]: Finished difference Result 381 states and 495 transitions. [2024-11-09 23:18:58,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:18:58,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2024-11-09 23:18:58,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:18:58,780 INFO L225 Difference]: With dead ends: 381 [2024-11-09 23:18:58,783 INFO L226 Difference]: Without dead ends: 198 [2024-11-09 23:18:58,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 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-09 23:18:58,785 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 170 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:18:58,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 493 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:18:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-09 23:18:58,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 189. [2024-11-09 23:18:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 144 states have (on average 1.2013888888888888) internal successors, (173), 150 states have internal predecessors, (173), 26 states have call successors, (26), 18 states have call predecessors, (26), 18 states have return successors, (38), 26 states have call predecessors, (38), 24 states have call successors, (38) [2024-11-09 23:18:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 237 transitions. [2024-11-09 23:18:58,821 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 237 transitions. Word has length 55 [2024-11-09 23:18:58,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:18:58,823 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 237 transitions. [2024-11-09 23:18:58,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 23:18:58,823 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 237 transitions. [2024-11-09 23:18:58,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 23:18:58,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:18:58,829 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-09 23:18:58,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:18:58,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:18:58,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:18:58,830 INFO L85 PathProgramCache]: Analyzing trace with hash -749552189, now seen corresponding path program 1 times [2024-11-09 23:18:58,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:18:58,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179497700] [2024-11-09 23:18:58,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:18:58,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:18:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:58,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 23:18:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:58,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 23:18:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:58,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:18:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:58,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 23:18:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:58,959 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-09 23:18:58,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:18:58,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179497700] [2024-11-09 23:18:58,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179497700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:18:58,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:18:58,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:18:58,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150985090] [2024-11-09 23:18:58,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:18:58,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:18:58,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:18:58,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:18:58,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:18:58,962 INFO L87 Difference]: Start difference. First operand 189 states and 237 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 23:18:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:18:59,146 INFO L93 Difference]: Finished difference Result 382 states and 496 transitions. [2024-11-09 23:18:59,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:18:59,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 61 [2024-11-09 23:18:59,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:18:59,149 INFO L225 Difference]: With dead ends: 382 [2024-11-09 23:18:59,149 INFO L226 Difference]: Without dead ends: 201 [2024-11-09 23:18:59,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 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-09 23:18:59,151 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 64 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:18:59,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 427 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:18:59,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-09 23:18:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 192. [2024-11-09 23:18:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 147 states have (on average 1.1972789115646258) internal successors, (176), 153 states have internal predecessors, (176), 26 states have call successors, (26), 18 states have call predecessors, (26), 18 states have return successors, (38), 26 states have call predecessors, (38), 24 states have call successors, (38) [2024-11-09 23:18:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 240 transitions. [2024-11-09 23:18:59,171 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 240 transitions. Word has length 61 [2024-11-09 23:18:59,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:18:59,171 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 240 transitions. [2024-11-09 23:18:59,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 23:18:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 240 transitions. [2024-11-09 23:18:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 23:18:59,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:18:59,173 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] [2024-11-09 23:18:59,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:18:59,174 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:18:59,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:18:59,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2061100411, now seen corresponding path program 1 times [2024-11-09 23:18:59,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:18:59,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605562526] [2024-11-09 23:18:59,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:18:59,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:18:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:59,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:18:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:59,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:18:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:59,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:18:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:59,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 23:18:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:59,241 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-09 23:18:59,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:18:59,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605562526] [2024-11-09 23:18:59,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605562526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:18:59,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:18:59,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:18:59,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96357464] [2024-11-09 23:18:59,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:18:59,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:18:59,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:18:59,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:18:59,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:18:59,243 INFO L87 Difference]: Start difference. First operand 192 states and 240 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 23:18:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:18:59,330 INFO L93 Difference]: Finished difference Result 310 states and 370 transitions. [2024-11-09 23:18:59,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:18:59,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2024-11-09 23:18:59,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:18:59,333 INFO L225 Difference]: With dead ends: 310 [2024-11-09 23:18:59,334 INFO L226 Difference]: Without dead ends: 164 [2024-11-09 23:18:59,334 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-09 23:18:59,335 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 67 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:18:59,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 188 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:18:59,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-09 23:18:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2024-11-09 23:18:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 124 states have (on average 1.217741935483871) internal successors, (151), 132 states have internal predecessors, (151), 18 states have call successors, (18), 15 states have call predecessors, (18), 18 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2024-11-09 23:18:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 192 transitions. [2024-11-09 23:18:59,356 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 192 transitions. Word has length 58 [2024-11-09 23:18:59,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:18:59,356 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 192 transitions. [2024-11-09 23:18:59,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 23:18:59,356 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 192 transitions. [2024-11-09 23:18:59,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 23:18:59,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:18:59,358 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-09 23:18:59,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:18:59,358 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:18:59,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:18:59,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1004288734, now seen corresponding path program 1 times [2024-11-09 23:18:59,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:18:59,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203581372] [2024-11-09 23:18:59,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:18:59,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:18:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:59,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 23:18:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:59,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 23:18:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:59,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:18:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:59,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 23:18:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:59,473 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-09 23:18:59,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:18:59,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203581372] [2024-11-09 23:18:59,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203581372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:18:59,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:18:59,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:18:59,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630994072] [2024-11-09 23:18:59,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:18:59,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:18:59,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:18:59,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:18:59,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:18:59,475 INFO L87 Difference]: Start difference. First operand 161 states and 192 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 23:18:59,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:18:59,595 INFO L93 Difference]: Finished difference Result 319 states and 387 transitions. [2024-11-09 23:18:59,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:18:59,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 61 [2024-11-09 23:18:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:18:59,598 INFO L225 Difference]: With dead ends: 319 [2024-11-09 23:18:59,598 INFO L226 Difference]: Without dead ends: 166 [2024-11-09 23:18:59,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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-09 23:18:59,600 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 57 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:18:59,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 278 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:18:59,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-09 23:18:59,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2024-11-09 23:18:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 126 states have (on average 1.2142857142857142) internal successors, (153), 134 states have internal predecessors, (153), 18 states have call successors, (18), 15 states have call predecessors, (18), 18 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2024-11-09 23:18:59,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 194 transitions. [2024-11-09 23:18:59,621 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 194 transitions. Word has length 61 [2024-11-09 23:18:59,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:18:59,621 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 194 transitions. [2024-11-09 23:18:59,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 23:18:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 194 transitions. [2024-11-09 23:18:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 23:18:59,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:18:59,623 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-09 23:18:59,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:18:59,623 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:18:59,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:18:59,624 INFO L85 PathProgramCache]: Analyzing trace with hash -981656480, now seen corresponding path program 1 times [2024-11-09 23:18:59,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:18:59,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036368861] [2024-11-09 23:18:59,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:18:59,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:18:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:59,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 23:18:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:59,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 23:18:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:59,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:18:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:59,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 23:18:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:18:59,727 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-09 23:18:59,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:18:59,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036368861] [2024-11-09 23:18:59,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036368861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:18:59,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:18:59,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:18:59,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105004774] [2024-11-09 23:18:59,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:18:59,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:18:59,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:18:59,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:18:59,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:18:59,729 INFO L87 Difference]: Start difference. First operand 163 states and 194 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 23:18:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:18:59,928 INFO L93 Difference]: Finished difference Result 451 states and 562 transitions. [2024-11-09 23:18:59,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:18:59,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 61 [2024-11-09 23:18:59,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:18:59,931 INFO L225 Difference]: With dead ends: 451 [2024-11-09 23:18:59,931 INFO L226 Difference]: Without dead ends: 296 [2024-11-09 23:18:59,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-09 23:18:59,933 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 220 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:18:59,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 291 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:18:59,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-09 23:18:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 293. [2024-11-09 23:18:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 224 states have (on average 1.2008928571428572) internal successors, (269), 236 states have internal predecessors, (269), 36 states have call successors, (36), 31 states have call predecessors, (36), 32 states have return successors, (51), 36 states have call predecessors, (51), 36 states have call successors, (51) [2024-11-09 23:18:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 356 transitions. [2024-11-09 23:18:59,956 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 356 transitions. Word has length 61 [2024-11-09 23:18:59,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:18:59,957 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 356 transitions. [2024-11-09 23:18:59,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 23:18:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 356 transitions. [2024-11-09 23:18:59,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 23:18:59,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:18:59,958 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] [2024-11-09 23:18:59,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:18:59,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:18:59,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:18:59,959 INFO L85 PathProgramCache]: Analyzing trace with hash -363250814, now seen corresponding path program 1 times [2024-11-09 23:18:59,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:18:59,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19484558] [2024-11-09 23:18:59,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:18:59,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:18:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:00,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:19:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:00,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:19:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:00,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:19:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:00,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:19:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:00,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 23:19:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:00,216 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-09 23:19:00,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:00,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19484558] [2024-11-09 23:19:00,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19484558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:19:00,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:19:00,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:19:00,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498952658] [2024-11-09 23:19:00,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:19:00,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:19:00,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:00,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:19:00,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:19:00,218 INFO L87 Difference]: Start difference. First operand 293 states and 356 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (6), 4 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-09 23:19:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:00,734 INFO L93 Difference]: Finished difference Result 836 states and 1045 transitions. [2024-11-09 23:19:00,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 23:19:00,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (6), 4 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 65 [2024-11-09 23:19:00,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:00,738 INFO L225 Difference]: With dead ends: 836 [2024-11-09 23:19:00,738 INFO L226 Difference]: Without dead ends: 602 [2024-11-09 23:19:00,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:19:00,740 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 468 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:00,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 540 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:19:00,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-09 23:19:00,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 543. [2024-11-09 23:19:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 415 states have (on average 1.1951807228915663) internal successors, (496), 439 states have internal predecessors, (496), 66 states have call successors, (66), 55 states have call predecessors, (66), 61 states have return successors, (90), 66 states have call predecessors, (90), 66 states have call successors, (90) [2024-11-09 23:19:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 652 transitions. [2024-11-09 23:19:00,782 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 652 transitions. Word has length 65 [2024-11-09 23:19:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:00,783 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 652 transitions. [2024-11-09 23:19:00,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (6), 4 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-09 23:19:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 652 transitions. [2024-11-09 23:19:00,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 23:19:00,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:00,784 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:19:00,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:19:00,784 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:00,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:00,785 INFO L85 PathProgramCache]: Analyzing trace with hash 498527982, now seen corresponding path program 1 times [2024-11-09 23:19:00,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:00,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316724675] [2024-11-09 23:19:00,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:00,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:00,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:19:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:00,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 23:19:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:00,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 23:19:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:00,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:19:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:00,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:19:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:00,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 23:19:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:01,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:19:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:01,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 23:19:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:01,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:19:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:01,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 23:19:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 23:19:01,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:01,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316724675] [2024-11-09 23:19:01,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316724675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:19:01,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606683833] [2024-11-09 23:19:01,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:01,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:01,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:01,021 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-09 23:19:01,023 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-09 23:19:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:01,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:19:01,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:19:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:19:01,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:19:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 23:19:01,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606683833] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:19:01,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:19:01,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 15 [2024-11-09 23:19:01,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596093213] [2024-11-09 23:19:01,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:19:01,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 23:19:01,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:01,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 23:19:01,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:19:01,554 INFO L87 Difference]: Start difference. First operand 543 states and 652 transitions. Second operand has 15 states, 15 states have (on average 8.4) internal successors, (126), 10 states have internal predecessors, (126), 6 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-09 23:19:02,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:02,621 INFO L93 Difference]: Finished difference Result 1193 states and 1467 transitions. [2024-11-09 23:19:02,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 23:19:02,622 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.4) internal successors, (126), 10 states have internal predecessors, (126), 6 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) Word has length 109 [2024-11-09 23:19:02,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:02,626 INFO L225 Difference]: With dead ends: 1193 [2024-11-09 23:19:02,626 INFO L226 Difference]: Without dead ends: 707 [2024-11-09 23:19:02,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 243 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=438, Invalid=1454, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 23:19:02,629 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 518 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:02,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 909 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 23:19:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-09 23:19:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 615. [2024-11-09 23:19:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 465 states have (on average 1.1935483870967742) internal successors, (555), 497 states have internal predecessors, (555), 77 states have call successors, (77), 66 states have call predecessors, (77), 72 states have return successors, (101), 74 states have call predecessors, (101), 77 states have call successors, (101) [2024-11-09 23:19:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 733 transitions. [2024-11-09 23:19:02,676 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 733 transitions. Word has length 109 [2024-11-09 23:19:02,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:02,677 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 733 transitions. [2024-11-09 23:19:02,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.4) internal successors, (126), 10 states have internal predecessors, (126), 6 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-09 23:19:02,677 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 733 transitions. [2024-11-09 23:19:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-09 23:19:02,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:02,682 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, 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, 1, 1, 1, 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-09 23:19:02,701 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-09 23:19:02,883 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-09 23:19:02,884 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:02,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:02,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1996459103, now seen corresponding path program 1 times [2024-11-09 23:19:02,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:02,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360772005] [2024-11-09 23:19:02,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:02,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:19:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 23:19:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 23:19:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:19:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:19:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 23:19:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 23:19:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:19:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 23:19:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:19:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 23:19:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 23:19:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:19:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-09 23:19:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 23:19:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-09 23:19:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:19:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-09 23:19:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 109 proven. 13 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 23:19:03,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:03,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360772005] [2024-11-09 23:19:03,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360772005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:19:03,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098334914] [2024-11-09 23:19:03,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:03,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:03,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:03,363 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-09 23:19:03,364 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-09 23:19:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:03,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 23:19:03,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:19:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 162 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-09 23:19:03,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:19:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 82 proven. 42 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-09 23:19:04,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098334914] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:19:04,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:19:04,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 11] total 29 [2024-11-09 23:19:04,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50026957] [2024-11-09 23:19:04,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:19:04,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 23:19:04,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:04,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 23:19:04,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2024-11-09 23:19:04,189 INFO L87 Difference]: Start difference. First operand 615 states and 733 transitions. Second operand has 29 states, 29 states have (on average 7.724137931034483) internal successors, (224), 23 states have internal predecessors, (224), 9 states have call successors, (35), 8 states have call predecessors, (35), 12 states have return successors, (38), 10 states have call predecessors, (38), 9 states have call successors, (38) [2024-11-09 23:19:06,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:06,186 INFO L93 Difference]: Finished difference Result 1798 states and 2238 transitions. [2024-11-09 23:19:06,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-09 23:19:06,187 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.724137931034483) internal successors, (224), 23 states have internal predecessors, (224), 9 states have call successors, (35), 8 states have call predecessors, (35), 12 states have return successors, (38), 10 states have call predecessors, (38), 9 states have call successors, (38) Word has length 197 [2024-11-09 23:19:06,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:06,193 INFO L225 Difference]: With dead ends: 1798 [2024-11-09 23:19:06,193 INFO L226 Difference]: Without dead ends: 1191 [2024-11-09 23:19:06,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 426 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1454 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=987, Invalid=4563, Unknown=0, NotChecked=0, Total=5550 [2024-11-09 23:19:06,199 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 1355 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 1831 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 2340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 1831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:06,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 1282 Invalid, 2340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 1831 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 23:19:06,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2024-11-09 23:19:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1090. [2024-11-09 23:19:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 830 states have (on average 1.1397590361445784) internal successors, (946), 875 states have internal predecessors, (946), 138 states have call successors, (138), 121 states have call predecessors, (138), 121 states have return successors, (160), 127 states have call predecessors, (160), 138 states have call successors, (160) [2024-11-09 23:19:06,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1244 transitions. [2024-11-09 23:19:06,302 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1244 transitions. Word has length 197 [2024-11-09 23:19:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:06,302 INFO L471 AbstractCegarLoop]: Abstraction has 1090 states and 1244 transitions. [2024-11-09 23:19:06,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.724137931034483) internal successors, (224), 23 states have internal predecessors, (224), 9 states have call successors, (35), 8 states have call predecessors, (35), 12 states have return successors, (38), 10 states have call predecessors, (38), 9 states have call successors, (38) [2024-11-09 23:19:06,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1244 transitions. [2024-11-09 23:19:06,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-09 23:19:06,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:06,307 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, 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, 1, 1, 1, 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-09 23:19:06,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 23:19:06,507 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-09 23:19:06,508 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:06,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:06,509 INFO L85 PathProgramCache]: Analyzing trace with hash 580773471, now seen corresponding path program 1 times [2024-11-09 23:19:06,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:06,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026606732] [2024-11-09 23:19:06,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:06,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:19:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 23:19:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 23:19:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:19:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:19:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 23:19:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 23:19:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:19:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 23:19:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:19:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 23:19:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 23:19:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 23:19:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 23:19:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:19:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:19:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-09 23:19:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-09 23:19:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-09 23:19:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:19:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-09 23:19:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 46 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 23:19:06,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026606732] [2024-11-09 23:19:06,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026606732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:19:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073790098] [2024-11-09 23:19:06,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:06,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:06,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:06,817 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-09 23:19:06,819 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-09 23:19:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:06,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 23:19:06,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:19:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 200 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 23:19:07,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:19:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 104 proven. 54 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-09 23:19:07,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073790098] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:19:07,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:19:07,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 22 [2024-11-09 23:19:07,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179796488] [2024-11-09 23:19:07,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:19:07,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 23:19:07,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:07,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 23:19:07,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-11-09 23:19:07,586 INFO L87 Difference]: Start difference. First operand 1090 states and 1244 transitions. Second operand has 22 states, 22 states have (on average 9.818181818181818) internal successors, (216), 15 states have internal predecessors, (216), 7 states have call successors, (45), 8 states have call predecessors, (45), 11 states have return successors, (39), 9 states have call predecessors, (39), 7 states have call successors, (39) [2024-11-09 23:19:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:08,914 INFO L93 Difference]: Finished difference Result 2126 states and 2453 transitions. [2024-11-09 23:19:08,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 23:19:08,915 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.818181818181818) internal successors, (216), 15 states have internal predecessors, (216), 7 states have call successors, (45), 8 states have call predecessors, (45), 11 states have return successors, (39), 9 states have call predecessors, (39), 7 states have call successors, (39) Word has length 213 [2024-11-09 23:19:08,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:08,921 INFO L225 Difference]: With dead ends: 2126 [2024-11-09 23:19:08,921 INFO L226 Difference]: Without dead ends: 1142 [2024-11-09 23:19:08,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 468 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=449, Invalid=1807, Unknown=0, NotChecked=0, Total=2256 [2024-11-09 23:19:08,925 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 639 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:08,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 408 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1639 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 23:19:08,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-11-09 23:19:09,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1086. [2024-11-09 23:19:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 828 states have (on average 1.1292270531400965) internal successors, (935), 871 states have internal predecessors, (935), 132 states have call successors, (132), 123 states have call predecessors, (132), 125 states have return successors, (154), 125 states have call predecessors, (154), 132 states have call successors, (154) [2024-11-09 23:19:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1221 transitions. [2024-11-09 23:19:09,011 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1221 transitions. Word has length 213 [2024-11-09 23:19:09,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:09,011 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1221 transitions. [2024-11-09 23:19:09,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.818181818181818) internal successors, (216), 15 states have internal predecessors, (216), 7 states have call successors, (45), 8 states have call predecessors, (45), 11 states have return successors, (39), 9 states have call predecessors, (39), 7 states have call successors, (39) [2024-11-09 23:19:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1221 transitions. [2024-11-09 23:19:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-09 23:19:09,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:09,016 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, 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, 1, 1, 1, 1, 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-09 23:19:09,034 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-09 23:19:09,216 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-09 23:19:09,217 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:09,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:09,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1545344045, now seen corresponding path program 1 times [2024-11-09 23:19:09,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:09,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138712965] [2024-11-09 23:19:09,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:09,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:19:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 23:19:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 23:19:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:19:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:19:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 23:19:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 23:19:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:19:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 23:19:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:19:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 23:19:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 23:19:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 23:19:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 23:19:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:19:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:19:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-09 23:19:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-09 23:19:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-09 23:19:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:19:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-09 23:19:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 86 proven. 9 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-09 23:19:09,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:09,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138712965] [2024-11-09 23:19:09,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138712965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:19:09,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541571813] [2024-11-09 23:19:09,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:09,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:09,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:09,527 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-09 23:19:09,529 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-09 23:19:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:09,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 23:19:09,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:19:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 142 proven. 26 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 23:19:09,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:19:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 103 proven. 45 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-09 23:19:10,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541571813] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:19:10,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:19:10,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 13] total 28 [2024-11-09 23:19:10,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113752280] [2024-11-09 23:19:10,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:19:10,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 23:19:10,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:10,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 23:19:10,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2024-11-09 23:19:10,523 INFO L87 Difference]: Start difference. First operand 1086 states and 1221 transitions. Second operand has 28 states, 28 states have (on average 9.285714285714286) internal successors, (260), 22 states have internal predecessors, (260), 14 states have call successors, (48), 12 states have call predecessors, (48), 15 states have return successors, (49), 14 states have call predecessors, (49), 14 states have call successors, (49) [2024-11-09 23:19:13,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:13,391 INFO L93 Difference]: Finished difference Result 2412 states and 2763 transitions. [2024-11-09 23:19:13,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-11-09 23:19:13,392 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.285714285714286) internal successors, (260), 22 states have internal predecessors, (260), 14 states have call successors, (48), 12 states have call predecessors, (48), 15 states have return successors, (49), 14 states have call predecessors, (49), 14 states have call successors, (49) Word has length 214 [2024-11-09 23:19:13,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:13,399 INFO L225 Difference]: With dead ends: 2412 [2024-11-09 23:19:13,399 INFO L226 Difference]: Without dead ends: 1438 [2024-11-09 23:19:13,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 467 SyntacticMatches, 7 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2029 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1508, Invalid=6148, Unknown=0, NotChecked=0, Total=7656 [2024-11-09 23:19:13,404 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1915 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 3843 mSolverCounterSat, 657 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1915 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 4500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 657 IncrementalHoareTripleChecker+Valid, 3843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:13,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1915 Valid, 1104 Invalid, 4500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [657 Valid, 3843 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 23:19:13,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2024-11-09 23:19:13,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1290. [2024-11-09 23:19:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 985 states have (on average 1.1248730964467004) internal successors, (1108), 1021 states have internal predecessors, (1108), 160 states have call successors, (160), 151 states have call predecessors, (160), 144 states have return successors, (176), 144 states have call predecessors, (176), 160 states have call successors, (176) [2024-11-09 23:19:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1444 transitions. [2024-11-09 23:19:13,544 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1444 transitions. Word has length 214 [2024-11-09 23:19:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:13,545 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 1444 transitions. [2024-11-09 23:19:13,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.285714285714286) internal successors, (260), 22 states have internal predecessors, (260), 14 states have call successors, (48), 12 states have call predecessors, (48), 15 states have return successors, (49), 14 states have call predecessors, (49), 14 states have call successors, (49) [2024-11-09 23:19:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1444 transitions. [2024-11-09 23:19:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-09 23:19:13,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:13,550 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 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-09 23:19:13,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 23:19:13,750 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-09 23:19:13,750 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:13,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:13,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1252614756, now seen corresponding path program 1 times [2024-11-09 23:19:13,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:13,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117788922] [2024-11-09 23:19:13,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:13,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:19:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 23:19:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 23:19:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:19:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:19:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 23:19:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 23:19:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:19:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 23:19:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:19:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 23:19:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 23:19:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 23:19:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 23:19:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:19:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:19:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-09 23:19:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-09 23:19:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-09 23:19:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 23:19:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 23:19:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:19:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 23:19:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-09 23:19:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-11-09 23:19:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-09 23:19:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:19:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-09 23:19:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 185 proven. 38 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-11-09 23:19:14,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:14,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117788922] [2024-11-09 23:19:14,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117788922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:19:14,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111368314] [2024-11-09 23:19:14,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:14,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:14,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:14,354 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:19:14,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 23:19:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:14,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 23:19:14,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:19:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 159 proven. 91 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-09 23:19:14,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:19:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 100 proven. 138 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2024-11-09 23:19:15,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111368314] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:19:15,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:19:15,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 16] total 29 [2024-11-09 23:19:15,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549106051] [2024-11-09 23:19:15,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:19:15,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 23:19:15,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:15,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 23:19:15,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2024-11-09 23:19:15,539 INFO L87 Difference]: Start difference. First operand 1290 states and 1444 transitions. Second operand has 29 states, 29 states have (on average 10.827586206896552) internal successors, (314), 25 states have internal predecessors, (314), 18 states have call successors, (59), 13 states have call predecessors, (59), 19 states have return successors, (62), 18 states have call predecessors, (62), 18 states have call successors, (62) [2024-11-09 23:19:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:16,825 INFO L93 Difference]: Finished difference Result 2029 states and 2288 transitions. [2024-11-09 23:19:16,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 23:19:16,826 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 10.827586206896552) internal successors, (314), 25 states have internal predecessors, (314), 18 states have call successors, (59), 13 states have call predecessors, (59), 19 states have return successors, (62), 18 states have call predecessors, (62), 18 states have call successors, (62) Word has length 269 [2024-11-09 23:19:16,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:16,828 INFO L225 Difference]: With dead ends: 2029 [2024-11-09 23:19:16,828 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 23:19:16,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 577 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=582, Invalid=1968, Unknown=0, NotChecked=0, Total=2550 [2024-11-09 23:19:16,834 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 927 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 2685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:16,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 632 Invalid, 2685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:19:16,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 23:19:16,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 23:19:16,835 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-09 23:19:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 23:19:16,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 269 [2024-11-09 23:19:16,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:16,837 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 23:19:16,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 10.827586206896552) internal successors, (314), 25 states have internal predecessors, (314), 18 states have call successors, (59), 13 states have call predecessors, (59), 19 states have return successors, (62), 18 states have call predecessors, (62), 18 states have call successors, (62) [2024-11-09 23:19:16,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 23:19:16,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 23:19:16,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:19:16,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 23:19:17,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 23:19:17,045 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:17,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 23:19:29,683 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:19:29,737 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (and (let ((.cse2 (= |old(~methaneLevelCritical~0)| 0)) (.cse1 (= 2 ~waterLevel~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse3 (<= 1 |old(~methaneLevelCritical~0)|)) (.cse7 (= ~waterLevel~0 0)) (.cse5 (<= 1 ~pumpRunning~0)) (.cse4 (= ~waterLevel~0 1)) (.cse6 (<= 1 ~switchedOnBeforeTS~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse0 .cse2 .cse4) (and .cse0 .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse7) (and .cse5 .cse1) (and .cse0 .cse3 .cse7) (and .cse5 .cse4 .cse6))) (= |old(~methaneLevelCritical~0)| ~methaneLevelCritical~0) (= 1 ~systemActive~0) (or (< ~pumpRunning~0 1) (= ~methaneLevelCritical~0 0))) Eliminated clause: (let ((.cse3 (= ~methaneLevelCritical~0 0))) (and (let ((.cse1 (<= 1 ~methaneLevelCritical~0)) (.cse5 (= ~waterLevel~0 0)) (.cse0 (= ~pumpRunning~0 0)) (.cse2 (= 2 ~waterLevel~0)) (.cse6 (<= 1 ~pumpRunning~0)) (.cse4 (= ~waterLevel~0 1)) (.cse7 (<= 1 ~switchedOnBeforeTS~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse1 .cse5) (and .cse6 .cse7 .cse5) (and .cse6 .cse2) (and .cse0 .cse1 .cse4) (and .cse0 .cse3 .cse5) (and .cse0 .cse2 .cse3) (and .cse6 .cse4 .cse7))) (= 1 ~systemActive~0) (or (< ~pumpRunning~0 1) .cse3))) [2024-11-09 23:19:29,773 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse5 (= |old(~waterLevel~0)| 1))) (let ((.cse3 (= 1 ~systemActive~0)) (.cse12 (= |old(~waterLevel~0)| 2)) (.cse13 (= |old(~waterLevel~0)| 0)) (.cse1 (= ~pumpRunning~0 |old(~pumpRunning~0)|)) (.cse2 (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|)) (.cse4 (= ~waterLevel~0 1)) (.cse11 (= |old(~pumpRunning~0)| 0)) (.cse0 (not .cse5))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 (<= 1 ~switchedOnBeforeTS~0)) (< |old(~pumpRunning~0)| 1)) (let ((.cse8 (<= |old(~waterLevel~0)| 2)) (.cse6 (= ~methaneLevelCritical~0 0)) (.cse10 (<= 1 ~methaneLevelCritical~0)) (.cse7 (<= 1 |old(~switchedOnBeforeTS~0)|)) (.cse9 (<= 1 |old(~pumpRunning~0)|))) (or (and .cse5 .cse6 .cse3 .cse7 .cse8 .cse9) (and .cse10 .cse3 .cse11 .cse12) (and .cse5 .cse6 .cse3 .cse11) (and .cse6 .cse3 .cse9 .cse12) (and .cse10 .cse3 .cse9 .cse12) (and .cse6 .cse3 .cse11 .cse12) (and .cse10 .cse5 .cse3 .cse11) (and .cse10 .cse5 .cse9) (and .cse6 .cse3 .cse7 .cse8 .cse13 .cse9) (and .cse10 .cse3 .cse11 .cse13) (and .cse6 .cse3 .cse11 .cse13) (and .cse10 .cse3 .cse7 .cse13 .cse9))) (or (and .cse1 (= 2 ~waterLevel~0) .cse2) (not .cse12)) (or (not .cse13) (and .cse1 .cse2 (= ~waterLevel~0 0))) (or (and (= ~pumpRunning~0 0) .cse2 .cse4) (not .cse11) .cse0)))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int) (|old(~switchedOnBeforeTS~0)| Int) (|old(~waterLevel~0)| Int)) (let ((.cse9 (= |old(~waterLevel~0)| 1))) (let ((.cse1 (= ~pumpRunning~0 |old(~pumpRunning~0)|)) (.cse5 (= |old(~waterLevel~0)| 2)) (.cse3 (= 1 ~systemActive~0)) (.cse6 (= |old(~waterLevel~0)| 0)) (.cse2 (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|)) (.cse4 (= ~waterLevel~0 1)) (.cse8 (= |old(~pumpRunning~0)| 0)) (.cse0 (not .cse9))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 (<= 1 ~switchedOnBeforeTS~0)) (< |old(~pumpRunning~0)| 1)) (or (and .cse1 (= 2 ~waterLevel~0) .cse2) (not .cse5)) (or (not .cse6) (and .cse1 .cse2 (= ~waterLevel~0 0))) (let ((.cse10 (= ~methaneLevelCritical~0 0)) (.cse7 (<= 1 ~methaneLevelCritical~0)) (.cse11 (<= 1 |old(~switchedOnBeforeTS~0)|)) (.cse12 (<= 1 |old(~pumpRunning~0)|))) (or (and .cse7 .cse3 .cse8 .cse5) (and .cse9 .cse10 .cse3 .cse8) (and .cse9 .cse10 .cse3 .cse11 .cse12) (and .cse10 .cse3 .cse11 .cse6 .cse12) (and .cse10 .cse3 .cse12 .cse5) (and .cse7 .cse3 .cse12 .cse5) (and .cse10 .cse3 .cse8 .cse5) (and .cse7 .cse9 .cse3 .cse8) (and .cse7 .cse9 .cse12) (and .cse7 .cse3 .cse8 .cse6) (and .cse10 .cse3 .cse8 .cse6) (and .cse7 .cse3 .cse11 .cse6 .cse12))) (or (and (= ~pumpRunning~0 0) .cse2 .cse4) (not .cse8) .cse0))))) [2024-11-09 23:19:29,800 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 23:19:29,824 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (let ((.cse1 (= |old(~waterLevel~0)| 1)) (.cse2 (= |old(~waterLevel~0)| 2)) (.cse0 (= |old(~waterLevel~0)| 0))) (and (or (not .cse0) (= ~waterLevel~0 0)) (or (not .cse1) (= ~waterLevel~0 1)) (or (= 2 ~waterLevel~0) (not .cse2)) (let ((.cse4 (<= 1 ~methaneLevelCritical~0)) (.cse6 (<= 1 ~pumpRunning~0)) (.cse8 (<= 1 ~switchedOnBeforeTS~0)) (.cse3 (= ~pumpRunning~0 0)) (.cse7 (= ~methaneLevelCritical~0 0)) (.cse5 (= 1 ~systemActive~0))) (or (and .cse3 .cse4 .cse5 .cse2) (and .cse6 .cse7 .cse5 .cse2) (and .cse3 .cse4 .cse5 .cse0) (and .cse6 .cse7 .cse5 .cse8 .cse0) (and .cse3 .cse1 .cse7 .cse5) (and .cse3 .cse4 .cse1 .cse5) (and .cse6 .cse1 .cse7 .cse5 .cse8) (and .cse3 .cse7 .cse5 .cse2) (and .cse3 .cse7 .cse5 .cse0))))) Eliminated clause: (exists ((|old(~waterLevel~0)| Int)) (let ((.cse1 (= |old(~waterLevel~0)| 1)) (.cse2 (= |old(~waterLevel~0)| 2)) (.cse0 (= |old(~waterLevel~0)| 0))) (and (or (not .cse0) (= ~waterLevel~0 0)) (or (not .cse1) (= ~waterLevel~0 1)) (or (= 2 ~waterLevel~0) (not .cse2)) (let ((.cse4 (<= 1 ~methaneLevelCritical~0)) (.cse6 (<= 1 ~pumpRunning~0)) (.cse8 (<= 1 ~switchedOnBeforeTS~0)) (.cse3 (= ~pumpRunning~0 0)) (.cse7 (= ~methaneLevelCritical~0 0)) (.cse5 (= 1 ~systemActive~0))) (or (and .cse3 .cse4 .cse5 .cse2) (and .cse6 .cse7 .cse5 .cse2) (and .cse3 .cse4 .cse5 .cse0) (and .cse6 .cse7 .cse5 .cse8 .cse0) (and .cse3 .cse1 .cse7 .cse5) (and .cse3 .cse4 .cse1 .cse5) (and .cse6 .cse1 .cse7 .cse5 .cse8) (and .cse3 .cse7 .cse5 .cse2) (and .cse3 .cse7 .cse5 .cse0)))))) [2024-11-09 23:19:29,835 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 23:19:29,851 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__methaneQuery contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse3 (<= 1 ~switchedOnBeforeTS~0)) (.cse0 (= ~methaneLevelCritical~0 0)) (.cse2 (= ~waterLevel~0 1)) (.cse4 (<= 1 ~methaneLevelCritical~0)) (.cse1 (= 1 ~systemActive~0)) (.cse5 (= |old(~pumpRunning~0)| 0)) (.cse6 (= ~waterLevel~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (<= 2 ~waterLevel~0) .cse1 .cse5 (<= ~waterLevel~0 2)) (and (= 2 ~waterLevel~0) .cse0 .cse1 .cse5) (and .cse0 .cse1 .cse5 .cse2) (and .cse0 .cse1 .cse3 .cse6) (and .cse0 .cse1 .cse5 .cse6) (and .cse4 .cse1 .cse5 .cse2) (and .cse4 .cse1 .cse5 .cse6))) (or (= ~pumpRunning~0 0) (< 0 |old(~pumpRunning~0)|))) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0))) (and (or (< 0 ~pumpRunning~0) .cse0) (let ((.cse3 (= ~waterLevel~0 1)) (.cse7 (= 2 ~waterLevel~0)) (.cse1 (= ~methaneLevelCritical~0 0)) (.cse4 (<= 1 ~switchedOnBeforeTS~0)) (.cse6 (<= 1 ~methaneLevelCritical~0)) (.cse2 (= 1 ~systemActive~0)) (.cse5 (= ~waterLevel~0 0))) (or (and .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5) (and .cse0 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse6 .cse7 .cse2) (and .cse0 .cse7 .cse1 .cse2) (and .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse5))))) [2024-11-09 23:19:29,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:19:29 BoogieIcfgContainer [2024-11-09 23:19:29,909 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 23:19:29,910 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 23:19:29,910 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 23:19:29,910 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 23:19:29,911 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:18:56" (3/4) ... [2024-11-09 23:19:29,913 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 23:19:29,917 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-09 23:19:29,917 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-09 23:19:29,917 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-09 23:19:29,917 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-09 23:19:29,918 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-09 23:19:29,918 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__methaneQuery [2024-11-09 23:19:29,918 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2024-11-09 23:19:29,918 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneAlarm [2024-11-09 23:19:29,925 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2024-11-09 23:19:29,925 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-09 23:19:29,926 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 23:19:29,926 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 23:19:29,926 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 23:19:30,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 23:19:30,053 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 23:19:30,053 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 23:19:30,054 INFO L158 Benchmark]: Toolchain (without parser) took 34303.63ms. Allocated memory was 142.6MB in the beginning and 432.0MB in the end (delta: 289.4MB). Free memory was 85.8MB in the beginning and 198.0MB in the end (delta: -112.1MB). Peak memory consumption was 179.4MB. Max. memory is 16.1GB. [2024-11-09 23:19:30,054 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:19:30,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.03ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 63.1MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 23:19:30,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.87ms. Allocated memory is still 142.6MB. Free memory was 63.1MB in the beginning and 61.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:19:30,055 INFO L158 Benchmark]: Boogie Preprocessor took 41.33ms. Allocated memory is still 142.6MB. Free memory was 61.0MB in the beginning and 58.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:19:30,055 INFO L158 Benchmark]: IcfgBuilder took 537.84ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 58.9MB in the beginning and 160.1MB in the end (delta: -101.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-09 23:19:30,055 INFO L158 Benchmark]: TraceAbstraction took 33015.37ms. Allocated memory was 205.5MB in the beginning and 432.0MB in the end (delta: 226.5MB). Free memory was 160.1MB in the beginning and 207.4MB in the end (delta: -47.3MB). Peak memory consumption was 250.5MB. Max. memory is 16.1GB. [2024-11-09 23:19:30,056 INFO L158 Benchmark]: Witness Printer took 143.47ms. Allocated memory is still 432.0MB. Free memory was 207.4MB in the beginning and 198.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 23:19:30,059 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.18ms. Allocated memory is still 142.6MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.03ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 63.1MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.87ms. Allocated memory is still 142.6MB. Free memory was 63.1MB in the beginning and 61.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.33ms. Allocated memory is still 142.6MB. Free memory was 61.0MB in the beginning and 58.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 537.84ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 58.9MB in the beginning and 160.1MB in the end (delta: -101.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * TraceAbstraction took 33015.37ms. Allocated memory was 205.5MB in the beginning and 432.0MB in the end (delta: 226.5MB). Free memory was 160.1MB in the beginning and 207.4MB in the end (delta: -47.3MB). Peak memory consumption was 250.5MB. Max. memory is 16.1GB. * Witness Printer took 143.47ms. Allocated memory is still 432.0MB. Free memory was 207.4MB in the beginning and 198.0MB in the end (delta: 9.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,"Specification5_spec.i","") [49] - GenericResultAtLocation [Line: 101]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [101] - GenericResultAtLocation [Line: 206]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [206] - GenericResultAtLocation [Line: 572]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [572] - GenericResultAtLocation [Line: 670]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [670] - GenericResultAtLocation [Line: 705]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [705] - GenericResultAtLocation [Line: 714]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [714] - GenericResultAtLocation [Line: 923]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [923] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - 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: 710]: 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 9 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.1s, OverallIterations: 14, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6820 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6762 mSDsluCounter, 7171 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5691 mSDsCounter, 2238 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11685 IncrementalHoareTripleChecker+Invalid, 13923 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2238 mSolverCounterUnsat, 1480 mSDtfsCounter, 11685 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2645 GetRequests, 2269 SyntacticMatches, 24 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5076 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1290occurred in iteration=13, InterpolantAutomatonStates: 260, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 508 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2487 NumberOfCodeBlocks, 2487 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3465 ConstructedInterpolants, 0 QuantifiedInterpolants, 7714 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2895 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 24 InterpolantComputations, 9 PerfectInterpolantSequences, 3207/3750 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: 934]: Location Invariant Derived location invariant: null - InvariantResult [Line: 114]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 748]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((((((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)) && (waterLevel == 0)) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel == 0))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 1))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel == 1))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (1 == systemActive))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS))) || ((((pumpRunning == 0) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 0))) Ensures: (((((((((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)) && (waterLevel == 0)) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel == 0))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 1))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel == 1))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (1 == systemActive))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS))) || ((((pumpRunning == 0) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 0))) && (((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 603]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((((((((((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (waterLevel == 1))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (waterLevel == 0))) || (((1 <= pumpRunning) && (1 <= switchedOnBeforeTS)) && (waterLevel == 0))) || ((1 <= pumpRunning) && (2 == waterLevel))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (waterLevel == 1))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (waterLevel == 0))) || (((pumpRunning == 0) && (2 == waterLevel)) && (methaneLevelCritical == 0))) || (((1 <= pumpRunning) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS))) && (1 == systemActive)) && ((pumpRunning < 1) || (methaneLevelCritical == 0))) Ensures: (((((1 == systemActive) && (((((((((((pumpRunning == 0) && (2 == waterLevel)) && (\old(methaneLevelCritical) == 0)) || (((1 <= pumpRunning) && (2 == waterLevel)) && (\old(methaneLevelCritical) == 0))) || ((((1 <= pumpRunning) && (\old(methaneLevelCritical) == 0)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 <= \old(methaneLevelCritical)))) || (((pumpRunning == 0) && (\old(methaneLevelCritical) == 0)) && (waterLevel == 1))) || (((pumpRunning == 0) && (1 <= \old(methaneLevelCritical))) && (waterLevel == 1))) || (((pumpRunning == 0) && (\old(methaneLevelCritical) == 0)) && (waterLevel == 0))) || ((((1 <= pumpRunning) && (\old(methaneLevelCritical) == 0)) && (1 <= switchedOnBeforeTS)) && (waterLevel == 0))) || (((pumpRunning == 0) && (1 <= \old(methaneLevelCritical))) && (waterLevel == 0)))) && ((\old(methaneLevelCritical) != 0) || (0 < methaneLevelCritical))) && ((methaneLevelCritical == 0) || (\old(methaneLevelCritical) < 1))) && ((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 721]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: ((((((((((((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || (\old(pumpRunning) != 0)) || (\old(waterLevel) != 2)) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) && (((pumpRunning == \old(pumpRunning)) || (methaneLevelCritical != 0)) || (\old(pumpRunning) < 1))) && ((((((((((((((1 <= methaneLevelCritical) && (\old(pumpRunning) == 0)) && (\old(waterLevel) == 0)) || (((\old(waterLevel) == 1) && (methaneLevelCritical == 0)) && (\old(pumpRunning) == 0))) || (((((1 <= methaneLevelCritical) && (\old(waterLevel) == 1)) && (1 == systemActive)) && (1 <= \old(switchedOnBeforeTS))) && (1 <= \old(pumpRunning)))) || (((1 <= methaneLevelCritical) && (\old(waterLevel) == 1)) && (\old(pumpRunning) == 0))) || (((((\old(waterLevel) == 1) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= \old(switchedOnBeforeTS))) && (1 <= \old(pumpRunning)))) || (((((methaneLevelCritical == 0) && (1 == systemActive)) && (1 <= \old(switchedOnBeforeTS))) && (\old(waterLevel) == 0)) && (1 <= \old(pumpRunning)))) || (((1 <= methaneLevelCritical) && (1 <= \old(pumpRunning))) && (\old(waterLevel) == 2))) || (((methaneLevelCritical == 0) && (1 <= \old(pumpRunning))) && (\old(waterLevel) == 2))) || (((methaneLevelCritical == 0) && (\old(pumpRunning) == 0)) && (\old(waterLevel) == 2))) || (((((1 <= methaneLevelCritical) && (1 == systemActive)) && (1 <= \old(switchedOnBeforeTS))) && (\old(waterLevel) == 0)) && (1 <= \old(pumpRunning)))) || (((1 <= methaneLevelCritical) && (\old(pumpRunning) == 0)) && (\old(waterLevel) == 2))) || (((methaneLevelCritical == 0) && (\old(pumpRunning) == 0)) && (\old(waterLevel) == 0)))) && (((\old(pumpRunning) != 0) || (\old(waterLevel) != 1)) || ((1 == systemActive) && (waterLevel == 1)))) && ((((1 <= switchedOnBeforeTS) && (waterLevel == 0)) || (\old(waterLevel) != 1)) || (\old(pumpRunning) < 1))) && (((pumpRunning == \old(pumpRunning)) || (\old(waterLevel) != 1)) || (methaneLevelCritical != 0))) && ((pumpRunning == 0) || (methaneLevelCritical < 1))) && (((\old(pumpRunning) != 0) || (\old(waterLevel) != 0)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 0)))) && ((((1 <= switchedOnBeforeTS) && (waterLevel == 0)) || (\old(waterLevel) != 0)) || (\old(pumpRunning) < 1))) && (((((1 == systemActive) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS)) || (\old(waterLevel) != 2)) || (\old(pumpRunning) < 1))) && ((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 104]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 591]: Procedure Contract for waterRise Derived contract for procedure waterRise. Ensures: ((((((2 == waterLevel) || (\old(waterLevel) != 2)) && ((2 == waterLevel) || (\old(waterLevel) != 1))) && ((((((((((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (\old(waterLevel) == 2)) || ((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (\old(waterLevel) == 2))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (\old(waterLevel) == 0))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)) && (\old(waterLevel) == 0))) || ((((pumpRunning == 0) && (\old(waterLevel) == 1)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (\old(waterLevel) == 1)) && (1 == systemActive))) || (((((1 <= pumpRunning) && (\old(waterLevel) == 1)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (\old(waterLevel) == 2))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (\old(waterLevel) == 0)))) && ((\old(waterLevel) != 0) || (waterLevel == 1))) && ((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 756]: Procedure Contract for processEnvironment__wrappee__methaneQuery Derived contract for procedure processEnvironment__wrappee__methaneQuery. Requires: (((0 < pumpRunning) || (pumpRunning == 0)) && (((((((((((methaneLevelCritical == 0) && (1 == systemActive)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS)) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel == 0))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 1))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel == 1))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((methaneLevelCritical == 0) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)) && (waterLevel == 0))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 0)))) Ensures: (((((((((((((((((methaneLevelCritical == 0) && (1 <= switchedOnBeforeTS)) && (waterLevel == 0)) && (1 <= \old(pumpRunning))) || (((methaneLevelCritical == 0) && (\old(pumpRunning) == 0)) && (waterLevel == 0))) || (((1 <= methaneLevelCritical) && (\old(pumpRunning) == 0)) && (waterLevel == 0))) || (((1 <= methaneLevelCritical) && (\old(pumpRunning) == 0)) && (waterLevel == 1))) || (((2 == waterLevel) && (methaneLevelCritical == 0)) && (\old(pumpRunning) == 0))) || (((methaneLevelCritical == 0) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS))) || ((1 <= methaneLevelCritical) && (2 <= waterLevel))) || (((methaneLevelCritical == 0) && (\old(pumpRunning) == 0)) && (waterLevel == 1))) && ((waterLevel != 1) || (pumpRunning == \old(pumpRunning)))) && ((pumpRunning == \old(pumpRunning)) || (\old(pumpRunning) < 1))) && (((pumpRunning == 0) || (waterLevel != 0)) || (0 < \old(pumpRunning)))) && (((waterLevel < 2) || (((pumpRunning == 0) && (2 == waterLevel)) && (\old(pumpRunning) == 0))) || (methaneLevelCritical < 1))) && (((1 <= pumpRunning) && (1 == systemActive)) || ((pumpRunning == 0) && (1 == systemActive)))) && ((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 851]: Procedure Contract for isPumpRunning Derived contract for procedure isPumpRunning. Requires: ((((((((((((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)) && (waterLevel == 0)) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel == 0))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 1))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel == 1))) || ((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (1 == systemActive))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS))) || ((((pumpRunning == 0) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || (((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 0))) || (((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)) && (waterLevel == 0))) Ensures: (((pumpRunning == \result) && ((((((((((((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)) && (waterLevel == 0)) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel == 0))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 1))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel == 1))) || ((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (1 == systemActive))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS))) || ((((pumpRunning == 0) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || (((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 0))) || (((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)) && (waterLevel == 0)))) && (((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 840]: Procedure Contract for isMethaneAlarm Derived contract for procedure isMethaneAlarm. Requires: ((((((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)) && (waterLevel == 0)) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (1 == systemActive))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS))) || ((((pumpRunning == 0) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || (((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS))) || (((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)) && (waterLevel == 0))) Ensures: (((methaneLevelCritical == \result) && ((((((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)) && (waterLevel == 0)) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (1 == systemActive))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS))) || ((((pumpRunning == 0) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || (((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS))) || (((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)) && (waterLevel == 0)))) && (((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) RESULT: Ultimate proved your program to be correct! [2024-11-09 23:19:30,104 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