./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_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-wip.dd.update-z3-fca748b-m [2024-11-19 22:05:43,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:05:43,728 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:05:43,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:05:43,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:05:43,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:05:43,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:05:43,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:05:43,768 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:05:43,769 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:05:43,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:05:43,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:05:43,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:05:43,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:05:43,773 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:05:43,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:05:43,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:05:43,774 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:05:43,774 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:05:43,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:05:43,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:05:43,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:05:43,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:05:43,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:05:43,779 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:05:43,779 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:05:43,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:05:43,779 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:05:43,780 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:05:43,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:05:43,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:05:43,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:05:43,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:05:43,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:05:43,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:05:43,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:05:43,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:05:43,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:05:43,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:05:43,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:05:43,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:05:43,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:05:43,784 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-19 22:05:44,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:05:44,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:05:44,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:05:44,090 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:05:44,091 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:05:44,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c [2024-11-19 22:05:45,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:05:45,833 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:05:45,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c [2024-11-19 22:05:45,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3512379b1/f422b83e3f7649eebcdb132d4830f2e5/FLAG0d2302d76 [2024-11-19 22:05:46,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3512379b1/f422b83e3f7649eebcdb132d4830f2e5 [2024-11-19 22:05:46,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:05:46,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:05:46,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:05:46,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:05:46,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:05:46,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:05:46" (1/1) ... [2024-11-19 22:05:46,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4450aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:46, skipping insertion in model container [2024-11-19 22:05:46,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:05:46" (1/1) ... [2024-11-19 22:05:46,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:05:46,522 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-19 22:05:46,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:05:46,541 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:05:46,550 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2024-11-19 22:05:46,552 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [124] [2024-11-19 22:05:46,552 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [354] [2024-11-19 22:05:46,552 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [455] [2024-11-19 22:05:46,552 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [495] [2024-11-19 22:05:46,553 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [530] [2024-11-19 22:05:46,553 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [634] [2024-11-19 22:05:46,553 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1000] [2024-11-19 22:05:46,613 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-19 22:05:46,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:05:46,643 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:05:46,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:46 WrapperNode [2024-11-19 22:05:46,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:05:46,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:05:46,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:05:46,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:05:46,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:46" (1/1) ... [2024-11-19 22:05:46,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:46" (1/1) ... [2024-11-19 22:05:46,699 INFO L138 Inliner]: procedures = 58, calls = 102, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 212 [2024-11-19 22:05:46,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:05:46,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:05:46,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:05:46,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:05:46,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:46" (1/1) ... [2024-11-19 22:05:46,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:46" (1/1) ... [2024-11-19 22:05:46,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:46" (1/1) ... [2024-11-19 22:05:46,729 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 22:05:46,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:46" (1/1) ... [2024-11-19 22:05:46,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:46" (1/1) ... [2024-11-19 22:05:46,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:46" (1/1) ... [2024-11-19 22:05:46,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:46" (1/1) ... [2024-11-19 22:05:46,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:46" (1/1) ... [2024-11-19 22:05:46,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:46" (1/1) ... [2024-11-19 22:05:46,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:05:46,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:05:46,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:05:46,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:05:46,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:46" (1/1) ... [2024-11-19 22:05:46,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:05:46,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:05:46,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 22:05:46,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 22:05:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:05:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-19 22:05:46,848 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-19 22:05:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-19 22:05:46,848 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-19 22:05:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-19 22:05:46,848 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-19 22:05:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-19 22:05:46,849 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-19 22:05:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-19 22:05:46,849 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-19 22:05:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-19 22:05:46,849 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-19 22:05:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-19 22:05:46,850 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-19 22:05:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:05:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-19 22:05:46,851 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-19 22:05:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:05:46,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:05:46,935 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:05:46,938 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:05:47,295 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-19 22:05:47,296 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:05:47,312 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:05:47,313 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 22:05:47,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:05:47 BoogieIcfgContainer [2024-11-19 22:05:47,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:05:47,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:05:47,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:05:47,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:05:47,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:05:46" (1/3) ... [2024-11-19 22:05:47,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e317ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:05:47, skipping insertion in model container [2024-11-19 22:05:47,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:46" (2/3) ... [2024-11-19 22:05:47,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e317ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:05:47, skipping insertion in model container [2024-11-19 22:05:47,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:05:47" (3/3) ... [2024-11-19 22:05:47,325 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product52.cil.c [2024-11-19 22:05:47,344 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:05:47,344 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:05:47,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:05:47,413 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;@41989bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:05:47,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:05:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 82 states have internal predecessors, (101), 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-19 22:05:47,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 22:05:47,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:47,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:05:47,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:47,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:47,430 INFO L85 PathProgramCache]: Analyzing trace with hash -656399671, now seen corresponding path program 1 times [2024-11-19 22:05:47,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:47,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091078542] [2024-11-19 22:05:47,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:47,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:47,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 22:05:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:05:47,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:47,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091078542] [2024-11-19 22:05:47,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091078542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:47,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:47,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 22:05:47,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242202664] [2024-11-19 22:05:47,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:47,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 22:05:47,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:47,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 22:05:47,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 22:05:47,689 INFO L87 Difference]: Start difference. First operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 82 states have internal predecessors, (101), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:05:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:47,721 INFO L93 Difference]: Finished difference Result 183 states and 248 transitions. [2024-11-19 22:05:47,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 22:05:47,723 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-19 22:05:47,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:47,730 INFO L225 Difference]: With dead ends: 183 [2024-11-19 22:05:47,730 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 22:05:47,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 22:05:47,736 INFO L432 NwaCegarLoop]: 121 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, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:47,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:05:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 22:05:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-19 22:05:47,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 74 states have internal predecessors, (87), 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-19 22:05:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2024-11-19 22:05:47,788 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 25 [2024-11-19 22:05:47,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:47,789 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2024-11-19 22:05:47,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:05:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2024-11-19 22:05:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 22:05:47,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:47,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:05:47,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:05:47,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:47,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:47,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1991216904, now seen corresponding path program 1 times [2024-11-19 22:05:47,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:47,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756960793] [2024-11-19 22:05:47,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:47,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:47,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 22:05:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:05:47,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:47,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756960793] [2024-11-19 22:05:47,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756960793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:47,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:47,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:05:47,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400483270] [2024-11-19 22:05:47,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:47,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:05:47,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:47,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:05:47,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:05:47,942 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:05:47,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:47,969 INFO L93 Difference]: Finished difference Result 134 states and 172 transitions. [2024-11-19 22:05:47,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:05:47,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-19 22:05:47,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:47,971 INFO L225 Difference]: With dead ends: 134 [2024-11-19 22:05:47,973 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 22:05:47,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:05:47,975 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:47,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 176 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:05:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 22:05:47,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-19 22:05:47,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 68 states have internal predecessors, (80), 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-19 22:05:47,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2024-11-19 22:05:47,998 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 26 [2024-11-19 22:05:47,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:48,006 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2024-11-19 22:05:48,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:05:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2024-11-19 22:05:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 22:05:48,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:48,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:05:48,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:05:48,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:48,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:48,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1985117727, now seen corresponding path program 1 times [2024-11-19 22:05:48,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:48,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55973931] [2024-11-19 22:05:48,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:48,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-19 22:05:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:05:48,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:48,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55973931] [2024-11-19 22:05:48,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55973931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:48,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:48,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:05:48,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448619606] [2024-11-19 22:05:48,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:48,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:05:48,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:48,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:05:48,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:05:48,143 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:05:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:48,180 INFO L93 Difference]: Finished difference Result 216 states and 283 transitions. [2024-11-19 22:05:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:05:48,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2024-11-19 22:05:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:48,186 INFO L225 Difference]: With dead ends: 216 [2024-11-19 22:05:48,186 INFO L226 Difference]: Without dead ends: 146 [2024-11-19 22:05:48,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:05:48,188 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 92 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:48,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 204 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:05:48,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-19 22:05:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2024-11-19 22:05:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 108 states have (on average 1.3611111111111112) internal successors, (147), 123 states have internal predecessors, (147), 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-19 22:05:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 187 transitions. [2024-11-19 22:05:48,216 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 187 transitions. Word has length 31 [2024-11-19 22:05:48,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:48,216 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 187 transitions. [2024-11-19 22:05:48,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:05:48,217 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 187 transitions. [2024-11-19 22:05:48,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 22:05:48,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:48,218 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] [2024-11-19 22:05:48,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:05:48,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:48,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:48,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1980394589, now seen corresponding path program 1 times [2024-11-19 22:05:48,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:48,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913591619] [2024-11-19 22:05:48,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:48,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 22:05:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:05:48,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:48,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913591619] [2024-11-19 22:05:48,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913591619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:48,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:48,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:05:48,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255936292] [2024-11-19 22:05:48,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:48,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:05:48,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:48,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:05:48,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:05:48,333 INFO L87 Difference]: Start difference. First operand 143 states and 187 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 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-19 22:05:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:48,445 INFO L93 Difference]: Finished difference Result 361 states and 484 transitions. [2024-11-19 22:05:48,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:05:48,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 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 34 [2024-11-19 22:05:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:48,449 INFO L225 Difference]: With dead ends: 361 [2024-11-19 22:05:48,449 INFO L226 Difference]: Without dead ends: 226 [2024-11-19 22:05:48,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:05:48,452 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 69 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 353 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-19 22:05:48,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 353 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:05:48,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-19 22:05:48,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2024-11-19 22:05:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 170 states have (on average 1.3176470588235294) internal successors, (224), 185 states have internal predecessors, (224), 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-19 22:05:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 288 transitions. [2024-11-19 22:05:48,493 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 288 transitions. Word has length 34 [2024-11-19 22:05:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:48,494 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 288 transitions. [2024-11-19 22:05:48,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 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-19 22:05:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 288 transitions. [2024-11-19 22:05:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 22:05:48,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:48,500 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] [2024-11-19 22:05:48,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:05:48,500 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:48,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:48,501 INFO L85 PathProgramCache]: Analyzing trace with hash -316583003, now seen corresponding path program 1 times [2024-11-19 22:05:48,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:48,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817911254] [2024-11-19 22:05:48,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:48,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-19 22:05:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:05:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:05:48,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:48,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817911254] [2024-11-19 22:05:48,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817911254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:48,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:48,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:05:48,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498811275] [2024-11-19 22:05:48,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:48,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:05:48,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:48,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:05:48,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:05:48,650 INFO L87 Difference]: Start difference. First operand 225 states and 288 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 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-19 22:05:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:48,847 INFO L93 Difference]: Finished difference Result 496 states and 643 transitions. [2024-11-19 22:05:48,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:05:48,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 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 45 [2024-11-19 22:05:48,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:48,854 INFO L225 Difference]: With dead ends: 496 [2024-11-19 22:05:48,854 INFO L226 Difference]: Without dead ends: 279 [2024-11-19 22:05:48,855 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-19 22:05:48,856 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 53 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 361 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-19 22:05:48,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 361 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:05:48,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-19 22:05:48,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2024-11-19 22:05:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 212 states have (on average 1.2924528301886793) internal successors, (274), 227 states have internal predecessors, (274), 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-19 22:05:48,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 352 transitions. [2024-11-19 22:05:48,898 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 352 transitions. Word has length 45 [2024-11-19 22:05:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:48,899 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 352 transitions. [2024-11-19 22:05:48,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 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-19 22:05:48,899 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 352 transitions. [2024-11-19 22:05:48,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 22:05:48,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:48,901 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] [2024-11-19 22:05:48,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:05:48,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:48,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:48,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2005526745, now seen corresponding path program 1 times [2024-11-19 22:05:48,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:48,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202879954] [2024-11-19 22:05:48,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:48,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-19 22:05:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:05:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:05:48,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:48,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202879954] [2024-11-19 22:05:48,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202879954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:48,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:48,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:05:48,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561546696] [2024-11-19 22:05:49,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:49,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:05:49,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:49,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:05:49,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:05:49,002 INFO L87 Difference]: Start difference. First operand 277 states and 352 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-19 22:05:49,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:49,139 INFO L93 Difference]: Finished difference Result 552 states and 719 transitions. [2024-11-19 22:05:49,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:05:49,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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 45 [2024-11-19 22:05:49,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:49,142 INFO L225 Difference]: With dead ends: 552 [2024-11-19 22:05:49,144 INFO L226 Difference]: Without dead ends: 283 [2024-11-19 22:05:49,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:05:49,146 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 52 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:49,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 283 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:05:49,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-19 22:05:49,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2024-11-19 22:05:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 216 states have (on average 1.287037037037037) internal successors, (278), 231 states have internal predecessors, (278), 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-19 22:05:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 356 transitions. [2024-11-19 22:05:49,175 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 356 transitions. Word has length 45 [2024-11-19 22:05:49,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:49,175 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 356 transitions. [2024-11-19 22:05:49,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-19 22:05:49,176 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 356 transitions. [2024-11-19 22:05:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 22:05:49,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:49,178 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] [2024-11-19 22:05:49,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:05:49,178 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:49,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:49,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1582824919, now seen corresponding path program 1 times [2024-11-19 22:05:49,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:49,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104316901] [2024-11-19 22:05:49,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:49,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:49,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-19 22:05:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:49,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:05:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:05:49,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:49,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104316901] [2024-11-19 22:05:49,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104316901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:49,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:49,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:05:49,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691042469] [2024-11-19 22:05:49,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:49,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:05:49,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:49,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:05:49,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:05:49,289 INFO L87 Difference]: Start difference. First operand 281 states and 356 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-19 22:05:49,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:49,538 INFO L93 Difference]: Finished difference Result 805 states and 1058 transitions. [2024-11-19 22:05:49,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:05:49,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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 45 [2024-11-19 22:05:49,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:49,543 INFO L225 Difference]: With dead ends: 805 [2024-11-19 22:05:49,543 INFO L226 Difference]: Without dead ends: 532 [2024-11-19 22:05:49,545 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-19 22:05:49,545 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 215 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:49,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 305 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:05:49,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-19 22:05:49,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 525. [2024-11-19 22:05:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 400 states have (on average 1.2525) internal successors, (501), 424 states have internal predecessors, (501), 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-19 22:05:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 665 transitions. [2024-11-19 22:05:49,625 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 665 transitions. Word has length 45 [2024-11-19 22:05:49,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:49,626 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 665 transitions. [2024-11-19 22:05:49,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-19 22:05:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 665 transitions. [2024-11-19 22:05:49,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 22:05:49,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:49,630 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] [2024-11-19 22:05:49,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:05:49,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:49,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:49,631 INFO L85 PathProgramCache]: Analyzing trace with hash 929828559, now seen corresponding path program 1 times [2024-11-19 22:05:49,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:49,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814595270] [2024-11-19 22:05:49,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:49,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:49,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 22:05:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:49,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:05:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:49,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 22:05:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:05:49,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:49,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814595270] [2024-11-19 22:05:49,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814595270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:49,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:49,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:05:49,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383639239] [2024-11-19 22:05:49,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:49,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:05:49,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:49,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:05:49,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:05:49,774 INFO L87 Difference]: Start difference. First operand 525 states and 665 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 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-19 22:05:50,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:50,133 INFO L93 Difference]: Finished difference Result 1096 states and 1483 transitions. [2024-11-19 22:05:50,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 22:05:50,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 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 49 [2024-11-19 22:05:50,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:50,146 INFO L225 Difference]: With dead ends: 1096 [2024-11-19 22:05:50,147 INFO L226 Difference]: Without dead ends: 1094 [2024-11-19 22:05:50,148 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-19 22:05:50,148 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 307 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 224 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-19 22:05:50,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 224 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:05:50,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2024-11-19 22:05:50,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 972. [2024-11-19 22:05:50,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 741 states have (on average 1.263157894736842) internal successors, (936), 796 states have internal predecessors, (936), 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-19 22:05:50,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1325 transitions. [2024-11-19 22:05:50,246 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1325 transitions. Word has length 49 [2024-11-19 22:05:50,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:50,247 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1325 transitions. [2024-11-19 22:05:50,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 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-19 22:05:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1325 transitions. [2024-11-19 22:05:50,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 22:05:50,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:50,250 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] [2024-11-19 22:05:50,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:05:50,251 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:50,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:50,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1745032408, now seen corresponding path program 1 times [2024-11-19 22:05:50,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:50,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565320893] [2024-11-19 22:05:50,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:50,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 22:05:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 22:05:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:05:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:05:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 22:05:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 22:05:50,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:50,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565320893] [2024-11-19 22:05:50,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565320893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:50,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:50,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:05:50,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327841274] [2024-11-19 22:05:50,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:50,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:05:50,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:50,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:05:50,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:05:50,354 INFO L87 Difference]: Start difference. First operand 972 states and 1325 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 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-19 22:05:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:50,727 INFO L93 Difference]: Finished difference Result 1592 states and 2158 transitions. [2024-11-19 22:05:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 22:05:50,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 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 79 [2024-11-19 22:05:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:50,732 INFO L225 Difference]: With dead ends: 1592 [2024-11-19 22:05:50,732 INFO L226 Difference]: Without dead ends: 628 [2024-11-19 22:05:50,735 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-19 22:05:50,737 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 231 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 360 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:50,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 360 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:05:50,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-19 22:05:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 584. [2024-11-19 22:05:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 449 states have (on average 1.247216035634744) internal successors, (560), 480 states have internal predecessors, (560), 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-19 22:05:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 769 transitions. [2024-11-19 22:05:50,783 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 769 transitions. Word has length 79 [2024-11-19 22:05:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:50,783 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 769 transitions. [2024-11-19 22:05:50,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 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-19 22:05:50,784 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 769 transitions. [2024-11-19 22:05:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-19 22:05:50,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:50,787 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] [2024-11-19 22:05:50,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:05:50,788 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:50,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:50,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1198485224, now seen corresponding path program 1 times [2024-11-19 22:05:50,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:50,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750678076] [2024-11-19 22:05:50,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:50,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 22:05:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-19 22:05:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:05:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:05:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:05:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 22:05:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 22:05:50,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:50,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750678076] [2024-11-19 22:05:50,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750678076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:05:50,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508420226] [2024-11-19 22:05:50,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:50,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:05:50,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:05:50,930 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-19 22:05:50,932 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-19 22:05:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:51,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 22:05:51,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:05:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:05:51,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:05:51,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508420226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:51,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:05:51,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2024-11-19 22:05:51,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446119257] [2024-11-19 22:05:51,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:51,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:05:51,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:51,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:05:51,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:05:51,122 INFO L87 Difference]: Start difference. First operand 584 states and 769 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-19 22:05:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:51,196 INFO L93 Difference]: Finished difference Result 993 states and 1335 transitions. [2024-11-19 22:05:51,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:05:51,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 88 [2024-11-19 22:05:51,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:51,200 INFO L225 Difference]: With dead ends: 993 [2024-11-19 22:05:51,200 INFO L226 Difference]: Without dead ends: 501 [2024-11-19 22:05:51,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 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-19 22:05:51,203 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 42 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 209 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-19 22:05:51,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 209 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:05:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-19 22:05:51,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2024-11-19 22:05:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 385 states have (on average 1.225974025974026) internal successors, (472), 412 states have internal predecessors, (472), 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-19 22:05:51,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 616 transitions. [2024-11-19 22:05:51,244 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 616 transitions. Word has length 88 [2024-11-19 22:05:51,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:51,245 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 616 transitions. [2024-11-19 22:05:51,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-19 22:05:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 616 transitions. [2024-11-19 22:05:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 22:05:51,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:51,249 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] [2024-11-19 22:05:51,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 22:05:51,450 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-19 22:05:51,450 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:51,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:51,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1221172747, now seen corresponding path program 1 times [2024-11-19 22:05:51,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:51,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171881487] [2024-11-19 22:05:51,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:51,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:51,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 22:05:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:51,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-19 22:05:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:51,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:05:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:51,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:05:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:51,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 22:05:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:51,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:05:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:51,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 22:05:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 22:05:51,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:51,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171881487] [2024-11-19 22:05:51,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171881487] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:05:51,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322621255] [2024-11-19 22:05:51,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:51,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:05:51,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:05:51,637 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-19 22:05:51,638 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-19 22:05:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:51,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 22:05:51,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:05:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 22:05:51,783 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:05:51,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322621255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:51,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:05:51,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-19 22:05:51,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545906579] [2024-11-19 22:05:51,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:51,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:05:51,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:51,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:05:51,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:05:51,785 INFO L87 Difference]: Start difference. First operand 501 states and 616 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 22:05:51,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:51,832 INFO L93 Difference]: Finished difference Result 922 states and 1156 transitions. [2024-11-19 22:05:51,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:05:51,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2024-11-19 22:05:51,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:51,836 INFO L225 Difference]: With dead ends: 922 [2024-11-19 22:05:51,837 INFO L226 Difference]: Without dead ends: 513 [2024-11-19 22:05:51,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 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-19 22:05:51,839 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:51,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 381 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:05:51,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-19 22:05:51,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 507. [2024-11-19 22:05:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 391 states have (on average 1.2225063938618925) internal successors, (478), 418 states have internal predecessors, (478), 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-19 22:05:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 622 transitions. [2024-11-19 22:05:51,889 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 622 transitions. Word has length 91 [2024-11-19 22:05:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:51,890 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 622 transitions. [2024-11-19 22:05:51,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 22:05:51,890 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 622 transitions. [2024-11-19 22:05:51,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 22:05:51,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:51,892 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] [2024-11-19 22:05:51,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 22:05:52,095 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-19 22:05:52,096 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:52,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:52,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1355186253, now seen corresponding path program 1 times [2024-11-19 22:05:52,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:52,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303810508] [2024-11-19 22:05:52,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:52,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:52,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 22:05:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:52,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-19 22:05:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:52,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:05:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:52,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:05:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:52,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 22:05:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:52,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:05:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:52,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 22:05:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 22:05:52,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:52,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303810508] [2024-11-19 22:05:52,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303810508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:05:52,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726666176] [2024-11-19 22:05:52,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:52,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:05:52,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:05:52,277 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-19 22:05:52,279 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-19 22:05:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:52,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 22:05:52,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:05:52,533 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 22:05:52,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:05:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 22:05:52,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726666176] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 22:05:52,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 22:05:52,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 5] total 14 [2024-11-19 22:05:52,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465198026] [2024-11-19 22:05:52,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:52,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:05:52,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:52,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:05:52,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-19 22:05:52,665 INFO L87 Difference]: Start difference. First operand 507 states and 622 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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-19 22:05:52,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:52,821 INFO L93 Difference]: Finished difference Result 1439 states and 1810 transitions. [2024-11-19 22:05:52,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:05:52,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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 91 [2024-11-19 22:05:52,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:52,828 INFO L225 Difference]: With dead ends: 1439 [2024-11-19 22:05:52,828 INFO L226 Difference]: Without dead ends: 940 [2024-11-19 22:05:52,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 187 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-19 22:05:52,831 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 57 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 448 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:52,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 448 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:05:52,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2024-11-19 22:05:52,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 888. [2024-11-19 22:05:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 676 states have (on average 1.1923076923076923) internal successors, (806), 726 states have internal predecessors, (806), 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-19 22:05:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1069 transitions. [2024-11-19 22:05:52,913 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1069 transitions. Word has length 91 [2024-11-19 22:05:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:52,914 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1069 transitions. [2024-11-19 22:05:52,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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-19 22:05:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1069 transitions. [2024-11-19 22:05:52,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:05:52,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:52,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:05:52,925 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-19 22:05:53,120 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-19 22:05:53,121 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:53,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:53,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1873795953, now seen corresponding path program 1 times [2024-11-19 22:05:53,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:53,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564312054] [2024-11-19 22:05:53,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:53,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:53,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 22:05:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:53,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 22:05:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:53,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:05:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:53,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:05:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:53,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:05:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:53,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 22:05:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:53,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:05:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:53,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-19 22:05:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 22:05:53,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:53,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564312054] [2024-11-19 22:05:53,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564312054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:05:53,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779453515] [2024-11-19 22:05:53,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:53,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:05:53,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:05:53,286 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-19 22:05:53,290 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-19 22:05:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:53,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 22:05:53,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:05:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:05:53,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:05:53,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779453515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:53,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:05:53,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2024-11-19 22:05:53,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646066190] [2024-11-19 22:05:53,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:53,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:05:53,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:53,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:05:53,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:05:53,449 INFO L87 Difference]: Start difference. First operand 888 states and 1069 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-19 22:05:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:53,588 INFO L93 Difference]: Finished difference Result 1478 states and 1798 transitions. [2024-11-19 22:05:53,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:05:53,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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 95 [2024-11-19 22:05:53,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:53,590 INFO L225 Difference]: With dead ends: 1478 [2024-11-19 22:05:53,590 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 22:05:53,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:05:53,594 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 108 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:53,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 470 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:05:53,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 22:05:53,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 22:05:53,595 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-19 22:05:53,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 22:05:53,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2024-11-19 22:05:53,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:53,596 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 22:05:53,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-19 22:05:53,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 22:05:53,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 22:05:53,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 22:05:53,608 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-19 22:05:53,803 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-19 22:05:53,805 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:05:53,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 22:05:57,427 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 22:05:57,444 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) (and (= 1 ~systemActive~0) (<= 1 ~waterLevel~0) .cse0))) (not (= 0 ~systemActive~0))) Eliminated clause: (and (let ((.cse0 (<= 1 ~pumpRunning~0))) (or (and .cse0 (<= 2 ~waterLevel~0)) (and .cse0 (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)))) (not (= 0 ~systemActive~0))) [2024-11-19 22:05:57,459 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-19 22:05:57,464 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-19 22:05:57,469 INFO L158 Benchmark]: Toolchain (without parser) took 11327.30ms. Allocated memory was 125.8MB in the beginning and 302.0MB in the end (delta: 176.2MB). Free memory was 71.1MB in the beginning and 190.8MB in the end (delta: -119.8MB). Peak memory consumption was 129.9MB. Max. memory is 16.1GB. [2024-11-19 22:05:57,470 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 125.8MB. Free memory was 96.4MB in the beginning and 96.4MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:05:57,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.22ms. Allocated memory was 125.8MB in the beginning and 174.1MB in the end (delta: 48.2MB). Free memory was 70.7MB in the beginning and 140.4MB in the end (delta: -69.7MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-11-19 22:05:57,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.52ms. Allocated memory is still 174.1MB. Free memory was 140.4MB in the beginning and 137.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:05:57,471 INFO L158 Benchmark]: Boogie Preprocessor took 46.03ms. Allocated memory is still 174.1MB. Free memory was 137.4MB in the beginning and 135.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:05:57,471 INFO L158 Benchmark]: RCFGBuilder took 566.23ms. Allocated memory is still 174.1MB. Free memory was 135.3MB in the beginning and 116.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 22:05:57,471 INFO L158 Benchmark]: TraceAbstraction took 10152.85ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 116.1MB in the beginning and 190.8MB in the end (delta: -74.7MB). Peak memory consumption was 124.9MB. Max. memory is 16.1GB. [2024-11-19 22:05:57,473 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.19ms. Allocated memory is still 125.8MB. Free memory was 96.4MB in the beginning and 96.4MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.22ms. Allocated memory was 125.8MB in the beginning and 174.1MB in the end (delta: 48.2MB). Free memory was 70.7MB in the beginning and 140.4MB in the end (delta: -69.7MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.52ms. Allocated memory is still 174.1MB. Free memory was 140.4MB in the beginning and 137.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.03ms. Allocated memory is still 174.1MB. Free memory was 137.4MB in the beginning and 135.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 566.23ms. Allocated memory is still 174.1MB. Free memory was 135.3MB in the beginning and 116.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10152.85ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 116.1MB in the beginning and 190.8MB in the end (delta: -74.7MB). Peak memory consumption was 124.9MB. 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, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1272 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1243 mSDsluCounter, 3895 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2514 mSDsCounter, 266 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 872 IncrementalHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 266 mSolverCounterUnsat, 1381 mSDtfsCounter, 872 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 642 GetRequests, 555 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=972occurred in iteration=8, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 239 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1109 NumberOfCodeBlocks, 1109 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1182 ConstructedInterpolants, 0 QuantifiedInterpolants, 2089 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1249 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 274/290 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: 366]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: ((((((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (splverifierCounter == 0)) && (1 <= waterLevel)) && (0 == systemActive))) - InvariantResult [Line: 65]: Location Invariant Derived location invariant: 0 - ProcedureContractResult [Line: 229]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: ((((1 <= pumpRunning) && (2 <= waterLevel)) || (((1 <= pumpRunning) && (1 == systemActive)) && (1 <= waterLevel))) && (0 != systemActive)) Ensures: ((((pumpRunning == 0) && (((2 <= waterLevel) && (1 <= \old(pumpRunning))) || (((1 == systemActive) && (1 <= waterLevel)) && (1 <= \old(pumpRunning))))) && (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: (((((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-19 22:05:57,493 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_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-wip.dd.update-z3-fca748b-m [2024-11-19 22:05:59,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:05:59,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 22:05:59,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:05:59,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:05:59,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:05:59,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:05:59,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:05:59,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:05:59,861 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:05:59,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:05:59,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:05:59,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:05:59,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:05:59,865 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:05:59,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:05:59,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:05:59,866 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:05:59,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:05:59,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:05:59,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:05:59,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:05:59,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:05:59,872 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 22:05:59,872 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 22:05:59,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:05:59,872 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 22:05:59,872 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:05:59,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:05:59,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:05:59,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:05:59,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:05:59,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:05:59,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:05:59,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:05:59,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:05:59,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:05:59,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:05:59,875 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 22:05:59,875 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 22:05:59,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:05:59,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:05:59,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:05:59,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:05:59,878 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-19 22:06:00,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:06:00,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:06:00,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:06:00,203 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:06:00,203 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:06:00,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c [2024-11-19 22:06:01,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:06:02,066 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:06:02,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c [2024-11-19 22:06:02,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ac5617d/af44ee2f7e444a7e9a4c9eeae7a43541/FLAG322e3f68d [2024-11-19 22:06:02,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6ac5617d/af44ee2f7e444a7e9a4c9eeae7a43541 [2024-11-19 22:06:02,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:06:02,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:06:02,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:06:02,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:06:02,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:06:02,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:06:02" (1/1) ... [2024-11-19 22:06:02,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@116d731d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:02, skipping insertion in model container [2024-11-19 22:06:02,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:06:02" (1/1) ... [2024-11-19 22:06:02,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:06:02,744 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:06:02,748 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:06:02,755 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:06:02,760 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:06:02,769 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:06:02,784 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:06:02,789 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:06:02,791 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:06:02,795 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:06:02,814 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-19 22:06:02,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:06:02,832 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:06:02,841 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2024-11-19 22:06:02,842 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [124] [2024-11-19 22:06:02,843 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [354] [2024-11-19 22:06:02,843 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [455] [2024-11-19 22:06:02,843 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [495] [2024-11-19 22:06:02,843 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [530] [2024-11-19 22:06:02,843 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [634] [2024-11-19 22:06:02,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1000] [2024-11-19 22:06:02,916 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-19 22:06:02,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:06:02,945 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:06:02,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:02 WrapperNode [2024-11-19 22:06:02,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:06:02,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:06:02,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:06:02,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:06:02,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:02" (1/1) ... [2024-11-19 22:06:02,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:02" (1/1) ... [2024-11-19 22:06:03,006 INFO L138 Inliner]: procedures = 60, calls = 102, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 201 [2024-11-19 22:06:03,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:06:03,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:06:03,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:06:03,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:06:03,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:02" (1/1) ... [2024-11-19 22:06:03,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:02" (1/1) ... [2024-11-19 22:06:03,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:02" (1/1) ... [2024-11-19 22:06:03,037 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 22:06:03,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:02" (1/1) ... [2024-11-19 22:06:03,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:02" (1/1) ... [2024-11-19 22:06:03,047 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:02" (1/1) ... [2024-11-19 22:06:03,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:02" (1/1) ... [2024-11-19 22:06:03,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:02" (1/1) ... [2024-11-19 22:06:03,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:02" (1/1) ... [2024-11-19 22:06:03,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:06:03,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:06:03,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:06:03,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:06:03,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:02" (1/1) ... [2024-11-19 22:06:03,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:06:03,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:06:03,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 22:06:03,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 22:06:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:06:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-19 22:06:03,142 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-19 22:06:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-19 22:06:03,142 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-19 22:06:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-19 22:06:03,143 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-19 22:06:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-19 22:06:03,143 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-19 22:06:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-19 22:06:03,143 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-19 22:06:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-19 22:06:03,143 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-19 22:06:03,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 22:06:03,144 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-19 22:06:03,144 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-19 22:06:03,144 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-19 22:06:03,144 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-19 22:06:03,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:06:03,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:06:03,220 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:06:03,222 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:06:03,545 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-19 22:06:03,545 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:06:03,562 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:06:03,563 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 22:06:03,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:06:03 BoogieIcfgContainer [2024-11-19 22:06:03,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:06:03,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:06:03,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:06:03,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:06:03,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:06:02" (1/3) ... [2024-11-19 22:06:03,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62411f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:06:03, skipping insertion in model container [2024-11-19 22:06:03,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:06:02" (2/3) ... [2024-11-19 22:06:03,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62411f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:06:03, skipping insertion in model container [2024-11-19 22:06:03,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:06:03" (3/3) ... [2024-11-19 22:06:03,574 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product52.cil.c [2024-11-19 22:06:03,591 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:06:03,591 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:06:03,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:06:03,678 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;@704d441b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:06:03,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:06:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 82 states have internal predecessors, (101), 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-19 22:06:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 22:06:03,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:03,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:06:03,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:03,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash -656399671, now seen corresponding path program 1 times [2024-11-19 22:06:03,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:03,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293218859] [2024-11-19 22:06:03,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:03,716 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-19 22:06:03,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:03,720 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-19 22:06:03,721 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-19 22:06:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:03,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 22:06:03,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:03,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:03,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:03,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293218859] [2024-11-19 22:06:03,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293218859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:03,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:03,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 22:06:03,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77877820] [2024-11-19 22:06:03,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:03,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 22:06:03,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:03,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 22:06:03,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 22:06:03,884 INFO L87 Difference]: Start difference. First operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 82 states have internal predecessors, (101), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-19 22:06:03,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:03,914 INFO L93 Difference]: Finished difference Result 183 states and 248 transitions. [2024-11-19 22:06:03,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 22:06:03,916 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 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 25 [2024-11-19 22:06:03,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:03,923 INFO L225 Difference]: With dead ends: 183 [2024-11-19 22:06:03,923 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 22:06:03,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 22:06:03,931 INFO L432 NwaCegarLoop]: 121 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, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:03,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:03,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 22:06:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-19 22:06:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 74 states have internal predecessors, (87), 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-19 22:06:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2024-11-19 22:06:03,973 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 25 [2024-11-19 22:06:03,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:03,974 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2024-11-19 22:06:03,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 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-19 22:06:03,975 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2024-11-19 22:06:03,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 22:06:03,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:03,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:06:03,982 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 (2)] Forceful destruction successful, exit code 0 [2024-11-19 22:06:04,180 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-19 22:06:04,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:04,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:04,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1991216904, now seen corresponding path program 1 times [2024-11-19 22:06:04,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:04,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476425396] [2024-11-19 22:06:04,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:04,183 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-19 22:06:04,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:04,185 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-19 22:06:04,186 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-19 22:06:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:04,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 22:06:04,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:04,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:04,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:04,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476425396] [2024-11-19 22:06:04,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476425396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:04,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:04,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:06:04,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484553564] [2024-11-19 22:06:04,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:04,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:06:04,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:04,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:06:04,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:04,316 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 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-19 22:06:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:04,337 INFO L93 Difference]: Finished difference Result 134 states and 172 transitions. [2024-11-19 22:06:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:06:04,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 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 26 [2024-11-19 22:06:04,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:04,340 INFO L225 Difference]: With dead ends: 134 [2024-11-19 22:06:04,340 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 22:06:04,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:04,342 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:04,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 176 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 22:06:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-19 22:06:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 68 states have internal predecessors, (80), 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-19 22:06:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2024-11-19 22:06:04,355 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 26 [2024-11-19 22:06:04,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:04,356 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2024-11-19 22:06:04,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 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-19 22:06:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2024-11-19 22:06:04,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 22:06:04,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:04,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:06:04,361 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 (3)] Ended with exit code 0 [2024-11-19 22:06:04,560 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-19 22:06:04,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:04,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:04,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1985117727, now seen corresponding path program 1 times [2024-11-19 22:06:04,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:04,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543457278] [2024-11-19 22:06:04,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:04,564 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-19 22:06:04,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:04,566 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-19 22:06:04,567 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-19 22:06:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:04,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 22:06:04,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:04,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:04,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:04,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543457278] [2024-11-19 22:06:04,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543457278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:04,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:04,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:06:04,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388732643] [2024-11-19 22:06:04,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:04,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:06:04,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:04,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:06:04,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:04,662 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:06:04,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:04,698 INFO L93 Difference]: Finished difference Result 216 states and 283 transitions. [2024-11-19 22:06:04,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:06:04,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2024-11-19 22:06:04,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:04,701 INFO L225 Difference]: With dead ends: 216 [2024-11-19 22:06:04,701 INFO L226 Difference]: Without dead ends: 146 [2024-11-19 22:06:04,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:04,703 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 92 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:04,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 204 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:04,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-19 22:06:04,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2024-11-19 22:06:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 108 states have (on average 1.3611111111111112) internal successors, (147), 123 states have internal predecessors, (147), 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-19 22:06:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 187 transitions. [2024-11-19 22:06:04,748 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 187 transitions. Word has length 31 [2024-11-19 22:06:04,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:04,748 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 187 transitions. [2024-11-19 22:06:04,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:06:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 187 transitions. [2024-11-19 22:06:04,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 22:06:04,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:04,750 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] [2024-11-19 22:06:04,755 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 (4)] Forceful destruction successful, exit code 0 [2024-11-19 22:06:04,955 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-19 22:06:04,955 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:04,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1980394589, now seen corresponding path program 1 times [2024-11-19 22:06:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:04,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361563632] [2024-11-19 22:06:04,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:04,957 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-19 22:06:04,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:04,960 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-19 22:06:04,961 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-19 22:06:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:05,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 22:06:05,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:05,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:05,163 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:05,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:05,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361563632] [2024-11-19 22:06:05,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361563632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:05,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:05,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:06:05,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136924921] [2024-11-19 22:06:05,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:05,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:06:05,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:05,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:06:05,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:06:05,167 INFO L87 Difference]: Start difference. First operand 143 states and 187 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 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-19 22:06:05,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:05,330 INFO L93 Difference]: Finished difference Result 405 states and 540 transitions. [2024-11-19 22:06:05,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:06:05,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 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 34 [2024-11-19 22:06:05,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:05,334 INFO L225 Difference]: With dead ends: 405 [2024-11-19 22:06:05,338 INFO L226 Difference]: Without dead ends: 270 [2024-11-19 22:06:05,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:06:05,340 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 63 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 454 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-19 22:06:05,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 454 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:06:05,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-19 22:06:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2024-11-19 22:06:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 201 states have (on average 1.3482587064676617) internal successors, (271), 230 states have internal predecessors, (271), 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-19 22:06:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 353 transitions. [2024-11-19 22:06:05,408 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 353 transitions. Word has length 34 [2024-11-19 22:06:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:05,409 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 353 transitions. [2024-11-19 22:06:05,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 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-19 22:06:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 353 transitions. [2024-11-19 22:06:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 22:06:05,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:05,415 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] [2024-11-19 22:06:05,418 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 (5)] Forceful destruction successful, exit code 0 [2024-11-19 22:06:05,616 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-19 22:06:05,616 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:05,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:05,617 INFO L85 PathProgramCache]: Analyzing trace with hash -973115463, now seen corresponding path program 1 times [2024-11-19 22:06:05,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:05,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926255102] [2024-11-19 22:06:05,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:05,617 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-19 22:06:05,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:05,620 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-19 22:06:05,621 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-19 22:06:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:05,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 22:06:05,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:05,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:05,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:05,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926255102] [2024-11-19 22:06:05,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926255102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:05,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:05,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:06:05,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508652697] [2024-11-19 22:06:05,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:05,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:06:05,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:05,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:06:05,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:06:05,774 INFO L87 Difference]: Start difference. First operand 270 states and 353 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:06:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:05,882 INFO L93 Difference]: Finished difference Result 694 states and 926 transitions. [2024-11-19 22:06:05,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:06:05,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-11-19 22:06:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:05,892 INFO L225 Difference]: With dead ends: 694 [2024-11-19 22:06:05,893 INFO L226 Difference]: Without dead ends: 432 [2024-11-19 22:06:05,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:06:05,895 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 42 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 353 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-19 22:06:05,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 353 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:05,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-19 22:06:05,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 430. [2024-11-19 22:06:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 321 states have (on average 1.2990654205607477) internal successors, (417), 350 states have internal predecessors, (417), 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-19 22:06:05,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 549 transitions. [2024-11-19 22:06:05,946 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 549 transitions. Word has length 38 [2024-11-19 22:06:05,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:05,947 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 549 transitions. [2024-11-19 22:06:05,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:06:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 549 transitions. [2024-11-19 22:06:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 22:06:05,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:05,953 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] [2024-11-19 22:06:05,956 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 (6)] Ended with exit code 0 [2024-11-19 22:06:06,153 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-19 22:06:06,154 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:06,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:06,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1523834569, now seen corresponding path program 1 times [2024-11-19 22:06:06,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:06,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442764430] [2024-11-19 22:06:06,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:06,155 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-19 22:06:06,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:06,157 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-19 22:06:06,158 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-19 22:06:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:06,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 22:06:06,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:06,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:06,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:06,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442764430] [2024-11-19 22:06:06,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442764430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:06,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:06,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:06:06,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396458123] [2024-11-19 22:06:06,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:06,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:06:06,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:06,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:06:06,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:06:06,240 INFO L87 Difference]: Start difference. First operand 430 states and 549 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-19 22:06:06,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:06,294 INFO L93 Difference]: Finished difference Result 864 states and 1122 transitions. [2024-11-19 22:06:06,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:06:06,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 49 [2024-11-19 22:06:06,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:06,297 INFO L225 Difference]: With dead ends: 864 [2024-11-19 22:06:06,298 INFO L226 Difference]: Without dead ends: 442 [2024-11-19 22:06:06,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-19 22:06:06,300 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 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-19 22:06:06,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:06,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-19 22:06:06,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2024-11-19 22:06:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 333 states have (on average 1.2882882882882882) internal successors, (429), 362 states have internal predecessors, (429), 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-19 22:06:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 561 transitions. [2024-11-19 22:06:06,353 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 561 transitions. Word has length 49 [2024-11-19 22:06:06,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:06,354 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 561 transitions. [2024-11-19 22:06:06,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-19 22:06:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 561 transitions. [2024-11-19 22:06:06,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 22:06:06,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:06,357 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] [2024-11-19 22:06:06,361 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 (7)] Ended with exit code 0 [2024-11-19 22:06:06,558 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-19 22:06:06,559 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:06,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:06,559 INFO L85 PathProgramCache]: Analyzing trace with hash -165109173, now seen corresponding path program 1 times [2024-11-19 22:06:06,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:06,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299337369] [2024-11-19 22:06:06,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:06,560 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-19 22:06:06,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:06,561 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-19 22:06:06,562 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-19 22:06:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:06,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 22:06:06,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:06,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:06,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:06,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299337369] [2024-11-19 22:06:06,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299337369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:06,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:06,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:06:06,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40730295] [2024-11-19 22:06:06,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:06,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:06:06,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:06,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:06:06,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:06:06,654 INFO L87 Difference]: Start difference. First operand 442 states and 561 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-19 22:06:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:06,714 INFO L93 Difference]: Finished difference Result 884 states and 1158 transitions. [2024-11-19 22:06:06,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 22:06:06,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 49 [2024-11-19 22:06:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:06,721 INFO L225 Difference]: With dead ends: 884 [2024-11-19 22:06:06,722 INFO L226 Difference]: Without dead ends: 450 [2024-11-19 22:06:06,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 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-19 22:06:06,727 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 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-19 22:06:06,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-19 22:06:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2024-11-19 22:06:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 341 states have (on average 1.281524926686217) internal successors, (437), 370 states have internal predecessors, (437), 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-19 22:06:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 569 transitions. [2024-11-19 22:06:06,766 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 569 transitions. Word has length 49 [2024-11-19 22:06:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:06,768 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 569 transitions. [2024-11-19 22:06:06,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-19 22:06:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 569 transitions. [2024-11-19 22:06:06,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 22:06:06,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:06,770 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] [2024-11-19 22:06:06,774 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-19 22:06:06,970 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-19 22:06:06,971 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:06,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:06,971 INFO L85 PathProgramCache]: Analyzing trace with hash 257592653, now seen corresponding path program 1 times [2024-11-19 22:06:06,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:06,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573974169] [2024-11-19 22:06:06,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:06,972 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-19 22:06:06,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:06,973 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-19 22:06:06,974 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-19 22:06:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:07,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 22:06:07,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:07,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:07,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573974169] [2024-11-19 22:06:07,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573974169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:07,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:07,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 22:06:07,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354657865] [2024-11-19 22:06:07,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:07,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:06:07,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:07,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:06:07,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:07,089 INFO L87 Difference]: Start difference. First operand 450 states and 569 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 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-19 22:06:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:07,148 INFO L93 Difference]: Finished difference Result 1080 states and 1374 transitions. [2024-11-19 22:06:07,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:06:07,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 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 49 [2024-11-19 22:06:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:07,152 INFO L225 Difference]: With dead ends: 1080 [2024-11-19 22:06:07,153 INFO L226 Difference]: Without dead ends: 638 [2024-11-19 22:06:07,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:07,155 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 36 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 183 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-19 22:06:07,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 183 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-19 22:06:07,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2024-11-19 22:06:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 485 states have (on average 1.243298969072165) internal successors, (603), 518 states have internal predecessors, (603), 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-19 22:06:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 785 transitions. [2024-11-19 22:06:07,209 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 785 transitions. Word has length 49 [2024-11-19 22:06:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:07,210 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 785 transitions. [2024-11-19 22:06:07,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 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-19 22:06:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 785 transitions. [2024-11-19 22:06:07,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 22:06:07,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:07,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:06:07,215 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-19 22:06:07,414 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-19 22:06:07,415 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:07,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:07,416 INFO L85 PathProgramCache]: Analyzing trace with hash -715401485, now seen corresponding path program 1 times [2024-11-19 22:06:07,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:07,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624993938] [2024-11-19 22:06:07,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:07,417 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-19 22:06:07,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:07,423 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-19 22:06:07,424 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-19 22:06:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:07,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 22:06:07,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:07,565 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:07,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:07,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624993938] [2024-11-19 22:06:07,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624993938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:07,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:07,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:06:07,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425986526] [2024-11-19 22:06:07,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:07,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:06:07,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:07,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:06:07,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:07,568 INFO L87 Difference]: Start difference. First operand 638 states and 785 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-19 22:06:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:07,642 INFO L93 Difference]: Finished difference Result 962 states and 1205 transitions. [2024-11-19 22:06:07,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:06:07,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 53 [2024-11-19 22:06:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:07,650 INFO L225 Difference]: With dead ends: 962 [2024-11-19 22:06:07,650 INFO L226 Difference]: Without dead ends: 960 [2024-11-19 22:06:07,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:07,651 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 50 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 187 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-19 22:06:07,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 187 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-19 22:06:07,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 803. [2024-11-19 22:06:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 609 states have (on average 1.2561576354679802) internal successors, (765), 656 states have internal predecessors, (765), 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-19 22:06:07,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1005 transitions. [2024-11-19 22:06:07,713 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1005 transitions. Word has length 53 [2024-11-19 22:06:07,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:07,713 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1005 transitions. [2024-11-19 22:06:07,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-19 22:06:07,714 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1005 transitions. [2024-11-19 22:06:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 22:06:07,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:07,729 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 22:06:07,734 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 (10)] Forceful destruction successful, exit code 0 [2024-11-19 22:06:07,930 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-19 22:06:07,930 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:07,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:07,931 INFO L85 PathProgramCache]: Analyzing trace with hash 115410428, now seen corresponding path program 1 times [2024-11-19 22:06:07,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:07,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787148287] [2024-11-19 22:06:07,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:07,931 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-19 22:06:07,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:07,936 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-19 22:06:07,937 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-19 22:06:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:08,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 22:06:08,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:08,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:08,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:08,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787148287] [2024-11-19 22:06:08,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787148287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:08,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:08,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:06:08,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386939551] [2024-11-19 22:06:08,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:08,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:06:08,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:08,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:06:08,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:08,090 INFO L87 Difference]: Start difference. First operand 803 states and 1005 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-19 22:06:08,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:08,178 INFO L93 Difference]: Finished difference Result 1727 states and 2182 transitions. [2024-11-19 22:06:08,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:06:08,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 83 [2024-11-19 22:06:08,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:08,183 INFO L225 Difference]: With dead ends: 1727 [2024-11-19 22:06:08,184 INFO L226 Difference]: Without dead ends: 932 [2024-11-19 22:06:08,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:08,186 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 54 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 153 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-19 22:06:08,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 153 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:08,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-11-19 22:06:08,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 924. [2024-11-19 22:06:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 700 states have (on average 1.25) internal successors, (875), 753 states have internal predecessors, (875), 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-19 22:06:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1157 transitions. [2024-11-19 22:06:08,272 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1157 transitions. Word has length 83 [2024-11-19 22:06:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:08,273 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1157 transitions. [2024-11-19 22:06:08,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-19 22:06:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1157 transitions. [2024-11-19 22:06:08,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 22:06:08,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:08,278 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] [2024-11-19 22:06:08,281 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-19 22:06:08,478 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-19 22:06:08,478 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:08,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:08,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1895528892, now seen corresponding path program 1 times [2024-11-19 22:06:08,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:08,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677648845] [2024-11-19 22:06:08,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:08,479 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-19 22:06:08,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:08,482 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-19 22:06:08,483 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-19 22:06:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:08,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 22:06:08,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:08,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:08,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:08,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677648845] [2024-11-19 22:06:08,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677648845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:08,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:08,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:06:08,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467519032] [2024-11-19 22:06:08,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:08,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:06:08,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:08,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:06:08,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:08,597 INFO L87 Difference]: Start difference. First operand 924 states and 1157 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-19 22:06:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:08,694 INFO L93 Difference]: Finished difference Result 1571 states and 2012 transitions. [2024-11-19 22:06:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:06:08,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 92 [2024-11-19 22:06:08,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:08,700 INFO L225 Difference]: With dead ends: 1571 [2024-11-19 22:06:08,700 INFO L226 Difference]: Without dead ends: 901 [2024-11-19 22:06:08,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:08,703 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 42 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 208 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-19 22:06:08,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 208 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:08,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2024-11-19 22:06:08,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2024-11-19 22:06:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 681 states have (on average 1.2173274596182084) internal successors, (829), 731 states have internal predecessors, (829), 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-19 22:06:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1100 transitions. [2024-11-19 22:06:08,789 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1100 transitions. Word has length 92 [2024-11-19 22:06:08,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:08,790 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1100 transitions. [2024-11-19 22:06:08,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-19 22:06:08,790 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1100 transitions. [2024-11-19 22:06:08,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:06:08,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:08,795 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:06:08,800 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 (12)] Ended with exit code 0 [2024-11-19 22:06:08,996 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-19 22:06:08,996 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:08,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:08,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1739782447, now seen corresponding path program 1 times [2024-11-19 22:06:08,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:08,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437976948] [2024-11-19 22:06:08,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:08,997 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-19 22:06:08,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:08,998 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-19 22:06:08,999 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-19 22:06:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:09,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 22:06:09,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 22:06:09,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:09,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:09,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437976948] [2024-11-19 22:06:09,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437976948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:09,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:09,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:06:09,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855725580] [2024-11-19 22:06:09,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:09,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:06:09,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:09,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:06:09,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:06:09,093 INFO L87 Difference]: Start difference. First operand 901 states and 1100 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-19 22:06:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:09,177 INFO L93 Difference]: Finished difference Result 1566 states and 1937 transitions. [2024-11-19 22:06:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:06:09,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 95 [2024-11-19 22:06:09,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:09,182 INFO L225 Difference]: With dead ends: 1566 [2024-11-19 22:06:09,182 INFO L226 Difference]: Without dead ends: 919 [2024-11-19 22:06:09,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 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-19 22:06:09,184 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:09,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 381 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-19 22:06:09,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 919. [2024-11-19 22:06:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 699 states have (on average 1.21173104434907) internal successors, (847), 749 states have internal predecessors, (847), 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-19 22:06:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1118 transitions. [2024-11-19 22:06:09,244 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1118 transitions. Word has length 95 [2024-11-19 22:06:09,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:09,245 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1118 transitions. [2024-11-19 22:06:09,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-19 22:06:09,245 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1118 transitions. [2024-11-19 22:06:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:06:09,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:09,248 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:06:09,252 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-19 22:06:09,451 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-19 22:06:09,451 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:09,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:09,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1873795953, now seen corresponding path program 1 times [2024-11-19 22:06:09,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:09,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482207091] [2024-11-19 22:06:09,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:09,454 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-19 22:06:09,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:09,457 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-19 22:06:09,464 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-19 22:06:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:09,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 22:06:09,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 22:06:09,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:06:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 22:06:09,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:09,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482207091] [2024-11-19 22:06:09,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482207091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:06:09,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 22:06:09,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-11-19 22:06:09,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808364629] [2024-11-19 22:06:09,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 22:06:09,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 22:06:09,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:09,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 22:06:09,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:06:09,955 INFO L87 Difference]: Start difference. First operand 919 states and 1118 transitions. Second operand has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 12 states have internal predecessors, (119), 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-19 22:06:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:10,391 INFO L93 Difference]: Finished difference Result 1819 states and 2262 transitions. [2024-11-19 22:06:10,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 22:06:10,393 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 12 states have internal predecessors, (119), 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 95 [2024-11-19 22:06:10,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:10,400 INFO L225 Difference]: With dead ends: 1819 [2024-11-19 22:06:10,400 INFO L226 Difference]: Without dead ends: 1154 [2024-11-19 22:06:10,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:06:10,404 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 326 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:10,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 489 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:06:10,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-19 22:06:10,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1096. [2024-11-19 22:06:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 837 states have (on average 1.1720430107526882) internal successors, (981), 889 states have internal predecessors, (981), 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-19 22:06:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1267 transitions. [2024-11-19 22:06:10,508 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1267 transitions. Word has length 95 [2024-11-19 22:06:10,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:10,508 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1267 transitions. [2024-11-19 22:06:10,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 12 states have internal predecessors, (119), 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-19 22:06:10,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1267 transitions. [2024-11-19 22:06:10,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 22:06:10,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:10,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:06:10,523 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 (14)] Ended with exit code 0 [2024-11-19 22:06:10,715 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-19 22:06:10,716 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:10,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:10,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1059470649, now seen corresponding path program 1 times [2024-11-19 22:06:10,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:10,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065797581] [2024-11-19 22:06:10,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:10,717 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-19 22:06:10,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:10,720 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-19 22:06:10,721 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-19 22:06:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:10,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 22:06:10,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 22:06:10,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:10,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:10,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065797581] [2024-11-19 22:06:10,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065797581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:10,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:10,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:06:10,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741687048] [2024-11-19 22:06:10,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:10,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:06:10,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:10,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:06:10,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:10,799 INFO L87 Difference]: Start difference. First operand 1096 states and 1267 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-19 22:06:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:10,863 INFO L93 Difference]: Finished difference Result 1747 states and 2028 transitions. [2024-11-19 22:06:10,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:06:10,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 99 [2024-11-19 22:06:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:10,867 INFO L225 Difference]: With dead ends: 1747 [2024-11-19 22:06:10,867 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 22:06:10,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:10,870 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 37 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 198 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-19 22:06:10,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 198 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:10,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 22:06:10,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 22:06:10,872 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-19 22:06:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 22:06:10,873 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2024-11-19 22:06:10,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:10,874 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 22:06:10,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-19 22:06:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 22:06:10,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 22:06:10,876 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 22:06:10,881 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 (15)] Ended with exit code 0 [2024-11-19 22:06:11,077 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-19 22:06:11,080 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:06:11,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 22:06:15,253 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 22:06:15,269 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-19 22:06:15,302 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-19 22:06:15,358 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse11 (= (_ bv2 32) |old(~waterLevel~0)|)) (.cse13 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse12 (= (_ bv0 32) |old(~methAndRunningLastTime~0)|)) (.cse10 (= (_ bv0 32) ~systemActive~0))) (let ((.cse2 (not .cse10)) (.cse0 (not .cse12)) (.cse6 (not .cse13)) (.cse3 (= (_ bv0 32) ~pumpRunning~0)) (.cse1 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse5 (not .cse11)) (.cse4 (= ~waterLevel~0 (_ bv2 32))) (.cse8 (= (_ bv0 32) |old(~pumpRunning~0)|)) (.cse9 (= (_ bv1 32) |old(~pumpRunning~0)|)) (.cse7 (= (_ bv1 32) ~systemActive~0))) (and (or .cse0 .cse1 .cse2) (or (and .cse3 .cse4) .cse5 .cse2) (or (and (= ~waterLevel~0 (_ bv1 32)) .cse3) .cse6) (or .cse0 .cse6 .cse1) (or (and .cse3 .cse4 .cse1) (not .cse7) (not .cse8) .cse5) (or (and .cse4 (= (_ bv1 32) ~pumpRunning~0)) (not .cse9)) (or (and .cse10 .cse8 .cse11) (and .cse12 .cse8 .cse13 .cse7) (and .cse10 .cse8 .cse13 (= ~methaneLevelCritical~0 (_ bv0 32))) (and .cse12 .cse8 .cse11 .cse7) (and .cse12 .cse10 .cse8 .cse13) (and .cse9 .cse11 .cse7))))) Eliminated clause: (exists ((|old(~waterLevel~0)| (_ BitVec 32)) (|old(~methAndRunningLastTime~0)| (_ BitVec 32)) (|old(~pumpRunning~0)| (_ BitVec 32))) (let ((.cse11 (= (_ bv2 32) |old(~waterLevel~0)|)) (.cse13 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse12 (= (_ bv0 32) |old(~methAndRunningLastTime~0)|)) (.cse10 (= (_ bv0 32) ~systemActive~0))) (let ((.cse2 (not .cse10)) (.cse0 (not .cse12)) (.cse6 (not .cse13)) (.cse3 (= (_ bv0 32) ~pumpRunning~0)) (.cse1 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse5 (not .cse11)) (.cse4 (= ~waterLevel~0 (_ bv2 32))) (.cse8 (= (_ bv0 32) |old(~pumpRunning~0)|)) (.cse9 (= (_ bv1 32) |old(~pumpRunning~0)|)) (.cse7 (= (_ bv1 32) ~systemActive~0))) (and (or .cse0 .cse1 .cse2) (or (and .cse3 .cse4) .cse5 .cse2) (or (and (= ~waterLevel~0 (_ bv1 32)) .cse3) .cse6) (or .cse0 .cse6 .cse1) (or (and .cse3 .cse4 .cse1) (not .cse7) (not .cse8) .cse5) (or (and .cse4 (= (_ bv1 32) ~pumpRunning~0)) (not .cse9)) (or (and .cse10 .cse8 .cse11) (and .cse12 .cse8 .cse13 .cse7) (and .cse10 .cse8 .cse13 (= ~methaneLevelCritical~0 (_ bv0 32))) (and .cse12 .cse8 .cse11 .cse7) (and .cse12 .cse10 .cse8 .cse13) (and .cse9 .cse11 .cse7)))))) [2024-11-19 22:06:15,379 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 22:06:15,391 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-19 22:06:15,409 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-19 22:06:15,420 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 22:06:15,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:06:15 BoogieIcfgContainer [2024-11-19 22:06:15,422 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 22:06:15,423 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 22:06:15,423 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 22:06:15,423 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 22:06:15,423 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:06:03" (3/4) ... [2024-11-19 22:06:15,426 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 22:06:15,429 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-11-19 22:06:15,430 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-19 22:06:15,430 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-19 22:06:15,430 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-11-19 22:06:15,430 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-19 22:06:15,430 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-19 22:06:15,430 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-11-19 22:06:15,431 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-19 22:06:15,441 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-19 22:06:15,441 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-19 22:06:15,442 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 22:06:15,442 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 22:06:15,442 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 22:06:15,569 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 22:06:15,569 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 22:06:15,569 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 22:06:15,570 INFO L158 Benchmark]: Toolchain (without parser) took 13157.92ms. Allocated memory was 58.7MB in the beginning and 199.2MB in the end (delta: 140.5MB). Free memory was 29.4MB in the beginning and 113.1MB in the end (delta: -83.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-11-19 22:06:15,570 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 41.9MB. Free memory was 18.4MB in the beginning and 18.4MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:06:15,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.83ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 29.2MB in the beginning and 35.1MB in the end (delta: -6.0MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-19 22:06:15,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.45ms. Allocated memory is still 71.3MB. Free memory was 34.9MB in the beginning and 32.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:06:15,571 INFO L158 Benchmark]: Boogie Preprocessor took 50.78ms. Allocated memory is still 71.3MB. Free memory was 32.7MB in the beginning and 30.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:06:15,571 INFO L158 Benchmark]: RCFGBuilder took 502.33ms. Allocated memory is still 71.3MB. Free memory was 30.1MB in the beginning and 31.5MB in the end (delta: -1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 22:06:15,571 INFO L158 Benchmark]: TraceAbstraction took 11855.60ms. Allocated memory was 71.3MB in the beginning and 199.2MB in the end (delta: 127.9MB). Free memory was 30.9MB in the beginning and 121.5MB in the end (delta: -90.6MB). Peak memory consumption was 105.5MB. Max. memory is 16.1GB. [2024-11-19 22:06:15,571 INFO L158 Benchmark]: Witness Printer took 146.88ms. Allocated memory is still 199.2MB. Free memory was 121.5MB in the beginning and 113.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 22:06:15,576 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.12ms. Allocated memory is still 41.9MB. Free memory was 18.4MB in the beginning and 18.4MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 532.83ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 29.2MB in the beginning and 35.1MB in the end (delta: -6.0MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.45ms. Allocated memory is still 71.3MB. Free memory was 34.9MB in the beginning and 32.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.78ms. Allocated memory is still 71.3MB. Free memory was 32.7MB in the beginning and 30.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 502.33ms. Allocated memory is still 71.3MB. Free memory was 30.1MB in the beginning and 31.5MB in the end (delta: -1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11855.60ms. Allocated memory was 71.3MB in the beginning and 199.2MB in the end (delta: 127.9MB). Free memory was 30.9MB in the beginning and 121.5MB in the end (delta: -90.6MB). Peak memory consumption was 105.5MB. Max. memory is 16.1GB. * Witness Printer took 146.88ms. Allocated memory is still 199.2MB. Free memory was 121.5MB in the beginning and 113.1MB 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, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 768 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 759 mSDsluCounter, 3777 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2295 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 469 IncrementalHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 1482 mSDtfsCounter, 469 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 909 GetRequests, 867 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1096occurred in iteration=13, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 228 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 818 NumberOfCodeBlocks, 818 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 898 ConstructedInterpolants, 0 QuantifiedInterpolants, 1745 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1818 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 164/177 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: 366]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: ((((((((waterLevel == 2) && (1 == pumpRunning)) && (0 == splverifierCounter)) && (1 == systemActive)) || (((((0 == pumpRunning) && (0 == systemActive)) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (0 == splverifierCounter))) || (((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (0 == splverifierCounter)) && (1 == systemActive))) || (((((waterLevel == 1) && (0 == pumpRunning)) && (0 == systemActive)) && (methAndRunningLastTime == 0)) && (0 == splverifierCounter))) || (((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (0 == splverifierCounter)) && (1 == systemActive))) - InvariantResult [Line: 65]: Location Invariant Derived location invariant: 0 - 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))) && (methaneLevelCritical == 0))) || ((((0 == \old(methAndRunningLastTime)) && (0 == \old(pumpRunning))) && (2 == \old(waterLevel))) && (1 == systemActive))) || ((((0 == \old(methAndRunningLastTime)) && (0 == systemActive)) && (0 == \old(pumpRunning))) && (1 == \old(waterLevel)))) || (((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-19 22:06:15,604 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