./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product52.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 4583285deb29d8014ded34089a46614a743cea13eee9bbb990cdfd770bfce36e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:52:55,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:52:55,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 07:52:55,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:52:55,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:52:55,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:52:55,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:52:55,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:52:55,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:52:55,660 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:52:55,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:52:55,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:52:55,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:52:55,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:52:55,662 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:52:55,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:52:55,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:52:55,663 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:52:55,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 07:52:55,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:52:55,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:52:55,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:52:55,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:52:55,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:52:55,667 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:52:55,667 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:52:55,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:52:55,667 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:52:55,668 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:52:55,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:52:55,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:52:55,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:52:55,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:52:55,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:52:55,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:52:55,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:52:55,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 07:52:55,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 07:52:55,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:52:55,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:52:55,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:52:55,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:52:55,671 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 -> 4583285deb29d8014ded34089a46614a743cea13eee9bbb990cdfd770bfce36e [2024-11-16 07:52:55,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:52:55,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:52:55,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:52:55,905 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:52:55,905 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:52:55,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c [2024-11-16 07:52:57,186 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:52:57,371 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:52:57,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c [2024-11-16 07:52:57,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12ed281cf/b9a825f64cb0433e873dec70ca51abb3/FLAGae729c10f [2024-11-16 07:52:57,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12ed281cf/b9a825f64cb0433e873dec70ca51abb3 [2024-11-16 07:52:57,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:52:57,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:52:57,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:52:57,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:52:57,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:52:57,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:52:57" (1/1) ... [2024-11-16 07:52:57,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f76ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:57, skipping insertion in model container [2024-11-16 07:52:57,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:52:57" (1/1) ... [2024-11-16 07:52:57,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:52:58,074 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_spec2_product52.cil.c[19177,19190] [2024-11-16 07:52:58,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:52:58,089 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:52:58,097 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2024-11-16 07:52:58,098 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [124] [2024-11-16 07:52:58,098 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [354] [2024-11-16 07:52:58,098 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [455] [2024-11-16 07:52:58,098 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [495] [2024-11-16 07:52:58,099 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [530] [2024-11-16 07:52:58,099 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [634] [2024-11-16 07:52:58,099 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1000] [2024-11-16 07:52:58,152 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_spec2_product52.cil.c[19177,19190] [2024-11-16 07:52:58,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:52:58,180 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:52:58,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:58 WrapperNode [2024-11-16 07:52:58,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:52:58,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:52:58,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:52:58,181 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:52:58,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:58" (1/1) ... [2024-11-16 07:52:58,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:58" (1/1) ... [2024-11-16 07:52:58,213 INFO L138 Inliner]: procedures = 58, calls = 102, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 211 [2024-11-16 07:52:58,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:52:58,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:52:58,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:52:58,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:52:58,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:58" (1/1) ... [2024-11-16 07:52:58,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:58" (1/1) ... [2024-11-16 07:52:58,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:58" (1/1) ... [2024-11-16 07:52:58,237 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 07:52:58,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:58" (1/1) ... [2024-11-16 07:52:58,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:58" (1/1) ... [2024-11-16 07:52:58,241 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:58" (1/1) ... [2024-11-16 07:52:58,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:58" (1/1) ... [2024-11-16 07:52:58,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:58" (1/1) ... [2024-11-16 07:52:58,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:58" (1/1) ... [2024-11-16 07:52:58,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:52:58,245 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:52:58,246 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:52:58,246 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:52:58,246 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:58" (1/1) ... [2024-11-16 07:52:58,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:52:58,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:52:58,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 07:52:58,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 07:52:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:52:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-16 07:52:58,317 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-16 07:52:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-16 07:52:58,317 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-16 07:52:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-16 07:52:58,317 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-16 07:52:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-16 07:52:58,317 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-16 07:52:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-16 07:52:58,318 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-16 07:52:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-16 07:52:58,318 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-16 07:52:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-16 07:52:58,318 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-16 07:52:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 07:52:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-16 07:52:58,318 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-16 07:52:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:52:58,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:52:58,393 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:52:58,396 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:52:58,438 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L576: #res := ~retValue_acc~7; [2024-11-16 07:52:58,530 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L254-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~1#1; [2024-11-16 07:52:58,531 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L631-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~10#1; [2024-11-16 07:52:58,531 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L328-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~3#1; [2024-11-16 07:52:58,585 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L527-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2024-11-16 07:52:58,585 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L452-1: main_#res#1 := main_~retValue_acc~4#1; [2024-11-16 07:52:58,602 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L309-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1; [2024-11-16 07:52:58,602 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L622-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~9#1; [2024-11-16 07:52:58,617 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-16 07:52:58,618 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:52:58,627 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:52:58,628 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:52:58,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:52:58 BoogieIcfgContainer [2024-11-16 07:52:58,628 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:52:58,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:52:58,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:52:58,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:52:58,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:52:57" (1/3) ... [2024-11-16 07:52:58,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389c3bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:52:58, skipping insertion in model container [2024-11-16 07:52:58,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:58" (2/3) ... [2024-11-16 07:52:58,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389c3bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:52:58, skipping insertion in model container [2024-11-16 07:52:58,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:52:58" (3/3) ... [2024-11-16 07:52:58,640 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product52.cil.c [2024-11-16 07:52:58,653 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:52:58,653 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:52:58,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:52:58,704 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;@40c90609, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:52:58,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:52:58,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 88 states have internal predecessors, (107), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-16 07:52:58,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-16 07:52:58,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:58,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:58,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:58,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:58,721 INFO L85 PathProgramCache]: Analyzing trace with hash -885647571, now seen corresponding path program 1 times [2024-11-16 07:52:58,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:58,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779641831] [2024-11-16 07:52:58,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:58,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:58,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 07:52:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:58,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:58,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779641831] [2024-11-16 07:52:58,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779641831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:58,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:58,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 07:52:58,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539057011] [2024-11-16 07:52:58,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:58,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 07:52:58,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:58,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 07:52:58,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 07:52:58,916 INFO L87 Difference]: Start difference. First operand has 102 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 88 states have internal predecessors, (107), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:52:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:58,939 INFO L93 Difference]: Finished difference Result 194 states and 259 transitions. [2024-11-16 07:52:58,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 07:52:58,941 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-16 07:52:58,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:58,947 INFO L225 Difference]: With dead ends: 194 [2024-11-16 07:52:58,947 INFO L226 Difference]: Without dead ends: 91 [2024-11-16 07:52:58,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 07:52:58,959 INFO L432 NwaCegarLoop]: 126 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, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:58,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:52:58,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-16 07:52:58,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-16 07:52:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.3) internal successors, (91), 78 states have internal predecessors, (91), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 07:52:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2024-11-16 07:52:58,995 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 27 [2024-11-16 07:52:58,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:58,996 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2024-11-16 07:52:58,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:52:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2024-11-16 07:52:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-16 07:52:58,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:58,998 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:58,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 07:52:58,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:58,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:58,999 INFO L85 PathProgramCache]: Analyzing trace with hash 6314635, now seen corresponding path program 1 times [2024-11-16 07:52:58,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:58,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668363607] [2024-11-16 07:52:59,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:59,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:59,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 07:52:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:59,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:59,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668363607] [2024-11-16 07:52:59,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668363607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:59,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:59,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:52:59,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903445938] [2024-11-16 07:52:59,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:59,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:52:59,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:59,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:52:59,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:52:59,081 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:52:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:59,105 INFO L93 Difference]: Finished difference Result 139 states and 177 transitions. [2024-11-16 07:52:59,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:52:59,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-16 07:52:59,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:59,107 INFO L225 Difference]: With dead ends: 139 [2024-11-16 07:52:59,108 INFO L226 Difference]: Without dead ends: 80 [2024-11-16 07:52:59,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:52:59,110 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:59,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 179 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:52:59,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-16 07:52:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-16 07:52:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 70 states have internal predecessors, (82), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-16 07:52:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2024-11-16 07:52:59,120 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 30 [2024-11-16 07:52:59,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:59,120 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2024-11-16 07:52:59,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:52:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2024-11-16 07:52:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-16 07:52:59,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:59,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:59,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 07:52:59,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:59,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:59,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2139122387, now seen corresponding path program 1 times [2024-11-16 07:52:59,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:59,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330408178] [2024-11-16 07:52:59,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:59,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:59,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 07:52:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:59,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:59,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330408178] [2024-11-16 07:52:59,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330408178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:59,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:59,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:52:59,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620011911] [2024-11-16 07:52:59,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:59,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:52:59,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:59,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:52:59,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:52:59,262 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:52:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:59,298 INFO L93 Difference]: Finished difference Result 222 states and 289 transitions. [2024-11-16 07:52:59,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:52:59,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-11-16 07:52:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:59,301 INFO L225 Difference]: With dead ends: 222 [2024-11-16 07:52:59,301 INFO L226 Difference]: Without dead ends: 150 [2024-11-16 07:52:59,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:52:59,303 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 78 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:59,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 209 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:52:59,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-16 07:52:59,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2024-11-16 07:52:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 126 states have internal predecessors, (150), 20 states have call successors, (20), 14 states have call predecessors, (20), 14 states have return successors, (20), 13 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 07:52:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2024-11-16 07:52:59,319 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 33 [2024-11-16 07:52:59,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:59,320 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2024-11-16 07:52:59,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:52:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2024-11-16 07:52:59,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-16 07:52:59,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:59,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:59,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 07:52:59,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:59,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:59,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1551993778, now seen corresponding path program 1 times [2024-11-16 07:52:59,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:59,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505067377] [2024-11-16 07:52:59,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:59,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:59,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:52:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:59,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:59,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505067377] [2024-11-16 07:52:59,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505067377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:59,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:59,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:52:59,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614807939] [2024-11-16 07:52:59,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:59,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:52:59,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:59,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:52:59,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:52:59,460 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:52:59,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:59,548 INFO L93 Difference]: Finished difference Result 369 states and 492 transitions. [2024-11-16 07:52:59,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:52:59,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-16 07:52:59,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:59,552 INFO L225 Difference]: With dead ends: 369 [2024-11-16 07:52:59,552 INFO L226 Difference]: Without dead ends: 231 [2024-11-16 07:52:59,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:52:59,557 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 49 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:59,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 361 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:52:59,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-16 07:52:59,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 230. [2024-11-16 07:52:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 175 states have (on average 1.3085714285714285) internal successors, (229), 190 states have internal predecessors, (229), 28 states have call successors, (28), 26 states have call predecessors, (28), 26 states have return successors, (36), 25 states have call predecessors, (36), 28 states have call successors, (36) [2024-11-16 07:52:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 293 transitions. [2024-11-16 07:52:59,579 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 293 transitions. Word has length 36 [2024-11-16 07:52:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:59,580 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 293 transitions. [2024-11-16 07:52:59,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:52:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 293 transitions. [2024-11-16 07:52:59,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 07:52:59,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:59,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:59,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 07:52:59,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:59,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:59,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1920318179, now seen corresponding path program 1 times [2024-11-16 07:52:59,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:59,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923013728] [2024-11-16 07:52:59,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:59,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:59,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 07:52:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:59,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 07:52:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:59,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:59,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923013728] [2024-11-16 07:52:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923013728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:59,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:59,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:52:59,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208618996] [2024-11-16 07:52:59,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:59,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:52:59,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:59,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:52:59,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:52:59,698 INFO L87 Difference]: Start difference. First operand 230 states and 293 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:52:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:59,933 INFO L93 Difference]: Finished difference Result 513 states and 666 transitions. [2024-11-16 07:52:59,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:52:59,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2024-11-16 07:52:59,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:59,936 INFO L225 Difference]: With dead ends: 513 [2024-11-16 07:52:59,940 INFO L226 Difference]: Without dead ends: 291 [2024-11-16 07:52:59,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 07:52:59,942 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 160 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:59,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 431 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:52:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-16 07:52:59,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 280. [2024-11-16 07:52:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 215 states have (on average 1.2883720930232558) internal successors, (277), 230 states have internal predecessors, (277), 32 states have call successors, (32), 26 states have call predecessors, (32), 32 states have return successors, (46), 33 states have call predecessors, (46), 32 states have call successors, (46) [2024-11-16 07:52:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 355 transitions. [2024-11-16 07:52:59,985 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 355 transitions. Word has length 47 [2024-11-16 07:52:59,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:59,986 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 355 transitions. [2024-11-16 07:52:59,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:52:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 355 transitions. [2024-11-16 07:52:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 07:52:59,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:59,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:59,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 07:52:59,989 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:59,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:59,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1965824892, now seen corresponding path program 1 times [2024-11-16 07:52:59,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:59,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321530198] [2024-11-16 07:52:59,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:59,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:53:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:00,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 07:53:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:00,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 07:53:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:53:00,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:53:00,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321530198] [2024-11-16 07:53:00,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321530198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:00,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:00,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:53:00,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092010258] [2024-11-16 07:53:00,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:00,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:53:00,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:53:00,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:53:00,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:53:00,083 INFO L87 Difference]: Start difference. First operand 280 states and 355 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:53:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:00,198 INFO L93 Difference]: Finished difference Result 561 states and 720 transitions. [2024-11-16 07:53:00,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 07:53:00,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2024-11-16 07:53:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:00,201 INFO L225 Difference]: With dead ends: 561 [2024-11-16 07:53:00,201 INFO L226 Difference]: Without dead ends: 289 [2024-11-16 07:53:00,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 07:53:00,203 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 54 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:00,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 375 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:53:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-16 07:53:00,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2024-11-16 07:53:00,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 221 states have (on average 1.2805429864253393) internal successors, (283), 236 states have internal predecessors, (283), 32 states have call successors, (32), 26 states have call predecessors, (32), 32 states have return successors, (46), 33 states have call predecessors, (46), 32 states have call successors, (46) [2024-11-16 07:53:00,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 361 transitions. [2024-11-16 07:53:00,225 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 361 transitions. Word has length 47 [2024-11-16 07:53:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:00,225 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 361 transitions. [2024-11-16 07:53:00,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:53:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 361 transitions. [2024-11-16 07:53:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 07:53:00,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:00,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:00,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 07:53:00,227 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:00,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:00,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2139172897, now seen corresponding path program 1 times [2024-11-16 07:53:00,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:53:00,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484182204] [2024-11-16 07:53:00,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:00,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:53:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:00,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 07:53:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:00,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 07:53:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:00,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:53:00,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:53:00,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484182204] [2024-11-16 07:53:00,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484182204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:00,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:00,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:53:00,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893665074] [2024-11-16 07:53:00,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:00,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:53:00,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:53:00,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:53:00,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:53:00,276 INFO L87 Difference]: Start difference. First operand 286 states and 361 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:53:00,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:00,426 INFO L93 Difference]: Finished difference Result 822 states and 1075 transitions. [2024-11-16 07:53:00,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:53:00,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2024-11-16 07:53:00,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:00,429 INFO L225 Difference]: With dead ends: 822 [2024-11-16 07:53:00,429 INFO L226 Difference]: Without dead ends: 544 [2024-11-16 07:53:00,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:53:00,434 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 218 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:00,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 318 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:53:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-16 07:53:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 536. [2024-11-16 07:53:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 411 states have (on average 1.245742092457421) internal successors, (512), 435 states have internal predecessors, (512), 63 states have call successors, (63), 59 states have call predecessors, (63), 61 states have return successors, (101), 62 states have call predecessors, (101), 63 states have call successors, (101) [2024-11-16 07:53:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 676 transitions. [2024-11-16 07:53:00,487 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 676 transitions. Word has length 47 [2024-11-16 07:53:00,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:00,488 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 676 transitions. [2024-11-16 07:53:00,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:53:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 676 transitions. [2024-11-16 07:53:00,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 07:53:00,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:00,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:00,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 07:53:00,493 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:00,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:00,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1723915073, now seen corresponding path program 1 times [2024-11-16 07:53:00,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:53:00,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86314158] [2024-11-16 07:53:00,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:00,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:53:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:00,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 07:53:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:00,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-16 07:53:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:00,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:53:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:53:00,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:53:00,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86314158] [2024-11-16 07:53:00,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86314158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:00,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:00,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:53:00,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698060210] [2024-11-16 07:53:00,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:00,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:53:00,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:53:00,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:53:00,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:53:00,579 INFO L87 Difference]: Start difference. First operand 536 states and 676 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 07:53:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:00,876 INFO L93 Difference]: Finished difference Result 1115 states and 1502 transitions. [2024-11-16 07:53:00,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:53:00,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2024-11-16 07:53:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:00,882 INFO L225 Difference]: With dead ends: 1115 [2024-11-16 07:53:00,882 INFO L226 Difference]: Without dead ends: 1112 [2024-11-16 07:53:00,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 07:53:00,883 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 309 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:00,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 236 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:53:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2024-11-16 07:53:00,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 987. [2024-11-16 07:53:00,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 756 states have (on average 1.257936507936508) internal successors, (951), 811 states have internal predecessors, (951), 122 states have call successors, (122), 92 states have call predecessors, (122), 108 states have return successors, (267), 114 states have call predecessors, (267), 122 states have call successors, (267) [2024-11-16 07:53:00,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1340 transitions. [2024-11-16 07:53:00,949 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1340 transitions. Word has length 51 [2024-11-16 07:53:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:00,949 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 1340 transitions. [2024-11-16 07:53:00,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 07:53:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1340 transitions. [2024-11-16 07:53:00,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 07:53:00,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:00,952 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 07:53:00,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 07:53:00,952 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:00,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:00,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1254606570, now seen corresponding path program 1 times [2024-11-16 07:53:00,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:53:00,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276444521] [2024-11-16 07:53:00,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:00,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:53:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:00,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 07:53:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:00,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:53:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:01,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:53:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:01,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 07:53:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:01,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 07:53:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 07:53:01,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:53:01,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276444521] [2024-11-16 07:53:01,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276444521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:01,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:01,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 07:53:01,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587436912] [2024-11-16 07:53:01,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:01,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 07:53:01,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:53:01,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 07:53:01,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:53:01,013 INFO L87 Difference]: Start difference. First operand 987 states and 1340 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-16 07:53:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:01,409 INFO L93 Difference]: Finished difference Result 1621 states and 2187 transitions. [2024-11-16 07:53:01,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 07:53:01,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (6), 5 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 82 [2024-11-16 07:53:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:01,418 INFO L225 Difference]: With dead ends: 1621 [2024-11-16 07:53:01,418 INFO L226 Difference]: Without dead ends: 642 [2024-11-16 07:53:01,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-16 07:53:01,425 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 239 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:01,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 380 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 07:53:01,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-11-16 07:53:01,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 595. [2024-11-16 07:53:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 460 states have (on average 1.241304347826087) internal successors, (571), 491 states have internal predecessors, (571), 69 states have call successors, (69), 56 states have call predecessors, (69), 65 states have return successors, (140), 68 states have call predecessors, (140), 69 states have call successors, (140) [2024-11-16 07:53:01,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 780 transitions. [2024-11-16 07:53:01,493 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 780 transitions. Word has length 82 [2024-11-16 07:53:01,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:01,496 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 780 transitions. [2024-11-16 07:53:01,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-16 07:53:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 780 transitions. [2024-11-16 07:53:01,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-16 07:53:01,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:01,498 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:01,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 07:53:01,498 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:01,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:01,499 INFO L85 PathProgramCache]: Analyzing trace with hash 845439806, now seen corresponding path program 1 times [2024-11-16 07:53:01,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:53:01,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366397753] [2024-11-16 07:53:01,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:01,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:53:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:01,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 07:53:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:01,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 07:53:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:01,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:53:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:01,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 07:53:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:01,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 07:53:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:01,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 07:53:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-16 07:53:01,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:53:01,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366397753] [2024-11-16 07:53:01,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366397753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:53:01,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767752966] [2024-11-16 07:53:01,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:01,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:53:01,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:53:01,688 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:53:01,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 07:53:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:01,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 07:53:01,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:53:01,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:53:01,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767752966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:01,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 07:53:01,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2024-11-16 07:53:01,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911449588] [2024-11-16 07:53:01,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:01,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:53:01,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:53:01,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:53:01,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 07:53:01,936 INFO L87 Difference]: Start difference. First operand 595 states and 780 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 07:53:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:02,009 INFO L93 Difference]: Finished difference Result 1013 states and 1355 transitions. [2024-11-16 07:53:02,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:53:02,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 91 [2024-11-16 07:53:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:02,012 INFO L225 Difference]: With dead ends: 1013 [2024-11-16 07:53:02,012 INFO L226 Difference]: Without dead ends: 512 [2024-11-16 07:53:02,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 07:53:02,017 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 43 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:02,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 213 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-11-16 07:53:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2024-11-16 07:53:02,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 396 states have (on average 1.2196969696969697) internal successors, (483), 423 states have internal predecessors, (483), 59 states have call successors, (59), 51 states have call predecessors, (59), 56 states have return successors, (85), 58 states have call predecessors, (85), 59 states have call successors, (85) [2024-11-16 07:53:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 627 transitions. [2024-11-16 07:53:02,056 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 627 transitions. Word has length 91 [2024-11-16 07:53:02,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:02,056 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 627 transitions. [2024-11-16 07:53:02,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 07:53:02,057 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 627 transitions. [2024-11-16 07:53:02,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 07:53:02,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:02,058 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 07:53:02,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 07:53:02,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-16 07:53:02,264 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:02,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:02,264 INFO L85 PathProgramCache]: Analyzing trace with hash -108777154, now seen corresponding path program 1 times [2024-11-16 07:53:02,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:53:02,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206096254] [2024-11-16 07:53:02,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:02,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:53:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:02,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 07:53:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:02,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 07:53:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:02,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:53:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:02,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 07:53:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:02,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 07:53:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:02,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:53:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:02,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 07:53:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 07:53:02,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:53:02,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206096254] [2024-11-16 07:53:02,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206096254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:53:02,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083454905] [2024-11-16 07:53:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:02,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:53:02,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:53:02,446 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:53:02,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 07:53:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:02,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 07:53:02,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:02,683 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-16 07:53:02,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:53:02,798 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 07:53:02,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083454905] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 07:53:02,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 07:53:02,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 5] total 14 [2024-11-16 07:53:02,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489538904] [2024-11-16 07:53:02,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:02,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:53:02,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:53:02,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:53:02,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-16 07:53:02,800 INFO L87 Difference]: Start difference. First operand 512 states and 627 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 07:53:02,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:02,925 INFO L93 Difference]: Finished difference Result 1451 states and 1822 transitions. [2024-11-16 07:53:02,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:53:02,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 94 [2024-11-16 07:53:02,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:02,929 INFO L225 Difference]: With dead ends: 1451 [2024-11-16 07:53:02,929 INFO L226 Difference]: Without dead ends: 947 [2024-11-16 07:53:02,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-16 07:53:02,931 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 57 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:02,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 458 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:02,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-11-16 07:53:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 895. [2024-11-16 07:53:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 683 states have (on average 1.1903367496339678) internal successors, (813), 733 states have internal predecessors, (813), 107 states have call successors, (107), 93 states have call predecessors, (107), 104 states have return successors, (156), 105 states have call predecessors, (156), 107 states have call successors, (156) [2024-11-16 07:53:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1076 transitions. [2024-11-16 07:53:02,978 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1076 transitions. Word has length 94 [2024-11-16 07:53:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:02,978 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1076 transitions. [2024-11-16 07:53:02,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 07:53:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1076 transitions. [2024-11-16 07:53:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 07:53:02,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:02,980 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 07:53:02,993 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-16 07:53:03,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-16 07:53:03,182 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:03,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2131203073, now seen corresponding path program 1 times [2024-11-16 07:53:03,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:53:03,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933565319] [2024-11-16 07:53:03,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:03,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:53:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:03,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 07:53:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:03,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 07:53:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:03,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-16 07:53:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:03,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:53:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:03,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 07:53:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:03,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 07:53:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:03,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:53:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:03,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 07:53:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 07:53:03,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:53:03,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933565319] [2024-11-16 07:53:03,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933565319] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:53:03,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012335851] [2024-11-16 07:53:03,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:03,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:53:03,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:53:03,318 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:53:03,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 07:53:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:03,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 07:53:03,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:53:03,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:53:03,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012335851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:03,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 07:53:03,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 10 [2024-11-16 07:53:03,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190862528] [2024-11-16 07:53:03,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:03,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:53:03,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:53:03,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:53:03,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-16 07:53:03,456 INFO L87 Difference]: Start difference. First operand 895 states and 1076 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 07:53:03,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:03,685 INFO L93 Difference]: Finished difference Result 2123 states and 2641 transitions. [2024-11-16 07:53:03,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 07:53:03,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 98 [2024-11-16 07:53:03,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:03,696 INFO L225 Difference]: With dead ends: 2123 [2024-11-16 07:53:03,700 INFO L226 Difference]: Without dead ends: 1404 [2024-11-16 07:53:03,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-16 07:53:03,702 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 125 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:03,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 605 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:53:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2024-11-16 07:53:03,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1248. [2024-11-16 07:53:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 949 states have (on average 1.1917808219178083) internal successors, (1131), 1018 states have internal predecessors, (1131), 151 states have call successors, (151), 133 states have call predecessors, (151), 147 states have return successors, (225), 142 states have call predecessors, (225), 151 states have call successors, (225) [2024-11-16 07:53:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1507 transitions. [2024-11-16 07:53:03,833 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1507 transitions. Word has length 98 [2024-11-16 07:53:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:03,837 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1507 transitions. [2024-11-16 07:53:03,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 07:53:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1507 transitions. [2024-11-16 07:53:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 07:53:03,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:03,839 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 07:53:03,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 07:53:04,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:53:04,040 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:04,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:04,041 INFO L85 PathProgramCache]: Analyzing trace with hash 86554880, now seen corresponding path program 1 times [2024-11-16 07:53:04,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:53:04,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604611973] [2024-11-16 07:53:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:04,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:53:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:04,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 07:53:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:04,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 07:53:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:04,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-16 07:53:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:04,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:53:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:04,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 07:53:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:04,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 07:53:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:04,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:53:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:04,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 07:53:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 07:53:04,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:53:04,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604611973] [2024-11-16 07:53:04,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604611973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:53:04,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070108125] [2024-11-16 07:53:04,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:04,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:53:04,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:53:04,144 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:53:04,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 07:53:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:04,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 07:53:04,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:04,244 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 07:53:04,245 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:53:04,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070108125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:04,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 07:53:04,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-16 07:53:04,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628573217] [2024-11-16 07:53:04,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:04,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:53:04,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:53:04,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:53:04,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-16 07:53:04,246 INFO L87 Difference]: Start difference. First operand 1248 states and 1507 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 07:53:04,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:04,285 INFO L93 Difference]: Finished difference Result 1752 states and 2107 transitions. [2024-11-16 07:53:04,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:53:04,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 98 [2024-11-16 07:53:04,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:04,287 INFO L225 Difference]: With dead ends: 1752 [2024-11-16 07:53:04,287 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 07:53:04,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-16 07:53:04,290 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:04,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:04,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 07:53:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 07:53:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 07:53:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 07:53:04,291 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2024-11-16 07:53:04,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:04,291 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 07:53:04,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 07:53:04,291 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 07:53:04,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 07:53:04,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 07:53:04,307 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-16 07:53:04,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:53:04,497 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:04,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 07:53:07,485 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 07:53:07,511 WARN L156 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (<= 1 |old(~pumpRunning~0)|))) (or (and (<= 2 ~waterLevel~0) .cse0 (not (= 0 ~systemActive~0))) (and (= 1 ~systemActive~0) (<= 1 ~waterLevel~0) .cse0)))) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0))) (or (and .cse0 (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0))) (and .cse0 (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)))) [2024-11-16 07:53:07,552 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (= ~methaneLevelCritical~0 0) (not .cse0)) (let ((.cse4 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse5 (= 0 ~systemActive~0)) (.cse3 (= ~waterLevel~0 1))) (or (and .cse1 .cse0 .cse2 .cse3) (and .cse1 .cse0 .cse4 .cse5) (and (<= 1 ~pumpRunning~0) .cse4 .cse2) (and .cse1 .cse0 .cse4 .cse2) (and .cse1 .cse0 .cse5 .cse3))))) Eliminated clause: (let ((.cse4 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse5 (= 0 ~systemActive~0)) (.cse3 (= ~waterLevel~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5) (and (<= 1 ~pumpRunning~0) .cse4 .cse2) (and .cse0 .cse1 .cse4 .cse2) (and .cse0 .cse1 .cse5 .cse3))) [2024-11-16 07:53:07,563 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: Variable |isMethaneLevelCritical_#res| not permitted in ensures for changeMethaneLevel: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (not (= ~methaneLevelCritical~0 0)) (= |isMethaneLevelCritical_#res| 0) (not .cse0)) (let ((.cse4 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse5 (= 0 ~systemActive~0)) (.cse3 (= ~waterLevel~0 1))) (or (and .cse1 .cse0 .cse2 .cse3) (and .cse1 .cse0 .cse4 .cse5) (and (<= 1 ~pumpRunning~0) .cse4 .cse2) (and .cse1 .cse0 .cse4 .cse2) (and .cse1 .cse0 .cse5 .cse3))))) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.checkPermissibleVariables(FloydHoareUtils.java:204) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:169) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-16 07:53:07,572 INFO L158 Benchmark]: Toolchain (without parser) took 9809.01ms. Allocated memory was 157.3MB in the beginning and 346.0MB in the end (delta: 188.7MB). Free memory was 127.6MB in the beginning and 308.2MB in the end (delta: -180.5MB). Peak memory consumption was 209.7MB. Max. memory is 16.1GB. [2024-11-16 07:53:07,572 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 157.3MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:53:07,572 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.42ms. Allocated memory is still 157.3MB. Free memory was 127.6MB in the beginning and 105.3MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 07:53:07,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.78ms. Allocated memory is still 157.3MB. Free memory was 105.3MB in the beginning and 103.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:53:07,573 INFO L158 Benchmark]: Boogie Preprocessor took 30.65ms. Allocated memory is still 157.3MB. Free memory was 103.2MB in the beginning and 101.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:53:07,573 INFO L158 Benchmark]: IcfgBuilder took 382.98ms. Allocated memory is still 157.3MB. Free memory was 101.2MB in the beginning and 80.8MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 07:53:07,573 INFO L158 Benchmark]: TraceAbstraction took 8942.13ms. Allocated memory was 157.3MB in the beginning and 346.0MB in the end (delta: 188.7MB). Free memory was 80.2MB in the beginning and 308.2MB in the end (delta: -228.0MB). Peak memory consumption was 163.5MB. Max. memory is 16.1GB. [2024-11-16 07:53:07,574 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 157.3MB. Free memory is still 114.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.42ms. Allocated memory is still 157.3MB. Free memory was 127.6MB in the beginning and 105.3MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.78ms. Allocated memory is still 157.3MB. Free memory was 105.3MB in the beginning and 103.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.65ms. Allocated memory is still 157.3MB. Free memory was 103.2MB in the beginning and 101.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 382.98ms. Allocated memory is still 157.3MB. Free memory was 101.2MB in the beginning and 80.8MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8942.13ms. Allocated memory was 157.3MB in the beginning and 346.0MB in the end (delta: 188.7MB). Free memory was 80.2MB in the beginning and 308.2MB in the end (delta: -228.0MB). Peak memory consumption was 163.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] - GenericResultAtLocation [Line: 124]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [124] - GenericResultAtLocation [Line: 354]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [354] - GenericResultAtLocation [Line: 455]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [455] - GenericResultAtLocation [Line: 495]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [495] - GenericResultAtLocation [Line: 530]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [530] - GenericResultAtLocation [Line: 634]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [634] - GenericResultAtLocation [Line: 1000]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1000] * 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: 1005]: 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, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1380 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1348 mSDsluCounter, 4238 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2794 mSDsCounter, 289 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 937 IncrementalHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 289 mSolverCounterUnsat, 1444 mSDtfsCounter, 937 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 664 GetRequests, 574 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1248occurred in iteration=12, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 407 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1162 NumberOfCodeBlocks, 1162 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1238 ConstructedInterpolants, 0 QuantifiedInterpolants, 2314 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1295 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 277/300 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: 66]: Location Invariant Derived location invariant: null - InvariantResult [Line: 366]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 229]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: ((((1 <= pumpRunning) && (2 <= waterLevel)) && (0 != systemActive)) || (((1 <= pumpRunning) && (1 == systemActive)) && (1 <= waterLevel))) Ensures: (((pumpRunning == 0) && ((((2 <= waterLevel) && (1 <= \old(pumpRunning))) && (0 != systemActive)) || (((1 == systemActive) && (1 <= waterLevel)) && (1 <= \old(pumpRunning))))) && ((((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 162]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (waterLevel == 1)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive))) Ensures: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (waterLevel == 1)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive))) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ExceptionOrErrorResult: IllegalStateException: Variable |isMethaneLevelCritical_#res| not permitted in ensures for changeMethaneLevel: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (not (= ~methaneLevelCritical~0 0)) (= |isMethaneLevelCritical_#res| 0) (not .cse0)) (let ((.cse4 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse5 (= 0 ~systemActive~0)) (.cse3 (= ~waterLevel~0 1))) (or (and .cse1 .cse0 .cse2 .cse3) (and .cse1 .cse0 .cse4 .cse5) (and (<= 1 ~pumpRunning~0) .cse4 .cse2) (and .cse1 .cse0 .cse4 .cse2) (and .cse1 .cse0 .cse5 .cse3))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: Variable |isMethaneLevelCritical_#res| not permitted in ensures for changeMethaneLevel: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (not (= ~methaneLevelCritical~0 0)) (= |isMethaneLevelCritical_#res| 0) (not .cse0)) (let ((.cse4 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse5 (= 0 ~systemActive~0)) (.cse3 (= ~waterLevel~0 1))) (or (and .cse1 .cse0 .cse2 .cse3) (and .cse1 .cse0 .cse4 .cse5) (and (<= 1 ~pumpRunning~0) .cse4 .cse2) (and .cse1 .cse0 .cse4 .cse2) (and .cse1 .cse0 .cse5 .cse3))))): de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.checkPermissibleVariables(FloydHoareUtils.java:204) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-16 07:53:07,621 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_spec2_product52.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 4583285deb29d8014ded34089a46614a743cea13eee9bbb990cdfd770bfce36e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:53:09,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:53:09,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 07:53:09,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:53:09,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:53:09,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:53:09,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:53:09,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:53:09,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:53:09,773 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:53:09,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:53:09,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:53:09,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:53:09,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:53:09,774 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:53:09,774 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:53:09,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:53:09,775 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:53:09,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:53:09,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:53:09,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:53:09,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:53:09,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:53:09,776 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 07:53:09,777 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 07:53:09,777 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:53:09,777 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 07:53:09,777 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:53:09,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:53:09,778 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:53:09,778 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:53:09,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:53:09,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:53:09,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:53:09,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:53:09,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:53:09,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:53:09,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:53:09,779 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 07:53:09,780 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 07:53:09,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:53:09,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:53:09,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:53:09,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:53:09,781 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 -> 4583285deb29d8014ded34089a46614a743cea13eee9bbb990cdfd770bfce36e [2024-11-16 07:53:10,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:53:10,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:53:10,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:53:10,038 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:53:10,039 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:53:10,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c [2024-11-16 07:53:11,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:53:11,619 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:53:11,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c [2024-11-16 07:53:11,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b538f5e1/2e764b0cecea4defb24fcb8e76451d72/FLAG0828f5295 [2024-11-16 07:53:11,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b538f5e1/2e764b0cecea4defb24fcb8e76451d72 [2024-11-16 07:53:11,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:53:11,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:53:11,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:53:11,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:53:11,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:53:11,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:53:11" (1/1) ... [2024-11-16 07:53:11,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@759fe39c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:11, skipping insertion in model container [2024-11-16 07:53:11,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:53:11" (1/1) ... [2024-11-16 07:53:11,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:53:11,893 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 07:53:11,898 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 07:53:11,904 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 07:53:11,907 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 07:53:11,911 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 07:53:11,921 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 07:53:11,922 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 07:53:11,923 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 07:53:11,928 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 07:53:11,943 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_spec2_product52.cil.c[19177,19190] [2024-11-16 07:53:11,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:53:11,958 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:53:11,965 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2024-11-16 07:53:11,966 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [124] [2024-11-16 07:53:11,966 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [354] [2024-11-16 07:53:11,966 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [455] [2024-11-16 07:53:11,966 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [495] [2024-11-16 07:53:11,966 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [530] [2024-11-16 07:53:11,966 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [634] [2024-11-16 07:53:11,966 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1000] [2024-11-16 07:53:12,044 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_spec2_product52.cil.c[19177,19190] [2024-11-16 07:53:12,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:53:12,065 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:53:12,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:12 WrapperNode [2024-11-16 07:53:12,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:53:12,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:53:12,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:53:12,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:53:12,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:12" (1/1) ... [2024-11-16 07:53:12,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:12" (1/1) ... [2024-11-16 07:53:12,114 INFO L138 Inliner]: procedures = 60, calls = 102, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 200 [2024-11-16 07:53:12,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:53:12,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:53:12,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:53:12,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:53:12,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:12" (1/1) ... [2024-11-16 07:53:12,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:12" (1/1) ... [2024-11-16 07:53:12,126 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:12" (1/1) ... [2024-11-16 07:53:12,143 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 07:53:12,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:12" (1/1) ... [2024-11-16 07:53:12,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:12" (1/1) ... [2024-11-16 07:53:12,151 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:12" (1/1) ... [2024-11-16 07:53:12,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:12" (1/1) ... [2024-11-16 07:53:12,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:12" (1/1) ... [2024-11-16 07:53:12,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:12" (1/1) ... [2024-11-16 07:53:12,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:53:12,160 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:53:12,160 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:53:12,160 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:53:12,161 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:12" (1/1) ... [2024-11-16 07:53:12,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:53:12,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:53:12,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 07:53:12,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 07:53:12,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:53:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-16 07:53:12,251 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-16 07:53:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-16 07:53:12,251 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-16 07:53:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-16 07:53:12,251 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-16 07:53:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-16 07:53:12,251 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-16 07:53:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-16 07:53:12,251 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-16 07:53:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-16 07:53:12,251 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-16 07:53:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 07:53:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-16 07:53:12,251 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-16 07:53:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-16 07:53:12,252 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-16 07:53:12,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:53:12,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:53:12,357 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:53:12,362 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:53:12,440 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L576: #res := ~retValue_acc~7; [2024-11-16 07:53:12,576 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L254-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~1#1; [2024-11-16 07:53:12,577 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L631-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~10#1; [2024-11-16 07:53:12,577 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L328-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~3#1; [2024-11-16 07:53:12,701 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L527-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2024-11-16 07:53:12,701 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L452-1: main_#res#1 := main_~retValue_acc~4#1; [2024-11-16 07:53:12,745 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L309-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1; [2024-11-16 07:53:12,746 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L622-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~9#1; [2024-11-16 07:53:12,787 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-16 07:53:12,787 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:53:12,806 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:53:12,807 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:53:12,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:53:12 BoogieIcfgContainer [2024-11-16 07:53:12,808 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:53:12,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:53:12,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:53:12,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:53:12,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:53:11" (1/3) ... [2024-11-16 07:53:12,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3074b1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:53:12, skipping insertion in model container [2024-11-16 07:53:12,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:53:12" (2/3) ... [2024-11-16 07:53:12,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3074b1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:53:12, skipping insertion in model container [2024-11-16 07:53:12,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:53:12" (3/3) ... [2024-11-16 07:53:12,819 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product52.cil.c [2024-11-16 07:53:12,846 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:53:12,846 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:53:12,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:53:12,953 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;@79f6baf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:53:12,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:53:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 88 states have internal predecessors, (107), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-16 07:53:12,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-16 07:53:12,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:12,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:12,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:12,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:12,984 INFO L85 PathProgramCache]: Analyzing trace with hash -885647571, now seen corresponding path program 1 times [2024-11-16 07:53:12,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 07:53:12,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626783426] [2024-11-16 07:53:12,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:12,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:13,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 07:53:13,010 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 07:53:13,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 07:53:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:13,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 07:53:13,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:53:13,211 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:53:13,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 07:53:13,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626783426] [2024-11-16 07:53:13,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626783426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:13,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:13,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 07:53:13,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726179452] [2024-11-16 07:53:13,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:13,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 07:53:13,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 07:53:13,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 07:53:13,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 07:53:13,254 INFO L87 Difference]: Start difference. First operand has 102 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 88 states have internal predecessors, (107), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:53:13,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:13,294 INFO L93 Difference]: Finished difference Result 194 states and 259 transitions. [2024-11-16 07:53:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 07:53:13,301 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-16 07:53:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:13,316 INFO L225 Difference]: With dead ends: 194 [2024-11-16 07:53:13,317 INFO L226 Difference]: Without dead ends: 91 [2024-11-16 07:53:13,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 07:53:13,326 INFO L432 NwaCegarLoop]: 126 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, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:13,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-16 07:53:13,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-16 07:53:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.3) internal successors, (91), 78 states have internal predecessors, (91), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 07:53:13,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2024-11-16 07:53:13,392 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 27 [2024-11-16 07:53:13,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:13,392 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2024-11-16 07:53:13,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:53:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2024-11-16 07:53:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-16 07:53:13,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:13,399 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:13,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 07:53:13,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:13,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:13,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:13,606 INFO L85 PathProgramCache]: Analyzing trace with hash 6314635, now seen corresponding path program 1 times [2024-11-16 07:53:13,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 07:53:13,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462943453] [2024-11-16 07:53:13,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:13,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:13,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 07:53:13,614 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 07:53:13,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 07:53:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:13,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 07:53:13,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:53:13,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:53:13,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 07:53:13,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462943453] [2024-11-16 07:53:13,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462943453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:13,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:13,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:53:13,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560960690] [2024-11-16 07:53:13,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:13,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:53:13,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 07:53:13,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:53:13,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:53:13,763 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:53:13,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:13,791 INFO L93 Difference]: Finished difference Result 139 states and 177 transitions. [2024-11-16 07:53:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:53:13,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-16 07:53:13,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:13,796 INFO L225 Difference]: With dead ends: 139 [2024-11-16 07:53:13,796 INFO L226 Difference]: Without dead ends: 80 [2024-11-16 07:53:13,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:53:13,798 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:13,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 179 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-16 07:53:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-16 07:53:13,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 70 states have internal predecessors, (82), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-16 07:53:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2024-11-16 07:53:13,822 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 30 [2024-11-16 07:53:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:13,822 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2024-11-16 07:53:13,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:53:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2024-11-16 07:53:13,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-16 07:53:13,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:13,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:13,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 07:53:14,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:14,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:14,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:14,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2139122387, now seen corresponding path program 1 times [2024-11-16 07:53:14,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 07:53:14,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488046157] [2024-11-16 07:53:14,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:14,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:14,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 07:53:14,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 07:53:14,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 07:53:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:14,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 07:53:14,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:53:14,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:53:14,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 07:53:14,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488046157] [2024-11-16 07:53:14,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488046157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:14,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:14,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 07:53:14,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4875787] [2024-11-16 07:53:14,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:14,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:53:14,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 07:53:14,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:53:14,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:53:14,108 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:53:14,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:14,128 INFO L93 Difference]: Finished difference Result 222 states and 289 transitions. [2024-11-16 07:53:14,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:53:14,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-11-16 07:53:14,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:14,130 INFO L225 Difference]: With dead ends: 222 [2024-11-16 07:53:14,130 INFO L226 Difference]: Without dead ends: 150 [2024-11-16 07:53:14,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:53:14,131 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 78 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:14,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 209 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:14,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-16 07:53:14,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2024-11-16 07:53:14,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 126 states have internal predecessors, (150), 20 states have call successors, (20), 14 states have call predecessors, (20), 14 states have return successors, (20), 13 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 07:53:14,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2024-11-16 07:53:14,146 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 33 [2024-11-16 07:53:14,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:14,146 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2024-11-16 07:53:14,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:53:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2024-11-16 07:53:14,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-16 07:53:14,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:14,148 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:14,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 07:53:14,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:14,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:14,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:14,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1551993778, now seen corresponding path program 1 times [2024-11-16 07:53:14,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 07:53:14,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942637021] [2024-11-16 07:53:14,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:14,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:14,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 07:53:14,354 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 07:53:14,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 07:53:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:14,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 07:53:14,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:14,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:53:14,488 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:53:14,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 07:53:14,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942637021] [2024-11-16 07:53:14,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942637021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:14,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:14,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:53:14,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779425460] [2024-11-16 07:53:14,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:14,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:53:14,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 07:53:14,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:53:14,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:53:14,490 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:53:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:14,638 INFO L93 Difference]: Finished difference Result 413 states and 548 transitions. [2024-11-16 07:53:14,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 07:53:14,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-16 07:53:14,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:14,641 INFO L225 Difference]: With dead ends: 413 [2024-11-16 07:53:14,641 INFO L226 Difference]: Without dead ends: 275 [2024-11-16 07:53:14,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 07:53:14,643 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 63 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:14,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 464 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:53:14,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-16 07:53:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-11-16 07:53:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 206 states have (on average 1.3398058252427185) internal successors, (276), 235 states have internal predecessors, (276), 40 states have call successors, (40), 28 states have call predecessors, (40), 28 states have return successors, (42), 26 states have call predecessors, (42), 40 states have call successors, (42) [2024-11-16 07:53:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 358 transitions. [2024-11-16 07:53:14,671 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 358 transitions. Word has length 36 [2024-11-16 07:53:14,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:14,672 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 358 transitions. [2024-11-16 07:53:14,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:53:14,672 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 358 transitions. [2024-11-16 07:53:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-16 07:53:14,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:14,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:14,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 07:53:14,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:14,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:14,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:14,876 INFO L85 PathProgramCache]: Analyzing trace with hash 660501043, now seen corresponding path program 1 times [2024-11-16 07:53:14,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 07:53:14,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854171621] [2024-11-16 07:53:14,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:14,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:14,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 07:53:14,883 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 07:53:14,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 07:53:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:14,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 07:53:14,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:53:14,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:53:14,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 07:53:14,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854171621] [2024-11-16 07:53:14,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854171621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:14,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:14,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:53:14,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374235906] [2024-11-16 07:53:14,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:14,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:53:14,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 07:53:14,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:53:14,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:53:14,966 INFO L87 Difference]: Start difference. First operand 275 states and 358 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:53:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:15,037 INFO L93 Difference]: Finished difference Result 708 states and 940 transitions. [2024-11-16 07:53:15,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:53:15,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2024-11-16 07:53:15,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:15,040 INFO L225 Difference]: With dead ends: 708 [2024-11-16 07:53:15,040 INFO L226 Difference]: Without dead ends: 441 [2024-11-16 07:53:15,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:53:15,042 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 63 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:15,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 361 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:15,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-16 07:53:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 439. [2024-11-16 07:53:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 330 states have (on average 1.290909090909091) internal successors, (426), 359 states have internal predecessors, (426), 56 states have call successors, (56), 52 states have call predecessors, (56), 52 states have return successors, (76), 50 states have call predecessors, (76), 56 states have call successors, (76) [2024-11-16 07:53:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 558 transitions. [2024-11-16 07:53:15,087 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 558 transitions. Word has length 40 [2024-11-16 07:53:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:15,087 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 558 transitions. [2024-11-16 07:53:15,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:53:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 558 transitions. [2024-11-16 07:53:15,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 07:53:15,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:15,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:15,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-16 07:53:15,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:15,291 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:15,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:15,291 INFO L85 PathProgramCache]: Analyzing trace with hash 20015554, now seen corresponding path program 1 times [2024-11-16 07:53:15,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 07:53:15,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714786584] [2024-11-16 07:53:15,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:15,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:15,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 07:53:15,296 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 07:53:15,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-16 07:53:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:15,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 07:53:15,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:53:15,361 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:53:15,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 07:53:15,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714786584] [2024-11-16 07:53:15,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714786584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:15,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:15,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 07:53:15,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178196969] [2024-11-16 07:53:15,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:15,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 07:53:15,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 07:53:15,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 07:53:15,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 07:53:15,363 INFO L87 Difference]: Start difference. First operand 439 states and 558 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:53:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:15,394 INFO L93 Difference]: Finished difference Result 878 states and 1152 transitions. [2024-11-16 07:53:15,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 07:53:15,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-16 07:53:15,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:15,397 INFO L225 Difference]: With dead ends: 878 [2024-11-16 07:53:15,397 INFO L226 Difference]: Without dead ends: 447 [2024-11-16 07:53:15,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 07:53:15,399 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:15,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:15,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-16 07:53:15,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2024-11-16 07:53:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 338 states have (on average 1.2840236686390532) internal successors, (434), 367 states have internal predecessors, (434), 56 states have call successors, (56), 52 states have call predecessors, (56), 52 states have return successors, (76), 50 states have call predecessors, (76), 56 states have call successors, (76) [2024-11-16 07:53:15,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 566 transitions. [2024-11-16 07:53:15,426 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 566 transitions. Word has length 51 [2024-11-16 07:53:15,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:15,426 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 566 transitions. [2024-11-16 07:53:15,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:53:15,427 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 566 transitions. [2024-11-16 07:53:15,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 07:53:15,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:15,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:15,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-16 07:53:15,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:15,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:15,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:15,632 INFO L85 PathProgramCache]: Analyzing trace with hash 428839779, now seen corresponding path program 1 times [2024-11-16 07:53:15,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 07:53:15,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737079787] [2024-11-16 07:53:15,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:15,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:15,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 07:53:15,635 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 07:53:15,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-16 07:53:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:15,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 07:53:15,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:53:15,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:53:15,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 07:53:15,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737079787] [2024-11-16 07:53:15,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737079787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:15,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:15,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:53:15,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576683077] [2024-11-16 07:53:15,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:15,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:53:15,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 07:53:15,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:53:15,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:53:15,753 INFO L87 Difference]: Start difference. First operand 447 states and 566 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:53:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:15,808 INFO L93 Difference]: Finished difference Result 898 states and 1156 transitions. [2024-11-16 07:53:15,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:53:15,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-16 07:53:15,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:15,813 INFO L225 Difference]: With dead ends: 898 [2024-11-16 07:53:15,813 INFO L226 Difference]: Without dead ends: 459 [2024-11-16 07:53:15,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:53:15,814 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:15,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 390 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-16 07:53:15,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2024-11-16 07:53:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 350 states have (on average 1.2742857142857142) internal successors, (446), 379 states have internal predecessors, (446), 56 states have call successors, (56), 52 states have call predecessors, (56), 52 states have return successors, (76), 50 states have call predecessors, (76), 56 states have call successors, (76) [2024-11-16 07:53:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 578 transitions. [2024-11-16 07:53:15,836 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 578 transitions. Word has length 51 [2024-11-16 07:53:15,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:15,836 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 578 transitions. [2024-11-16 07:53:15,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:53:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 578 transitions. [2024-11-16 07:53:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 07:53:15,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:15,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:15,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-16 07:53:16,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:16,038 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:16,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:16,038 INFO L85 PathProgramCache]: Analyzing trace with hash 238870272, now seen corresponding path program 1 times [2024-11-16 07:53:16,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 07:53:16,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223002258] [2024-11-16 07:53:16,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:16,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:16,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 07:53:16,041 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 07:53:16,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-16 07:53:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:16,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 07:53:16,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:53:16,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:53:16,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 07:53:16,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223002258] [2024-11-16 07:53:16,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223002258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:16,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:16,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 07:53:16,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933146737] [2024-11-16 07:53:16,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:16,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:53:16,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 07:53:16,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:53:16,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:53:16,125 INFO L87 Difference]: Start difference. First operand 459 states and 578 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:53:16,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:16,165 INFO L93 Difference]: Finished difference Result 1102 states and 1396 transitions. [2024-11-16 07:53:16,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:53:16,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-16 07:53:16,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:16,167 INFO L225 Difference]: With dead ends: 1102 [2024-11-16 07:53:16,168 INFO L226 Difference]: Without dead ends: 651 [2024-11-16 07:53:16,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:53:16,169 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 36 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:16,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 187 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:16,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-16 07:53:16,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2024-11-16 07:53:16,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 498 states have (on average 1.2369477911646587) internal successors, (616), 531 states have internal predecessors, (616), 80 states have call successors, (80), 76 states have call predecessors, (80), 72 states have return successors, (102), 70 states have call predecessors, (102), 80 states have call successors, (102) [2024-11-16 07:53:16,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 798 transitions. [2024-11-16 07:53:16,209 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 798 transitions. Word has length 51 [2024-11-16 07:53:16,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:16,209 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 798 transitions. [2024-11-16 07:53:16,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 07:53:16,209 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 798 transitions. [2024-11-16 07:53:16,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-16 07:53:16,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:16,210 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:16,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-16 07:53:16,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:16,412 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:16,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:16,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2022921374, now seen corresponding path program 1 times [2024-11-16 07:53:16,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 07:53:16,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32544952] [2024-11-16 07:53:16,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:16,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:16,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 07:53:16,416 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 07:53:16,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-16 07:53:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:16,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 07:53:16,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:53:16,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:53:16,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 07:53:16,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32544952] [2024-11-16 07:53:16,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32544952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:16,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:16,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:53:16,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476154447] [2024-11-16 07:53:16,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:16,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:53:16,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 07:53:16,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:53:16,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:53:16,519 INFO L87 Difference]: Start difference. First operand 651 states and 798 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 07:53:16,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:16,561 INFO L93 Difference]: Finished difference Result 978 states and 1221 transitions. [2024-11-16 07:53:16,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:53:16,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2024-11-16 07:53:16,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:16,565 INFO L225 Difference]: With dead ends: 978 [2024-11-16 07:53:16,565 INFO L226 Difference]: Without dead ends: 975 [2024-11-16 07:53:16,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:53:16,566 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 50 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:16,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 191 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:16,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-16 07:53:16,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 818. [2024-11-16 07:53:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 624 states have (on average 1.25) internal successors, (780), 671 states have internal predecessors, (780), 101 states have call successors, (101), 95 states have call predecessors, (101), 92 states have return successors, (139), 85 states have call predecessors, (139), 101 states have call successors, (139) [2024-11-16 07:53:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1020 transitions. [2024-11-16 07:53:16,631 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1020 transitions. Word has length 55 [2024-11-16 07:53:16,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:16,631 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1020 transitions. [2024-11-16 07:53:16,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 07:53:16,632 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1020 transitions. [2024-11-16 07:53:16,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-16 07:53:16,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:16,634 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 07:53:16,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-16 07:53:16,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:16,835 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:16,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:16,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1764085079, now seen corresponding path program 1 times [2024-11-16 07:53:16,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 07:53:16,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120467135] [2024-11-16 07:53:16,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:16,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:16,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 07:53:16,839 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 07:53:16,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-16 07:53:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:16,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 07:53:16,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:53:16,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:53:16,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 07:53:16,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120467135] [2024-11-16 07:53:16,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120467135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:16,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:16,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:53:16,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517991564] [2024-11-16 07:53:16,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:16,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:53:16,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 07:53:16,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:53:16,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:53:16,954 INFO L87 Difference]: Start difference. First operand 818 states and 1020 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 07:53:17,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:17,027 INFO L93 Difference]: Finished difference Result 1761 states and 2216 transitions. [2024-11-16 07:53:17,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:53:17,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 86 [2024-11-16 07:53:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:17,032 INFO L225 Difference]: With dead ends: 1761 [2024-11-16 07:53:17,032 INFO L226 Difference]: Without dead ends: 951 [2024-11-16 07:53:17,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:53:17,034 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 55 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:17,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:17,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-11-16 07:53:17,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 943. [2024-11-16 07:53:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 719 states have (on average 1.243393602225313) internal successors, (894), 772 states have internal predecessors, (894), 117 states have call successors, (117), 111 states have call predecessors, (117), 106 states have return successors, (165), 99 states have call predecessors, (165), 117 states have call successors, (165) [2024-11-16 07:53:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1176 transitions. [2024-11-16 07:53:17,096 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1176 transitions. Word has length 86 [2024-11-16 07:53:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:17,096 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1176 transitions. [2024-11-16 07:53:17,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 07:53:17,097 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1176 transitions. [2024-11-16 07:53:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-16 07:53:17,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:17,099 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:17,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-16 07:53:17,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:17,305 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:17,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:17,306 INFO L85 PathProgramCache]: Analyzing trace with hash 354617373, now seen corresponding path program 1 times [2024-11-16 07:53:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 07:53:17,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215573573] [2024-11-16 07:53:17,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:17,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:17,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 07:53:17,309 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 07:53:17,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-16 07:53:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:17,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 07:53:17,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:53:17,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:53:17,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 07:53:17,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215573573] [2024-11-16 07:53:17,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215573573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:17,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:17,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:53:17,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391856487] [2024-11-16 07:53:17,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:17,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:53:17,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 07:53:17,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:53:17,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:53:17,394 INFO L87 Difference]: Start difference. First operand 943 states and 1176 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 07:53:17,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:17,459 INFO L93 Difference]: Finished difference Result 1603 states and 2044 transitions. [2024-11-16 07:53:17,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:53:17,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 95 [2024-11-16 07:53:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:17,463 INFO L225 Difference]: With dead ends: 1603 [2024-11-16 07:53:17,463 INFO L226 Difference]: Without dead ends: 920 [2024-11-16 07:53:17,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:53:17,464 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 43 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:17,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 212 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-11-16 07:53:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2024-11-16 07:53:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 700 states have (on average 1.2114285714285715) internal successors, (848), 750 states have internal predecessors, (848), 115 states have call successors, (115), 109 states have call predecessors, (115), 104 states have return successors, (156), 98 states have call predecessors, (156), 115 states have call successors, (156) [2024-11-16 07:53:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1119 transitions. [2024-11-16 07:53:17,513 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1119 transitions. Word has length 95 [2024-11-16 07:53:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:17,513 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1119 transitions. [2024-11-16 07:53:17,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 07:53:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1119 transitions. [2024-11-16 07:53:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 07:53:17,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:17,516 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 07:53:17,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-16 07:53:17,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:17,718 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:17,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:17,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2131203073, now seen corresponding path program 1 times [2024-11-16 07:53:17,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 07:53:17,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566177545] [2024-11-16 07:53:17,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:17,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:17,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 07:53:17,722 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 07:53:17,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-16 07:53:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:17,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 07:53:17,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 07:53:17,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:53:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 07:53:18,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 07:53:18,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566177545] [2024-11-16 07:53:18,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566177545] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:53:18,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 07:53:18,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-11-16 07:53:18,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9612159] [2024-11-16 07:53:18,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 07:53:18,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 07:53:18,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 07:53:18,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 07:53:18,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:53:18,178 INFO L87 Difference]: Start difference. First operand 920 states and 1119 transitions. Second operand has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 12 states have internal predecessors, (124), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-16 07:53:19,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:19,271 INFO L93 Difference]: Finished difference Result 4890 states and 6288 transitions. [2024-11-16 07:53:19,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-16 07:53:19,272 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 12 states have internal predecessors, (124), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) Word has length 98 [2024-11-16 07:53:19,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:19,298 INFO L225 Difference]: With dead ends: 4890 [2024-11-16 07:53:19,302 INFO L226 Difference]: Without dead ends: 4230 [2024-11-16 07:53:19,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2024-11-16 07:53:19,309 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 589 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:19,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 949 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 07:53:19,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4230 states. [2024-11-16 07:53:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4230 to 4105. [2024-11-16 07:53:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 3110 states have (on average 1.197427652733119) internal successors, (3724), 3337 states have internal predecessors, (3724), 505 states have call successors, (505), 443 states have call predecessors, (505), 489 states have return successors, (833), 468 states have call predecessors, (833), 505 states have call successors, (833) [2024-11-16 07:53:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 5062 transitions. [2024-11-16 07:53:19,606 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 5062 transitions. Word has length 98 [2024-11-16 07:53:19,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:19,606 INFO L471 AbstractCegarLoop]: Abstraction has 4105 states and 5062 transitions. [2024-11-16 07:53:19,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 12 states have internal predecessors, (124), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-16 07:53:19,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 5062 transitions. [2024-11-16 07:53:19,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 07:53:19,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:19,609 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 07:53:19,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-16 07:53:19,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:19,812 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:19,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash 86554880, now seen corresponding path program 1 times [2024-11-16 07:53:19,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 07:53:19,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146192072] [2024-11-16 07:53:19,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:19,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:19,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 07:53:19,815 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 07:53:19,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-16 07:53:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:19,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 07:53:19,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:19,895 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 07:53:19,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:53:19,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 07:53:19,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146192072] [2024-11-16 07:53:19,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146192072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:19,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:19,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:53:19,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078310295] [2024-11-16 07:53:19,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:19,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:53:19,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 07:53:19,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:53:19,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:53:19,897 INFO L87 Difference]: Start difference. First operand 4105 states and 5062 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 07:53:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:19,970 INFO L93 Difference]: Finished difference Result 5001 states and 6110 transitions. [2024-11-16 07:53:19,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:53:19,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 98 [2024-11-16 07:53:19,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:19,976 INFO L225 Difference]: With dead ends: 5001 [2024-11-16 07:53:19,976 INFO L226 Difference]: Without dead ends: 1144 [2024-11-16 07:53:19,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:53:19,982 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:19,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 359 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:19,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-11-16 07:53:20,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1121. [2024-11-16 07:53:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 862 states have (on average 1.1670533642691416) internal successors, (1006), 914 states have internal predecessors, (1006), 125 states have call successors, (125), 121 states have call predecessors, (125), 133 states have return successors, (161), 124 states have call predecessors, (161), 125 states have call successors, (161) [2024-11-16 07:53:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1292 transitions. [2024-11-16 07:53:20,063 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1292 transitions. Word has length 98 [2024-11-16 07:53:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:20,063 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1292 transitions. [2024-11-16 07:53:20,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 07:53:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1292 transitions. [2024-11-16 07:53:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-16 07:53:20,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:53:20,065 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:20,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-16 07:53:20,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:20,268 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:53:20,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:53:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1906702613, now seen corresponding path program 1 times [2024-11-16 07:53:20,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 07:53:20,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318903745] [2024-11-16 07:53:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:53:20,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:20,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 07:53:20,272 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 07:53:20,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-16 07:53:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:53:20,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 07:53:20,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:53:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 07:53:20,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:53:20,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 07:53:20,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318903745] [2024-11-16 07:53:20,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318903745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:53:20,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:53:20,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:53:20,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002284470] [2024-11-16 07:53:20,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:53:20,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:53:20,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 07:53:20,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:53:20,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:53:20,330 INFO L87 Difference]: Start difference. First operand 1121 states and 1292 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 07:53:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:53:20,366 INFO L93 Difference]: Finished difference Result 1787 states and 2068 transitions. [2024-11-16 07:53:20,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:53:20,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 102 [2024-11-16 07:53:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:53:20,369 INFO L225 Difference]: With dead ends: 1787 [2024-11-16 07:53:20,369 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 07:53:20,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:53:20,371 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 38 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:53:20,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 201 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:53:20,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 07:53:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 07:53:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 07:53:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 07:53:20,373 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2024-11-16 07:53:20,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:53:20,373 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 07:53:20,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 07:53:20,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 07:53:20,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 07:53:20,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 07:53:20,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-16 07:53:20,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 07:53:20,578 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:53:20,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 07:53:24,360 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 07:53:24,389 WARN L156 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (let ((.cse0 (= (_ bv1 32) |old(~pumpRunning~0)|))) (or (and (= ~waterLevel~0 (_ bv1 32)) .cse0 (= (_ bv1 32) ~systemActive~0)) (and .cse0 (= ~waterLevel~0 (_ bv2 32)) (not (= (_ bv0 32) ~systemActive~0))))) (= (_ bv1 32) ~pumpRunning~0)) Eliminated clause: (and (or (and (= ~waterLevel~0 (_ bv1 32)) (= (_ bv1 32) ~systemActive~0)) (and (= ~waterLevel~0 (_ bv2 32)) (not (= (_ bv0 32) ~systemActive~0)))) (= (_ bv1 32) ~pumpRunning~0)) [2024-11-16 07:53:24,418 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse0 (= ~methAndRunningLastTime~0 (_ bv0 32)))) (and (or (not .cse0) (not (= (_ bv0 32) |old(~methaneLevelCritical~0)|)) (= ~methaneLevelCritical~0 (_ bv0 32))) (let ((.cse1 (= ~waterLevel~0 (_ bv1 32))) (.cse4 (= (_ bv0 32) ~systemActive~0)) (.cse2 (= (_ bv0 32) ~pumpRunning~0)) (.cse5 (= ~waterLevel~0 (_ bv2 32))) (.cse3 (= (_ bv1 32) ~systemActive~0))) (or (and .cse1 .cse2 .cse0 .cse3) (and .cse1 .cse2 .cse4 .cse0) (and .cse2 .cse4 .cse5 .cse0) (and .cse5 (= (_ bv1 32) ~pumpRunning~0) .cse3) (and .cse2 .cse5 .cse0 .cse3))))) Eliminated clause: (let ((.cse0 (= ~waterLevel~0 (_ bv1 32))) (.cse4 (= (_ bv0 32) ~systemActive~0)) (.cse1 (= (_ bv0 32) ~pumpRunning~0)) (.cse5 (= ~waterLevel~0 (_ bv2 32))) (.cse2 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse3 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse2) (and .cse1 .cse4 .cse5 .cse2) (and .cse5 (= (_ bv1 32) ~pumpRunning~0) .cse3) (and .cse1 .cse5 .cse2 .cse3))) [2024-11-16 07:53:24,443 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse5 (= (_ bv2 32) |old(~waterLevel~0)|)) (.cse7 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse6 (= (_ bv0 32) |old(~methAndRunningLastTime~0)|)) (.cse3 (= (_ bv0 32) ~systemActive~0))) (let ((.cse2 (not .cse3)) (.cse0 (not .cse6)) (.cse13 (not .cse7)) (.cse10 (= (_ bv0 32) ~pumpRunning~0)) (.cse1 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~systemActive~0)) (.cse4 (= (_ bv0 32) |old(~pumpRunning~0)|)) (.cse12 (not .cse5)) (.cse11 (= ~waterLevel~0 (_ bv2 32))) (.cse9 (= (_ bv1 32) |old(~pumpRunning~0)|))) (and (or .cse0 .cse1 .cse2) (or (and .cse3 .cse4 .cse5) (and .cse6 .cse4 .cse7 .cse8) (and .cse3 .cse4 .cse7) (and .cse6 .cse4 .cse5 .cse8) (and .cse9 .cse5 .cse8)) (or (and .cse10 .cse11) .cse12 .cse2) (or (and (= ~waterLevel~0 (_ bv1 32)) .cse10) .cse13) (or .cse0 .cse13 .cse1) (or (and .cse10 .cse11 .cse1) (not .cse8) (not .cse4) .cse12) (or (and .cse11 (= (_ bv1 32) ~pumpRunning~0)) (not .cse9))))) Eliminated clause: (exists ((|old(~waterLevel~0)| (_ BitVec 32)) (|old(~methAndRunningLastTime~0)| (_ BitVec 32)) (|old(~pumpRunning~0)| (_ BitVec 32))) (let ((.cse5 (= (_ bv2 32) |old(~waterLevel~0)|)) (.cse7 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse6 (= (_ bv0 32) |old(~methAndRunningLastTime~0)|)) (.cse3 (= (_ bv0 32) ~systemActive~0))) (let ((.cse2 (not .cse3)) (.cse0 (not .cse6)) (.cse13 (not .cse7)) (.cse10 (= (_ bv0 32) ~pumpRunning~0)) (.cse1 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~systemActive~0)) (.cse4 (= (_ bv0 32) |old(~pumpRunning~0)|)) (.cse12 (not .cse5)) (.cse11 (= ~waterLevel~0 (_ bv2 32))) (.cse9 (= (_ bv1 32) |old(~pumpRunning~0)|))) (and (or .cse0 .cse1 .cse2) (or (and .cse3 .cse4 .cse5) (and .cse6 .cse4 .cse7 .cse8) (and .cse3 .cse4 .cse7) (and .cse6 .cse4 .cse5 .cse8) (and .cse9 .cse5 .cse8)) (or (and .cse10 .cse11) .cse12 .cse2) (or (and (= ~waterLevel~0 (_ bv1 32)) .cse10) .cse13) (or .cse0 .cse13 .cse1) (or (and .cse10 .cse11 .cse1) (not .cse8) (not .cse4) .cse12) (or (and .cse11 (= (_ bv1 32) ~pumpRunning~0)) (not .cse9)))))) [2024-11-16 07:53:24,452 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-16 07:53:24,457 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= (_ bv0 32) ~pumpRunning~0) (let ((.cse1 (= ~waterLevel~0 (_ bv2 32))) (.cse4 (= ~methaneLevelCritical~0 (_ bv0 32))) (.cse5 (= ~waterLevel~0 (_ bv1 32))) (.cse0 (= (_ bv0 32) |old(~pumpRunning~0)|)) (.cse2 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse3 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse3) (and .cse5 .cse0 .cse4 .cse3) (and .cse5 .cse0 .cse2 .cse3)))) Eliminated clause: (and (= (_ bv0 32) ~pumpRunning~0) (let ((.cse1 (= ~methaneLevelCritical~0 (_ bv0 32))) (.cse3 (= ~waterLevel~0 (_ bv2 32))) (.cse0 (= ~waterLevel~0 (_ bv1 32))) (.cse4 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse2 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse0 .cse4 .cse2)))) [2024-11-16 07:53:24,471 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (let ((.cse0 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse1 (= (_ bv2 32) |old(~waterLevel~0)|))) (and (or (= ~waterLevel~0 (_ bv1 32)) (not .cse0)) (let ((.cse5 (= (_ bv0 32) ~systemActive~0)) (.cse3 (= (_ bv0 32) ~pumpRunning~0)) (.cse4 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse2 (= (_ bv1 32) ~systemActive~0))) (or (and (= (_ bv1 32) ~pumpRunning~0) .cse1 .cse2) (and .cse3 .cse0 .cse4 .cse2) (and .cse3 .cse5 .cse0 .cse4) (and .cse3 .cse5 .cse4 .cse1) (and .cse3 .cse4 .cse1 .cse2))) (or (= ~waterLevel~0 (_ bv2 32)) (not .cse1)))) Eliminated clause: (exists ((|old(~waterLevel~0)| (_ BitVec 32))) (let ((.cse0 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse1 (= (_ bv2 32) |old(~waterLevel~0)|))) (and (or (= ~waterLevel~0 (_ bv1 32)) (not .cse0)) (let ((.cse5 (= (_ bv0 32) ~systemActive~0)) (.cse3 (= (_ bv0 32) ~pumpRunning~0)) (.cse4 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse2 (= (_ bv1 32) ~systemActive~0))) (or (and (= (_ bv1 32) ~pumpRunning~0) .cse1 .cse2) (and .cse3 .cse0 .cse4 .cse2) (and .cse3 .cse5 .cse0 .cse4) (and .cse3 .cse5 .cse4 .cse1) (and .cse3 .cse4 .cse1 .cse2))) (or (= ~waterLevel~0 (_ bv2 32)) (not .cse1))))) [2024-11-16 07:53:24,476 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-16 07:53:24,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:53:24 BoogieIcfgContainer [2024-11-16 07:53:24,477 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 07:53:24,477 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 07:53:24,477 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 07:53:24,478 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 07:53:24,478 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:53:12" (3/4) ... [2024-11-16 07:53:24,480 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 07:53:24,483 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-11-16 07:53:24,483 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-16 07:53:24,483 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-16 07:53:24,483 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-11-16 07:53:24,483 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-16 07:53:24,483 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-16 07:53:24,484 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-11-16 07:53:24,484 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-16 07:53:24,488 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2024-11-16 07:53:24,488 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-16 07:53:24,489 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-16 07:53:24,489 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 07:53:24,489 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 07:53:24,562 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 07:53:24,562 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 07:53:24,563 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 07:53:24,563 INFO L158 Benchmark]: Toolchain (without parser) took 12919.50ms. Allocated memory was 94.4MB in the beginning and 415.2MB in the end (delta: 320.9MB). Free memory was 50.9MB in the beginning and 296.6MB in the end (delta: -245.7MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. [2024-11-16 07:53:24,563 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 58.7MB. Free memory was 28.3MB in the beginning and 28.2MB in the end (delta: 54.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:53:24,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.79ms. Allocated memory is still 94.4MB. Free memory was 50.5MB in the beginning and 70.3MB in the end (delta: -19.8MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2024-11-16 07:53:24,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.41ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 67.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:53:24,564 INFO L158 Benchmark]: Boogie Preprocessor took 44.98ms. Allocated memory is still 94.4MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:53:24,564 INFO L158 Benchmark]: IcfgBuilder took 647.55ms. Allocated memory is still 94.4MB. Free memory was 65.8MB in the beginning and 44.1MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 07:53:24,565 INFO L158 Benchmark]: TraceAbstraction took 11668.03ms. Allocated memory was 94.4MB in the beginning and 415.2MB in the end (delta: 320.9MB). Free memory was 43.2MB in the beginning and 305.0MB in the end (delta: -261.8MB). Peak memory consumption was 212.1MB. Max. memory is 16.1GB. [2024-11-16 07:53:24,565 INFO L158 Benchmark]: Witness Printer took 85.31ms. Allocated memory is still 415.2MB. Free memory was 305.0MB in the beginning and 296.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 07:53:24,566 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.64ms. Allocated memory is still 58.7MB. Free memory was 28.3MB in the beginning and 28.2MB in the end (delta: 54.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.79ms. Allocated memory is still 94.4MB. Free memory was 50.5MB in the beginning and 70.3MB in the end (delta: -19.8MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.41ms. Allocated memory is still 94.4MB. Free memory was 70.3MB in the beginning and 67.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.98ms. Allocated memory is still 94.4MB. Free memory was 67.9MB in the beginning and 65.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 647.55ms. Allocated memory is still 94.4MB. Free memory was 65.8MB in the beginning and 44.1MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11668.03ms. Allocated memory was 94.4MB in the beginning and 415.2MB in the end (delta: 320.9MB). Free memory was 43.2MB in the beginning and 305.0MB in the end (delta: -261.8MB). Peak memory consumption was 212.1MB. Max. memory is 16.1GB. * Witness Printer took 85.31ms. Allocated memory is still 415.2MB. Free memory was 305.0MB in the beginning and 296.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] - GenericResultAtLocation [Line: 124]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [124] - GenericResultAtLocation [Line: 354]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [354] - GenericResultAtLocation [Line: 455]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [455] - GenericResultAtLocation [Line: 495]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [495] - GenericResultAtLocation [Line: 530]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [530] - GenericResultAtLocation [Line: 634]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [634] - GenericResultAtLocation [Line: 1000]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1000] - 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: 1005]: 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, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1053 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1031 mSDsluCounter, 4278 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2732 mSDsCounter, 188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 852 IncrementalHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 188 mSolverCounterUnsat, 1546 mSDtfsCounter, 852 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 959 GetRequests, 908 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4105occurred in iteration=12, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 319 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 853 NumberOfCodeBlocks, 853 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 936 ConstructedInterpolants, 0 QuantifiedInterpolants, 1798 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1841 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 169/184 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: 66]: Location Invariant Derived location invariant: null - InvariantResult [Line: 366]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 229]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: ((((waterLevel == 1) && (1 == systemActive)) || ((waterLevel == 2) && (0 != systemActive))) && (1 == pumpRunning)) Ensures: (((0 == pumpRunning) && ((((waterLevel == 1) && (1 == \old(pumpRunning))) && (1 == systemActive)) || (((1 == \old(pumpRunning)) && (waterLevel == 2)) && (0 != systemActive)))) && ((((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 162]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((((waterLevel == 1) && (0 == pumpRunning)) && (methaneLevelCritical == 0)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: ((((((((waterLevel == 1) && (0 == pumpRunning)) && (methaneLevelCritical == 0)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methaneLevelCritical == 0)) && (1 == systemActive))) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 558]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == pumpRunning)) && (0 == systemActive)) && (methAndRunningLastTime == 0))) || ((((0 == pumpRunning) && (0 == systemActive)) && (waterLevel == 2)) && (methAndRunningLastTime == 0))) || (((waterLevel == 2) && (1 == pumpRunning)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) Ensures: (((((((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == pumpRunning)) && (0 == systemActive)) && (methAndRunningLastTime == 0))) || ((((0 == pumpRunning) && (0 == systemActive)) && (waterLevel == 2)) && (methAndRunningLastTime == 0))) || (((waterLevel == 2) && (1 == pumpRunning)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (head == \old(head)))) - ProcedureContractResult [Line: 570]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((((((waterLevel == 1) && (0 == pumpRunning)) && (0 == systemActive)) || (((0 == pumpRunning) && (waterLevel == 2)) && (1 == systemActive))) || (((waterLevel == 1) && (0 == pumpRunning)) && (1 == systemActive))) || ((((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == pumpRunning)) && (1 == systemActive))) || (((0 == pumpRunning) && (0 == systemActive)) && (waterLevel == 2))) || ((((waterLevel == 2) && (1 == pumpRunning)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: ((((((((((waterLevel == 1) && (0 == pumpRunning)) && (0 == systemActive)) || (((0 == pumpRunning) && (waterLevel == 2)) && (1 == systemActive))) || (((waterLevel == 1) && (0 == pumpRunning)) && (1 == systemActive))) || ((((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == pumpRunning)) && (1 == systemActive))) || (((0 == pumpRunning) && (0 == systemActive)) && (waterLevel == 2))) || ((((waterLevel == 2) && (1 == pumpRunning)) && (methaneLevelCritical == 0)) && (1 == systemActive))) && ((methaneLevelCritical != 0) || (0 == \result))) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 356]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 138]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: ((((((((1 != \old(waterLevel)) || (((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0))) && ((methaneLevelCritical != 0) || (methAndRunningLastTime == 0))) && (((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) || (2 != \old(waterLevel))) || (0 != systemActive))) && ((1 != \old(pumpRunning)) || (((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)))) && (((((waterLevel == 2) && (1 == pumpRunning)) || (((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0))) || (0 != \old(pumpRunning))) || (2 != \old(waterLevel)))) && (((((((0 == systemActive) && (0 == \old(pumpRunning))) && (2 == \old(waterLevel))) || ((((0 == \old(methAndRunningLastTime)) && (0 == \old(pumpRunning))) && (1 == \old(waterLevel))) && (1 == systemActive))) || (((0 == systemActive) && (0 == \old(pumpRunning))) && (1 == \old(waterLevel)))) || ((((0 == \old(methAndRunningLastTime)) && (0 == \old(pumpRunning))) && (2 == \old(waterLevel))) && (1 == systemActive))) || (((1 == \old(pumpRunning)) && (2 == \old(waterLevel))) && (1 == systemActive)))) && ((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 170]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((0 == pumpRunning) && ((((((waterLevel == 1) && (methaneLevelCritical == 0)) && (1 == systemActive)) || (((waterLevel == 2) && (methaneLevelCritical == 0)) && (1 == systemActive))) || (((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || (((waterLevel == 1) && (methAndRunningLastTime == 0)) && (1 == systemActive)))) Ensures: ((((((((((0 == \old(pumpRunning)) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || ((((0 == \old(pumpRunning)) && (waterLevel == 2)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((waterLevel == 1) && (0 == \old(pumpRunning))) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((waterLevel == 1) && (0 == \old(pumpRunning))) && (methAndRunningLastTime == 0)) && (1 == systemActive))) && ((0 == pumpRunning) || (waterLevel != 1))) && ((0 == pumpRunning) || (1 == pumpRunning))) && ((((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 546]: Procedure Contract for waterRise Derived contract for procedure waterRise. Ensures: (((waterLevel == 2) && (((((((1 == pumpRunning) && (2 == \old(waterLevel))) && (1 == systemActive)) || ((((0 == pumpRunning) && (1 == \old(waterLevel))) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || ((((0 == pumpRunning) && (0 == systemActive)) && (1 == \old(waterLevel))) && (methAndRunningLastTime == 0))) || ((((0 == pumpRunning) && (0 == systemActive)) && (methAndRunningLastTime == 0)) && (2 == \old(waterLevel)))) || ((((0 == pumpRunning) && (methAndRunningLastTime == 0)) && (2 == \old(waterLevel))) && (1 == systemActive)))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) RESULT: Ultimate proved your program to be correct! [2024-11-16 07:53:24,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE