./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product37.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec5_product37.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 3ab30b3db91b0e47e6f9b2ed9ba465facc49148e5cdc1cad78e4808ba0c7de84 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:55:54,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:55:54,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:55:54,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:55:54,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:55:54,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:55:54,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:55:54,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:55:54,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:55:54,583 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:55:54,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:55:54,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:55:54,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:55:54,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:55:54,584 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:55:54,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:55:54,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:55:54,585 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:55:54,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:55:54,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:55:54,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:55:54,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:55:54,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:55:54,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:55:54,590 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:55:54,590 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:55:54,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:55:54,591 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:55:54,591 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:55:54,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:55:54,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:55:54,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:55:54,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:55:54,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:55:54,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:55:54,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:55:54,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:55:54,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:55:54,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:55:54,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:55:54,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:55:54,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:55:54,596 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 -> 3ab30b3db91b0e47e6f9b2ed9ba465facc49148e5cdc1cad78e4808ba0c7de84 [2024-11-11 20:55:54,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:55:54,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:55:54,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:55:54,882 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:55:54,883 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:55:54,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product37.cil.c [2024-11-11 20:55:56,293 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:55:56,517 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:55:56,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product37.cil.c [2024-11-11 20:55:56,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8918181b/f66c606032164f59ac2af3c72ea371a4/FLAG1afd61472 [2024-11-11 20:55:56,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8918181b/f66c606032164f59ac2af3c72ea371a4 [2024-11-11 20:55:56,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:55:56,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:55:56,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:55:56,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:55:56,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:55:56,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:55:56" (1/1) ... [2024-11-11 20:55:56,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3487742a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:56, skipping insertion in model container [2024-11-11 20:55:56,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:55:56" (1/1) ... [2024-11-11 20:55:56,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:55:57,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product37.cil.c[5071,5084] [2024-11-11 20:55:57,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:55:57,293 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:55:57,303 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2024-11-11 20:55:57,305 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [150] [2024-11-11 20:55:57,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [201] [2024-11-11 20:55:57,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [304] [2024-11-11 20:55:57,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [313] [2024-11-11 20:55:57,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [496] [2024-11-11 20:55:57,307 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [561] [2024-11-11 20:55:57,307 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [596] [2024-11-11 20:55:57,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product37.cil.c[5071,5084] [2024-11-11 20:55:57,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:55:57,404 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:55:57,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:57 WrapperNode [2024-11-11 20:55:57,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:55:57,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:55:57,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:55:57,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:55:57,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:57" (1/1) ... [2024-11-11 20:55:57,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:57" (1/1) ... [2024-11-11 20:55:57,454 INFO L138 Inliner]: procedures = 55, calls = 100, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 203 [2024-11-11 20:55:57,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:55:57,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:55:57,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:55:57,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:55:57,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:57" (1/1) ... [2024-11-11 20:55:57,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:57" (1/1) ... [2024-11-11 20:55:57,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:57" (1/1) ... [2024-11-11 20:55:57,491 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-11 20:55:57,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:57" (1/1) ... [2024-11-11 20:55:57,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:57" (1/1) ... [2024-11-11 20:55:57,497 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:57" (1/1) ... [2024-11-11 20:55:57,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:57" (1/1) ... [2024-11-11 20:55:57,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:57" (1/1) ... [2024-11-11 20:55:57,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:57" (1/1) ... [2024-11-11 20:55:57,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:55:57,511 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:55:57,512 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:55:57,512 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:55:57,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:57" (1/1) ... [2024-11-11 20:55:57,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:55:57,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:55:57,560 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-11 20:55:57,568 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-11 20:55:57,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:55:57,620 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-11 20:55:57,620 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-11 20:55:57,620 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:55:57,620 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:55:57,620 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:55:57,620 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:55:57,621 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:55:57,621 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:55:57,621 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-11 20:55:57,621 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-11 20:55:57,622 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2024-11-11 20:55:57,622 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2024-11-11 20:55:57,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:55:57,622 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-11 20:55:57,623 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-11 20:55:57,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:55:57,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:55:57,720 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:55:57,723 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:55:58,072 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-11 20:55:58,072 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:55:58,092 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:55:58,093 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:55:58,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:55:58 BoogieIcfgContainer [2024-11-11 20:55:58,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:55:58,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:55:58,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:55:58,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:55:58,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:55:56" (1/3) ... [2024-11-11 20:55:58,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f47d02c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:55:58, skipping insertion in model container [2024-11-11 20:55:58,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:57" (2/3) ... [2024-11-11 20:55:58,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f47d02c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:55:58, skipping insertion in model container [2024-11-11 20:55:58,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:55:58" (3/3) ... [2024-11-11 20:55:58,103 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product37.cil.c [2024-11-11 20:55:58,121 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:55:58,121 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:55:58,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:55:58,190 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;@124fe327, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:55:58,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:55:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 77 states have internal predecessors, (95), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-11 20:55:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-11 20:55:58,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:58,203 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:58,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:58,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:58,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1723855951, now seen corresponding path program 1 times [2024-11-11 20:55:58,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:58,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892000108] [2024-11-11 20:55:58,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:58,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:55:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:55:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:55:58,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:58,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892000108] [2024-11-11 20:55:58,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892000108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:58,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:58,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:55:58,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349619780] [2024-11-11 20:55:58,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:58,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:55:58,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:58,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:55:58,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:55:58,444 INFO L87 Difference]: Start difference. First operand has 90 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 77 states have internal predecessors, (95), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:55:58,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:58,471 INFO L93 Difference]: Finished difference Result 171 states and 232 transitions. [2024-11-11 20:55:58,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:55:58,473 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-11 20:55:58,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:58,485 INFO L225 Difference]: With dead ends: 171 [2024-11-11 20:55:58,486 INFO L226 Difference]: Without dead ends: 81 [2024-11-11 20:55:58,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:55:58,494 INFO L435 NwaCegarLoop]: 113 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, 113 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-11 20:55:58,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-11 20:55:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-11 20:55:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 69 states have internal predecessors, (81), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-11 20:55:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2024-11-11 20:55:58,535 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 32 [2024-11-11 20:55:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:58,535 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2024-11-11 20:55:58,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:55:58,536 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2024-11-11 20:55:58,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-11 20:55:58,538 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:58,539 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:58,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:55:58,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:58,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:58,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1860405445, now seen corresponding path program 1 times [2024-11-11 20:55:58,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:58,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189704617] [2024-11-11 20:55:58,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:58,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:55:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:55:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:55:58,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:58,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189704617] [2024-11-11 20:55:58,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189704617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:58,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:58,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:55:58,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351424413] [2024-11-11 20:55:58,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:58,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:55:58,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:58,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:55:58,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:58,706 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:55:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:58,724 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2024-11-11 20:55:58,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:55:58,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-11 20:55:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:58,726 INFO L225 Difference]: With dead ends: 127 [2024-11-11 20:55:58,727 INFO L226 Difference]: Without dead ends: 72 [2024-11-11 20:55:58,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:58,730 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 12 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 166 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-11 20:55:58,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 166 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-11 20:55:58,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-11 20:55:58,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 63 states have internal predecessors, (74), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-11 20:55:58,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2024-11-11 20:55:58,750 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 33 [2024-11-11 20:55:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:58,752 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2024-11-11 20:55:58,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:55:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2024-11-11 20:55:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 20:55:58,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:58,754 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:58,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:55:58,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:58,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:58,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1706700211, now seen corresponding path program 1 times [2024-11-11 20:55:58,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:58,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149470734] [2024-11-11 20:55:58,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:58,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:55:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:55:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:55:58,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:58,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149470734] [2024-11-11 20:55:58,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149470734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:58,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:58,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:55:58,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905682167] [2024-11-11 20:55:58,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:58,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:55:58,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:58,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:55:58,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:58,903 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:55:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:58,918 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2024-11-11 20:55:58,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:55:58,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-11-11 20:55:58,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:58,920 INFO L225 Difference]: With dead ends: 136 [2024-11-11 20:55:58,921 INFO L226 Difference]: Without dead ends: 72 [2024-11-11 20:55:58,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11 20:55:58,922 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 90 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-11 20:55:58,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 90 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:58,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-11 20:55:58,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-11 20:55:58,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 63 states have internal predecessors, (73), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-11 20:55:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2024-11-11 20:55:58,937 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 37 [2024-11-11 20:55:58,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:58,938 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2024-11-11 20:55:58,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:55:58,939 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2024-11-11 20:55:58,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-11 20:55:58,940 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:58,940 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:58,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:55:58,941 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:58,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:58,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2032099452, now seen corresponding path program 1 times [2024-11-11 20:55:58,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:58,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563148693] [2024-11-11 20:55:58,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:58,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:59,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:55:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:59,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:55:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:55:59,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:59,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563148693] [2024-11-11 20:55:59,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563148693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:59,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:59,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:55:59,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355369608] [2024-11-11 20:55:59,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:59,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:55:59,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:59,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:55:59,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:59,013 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:55:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:59,054 INFO L93 Difference]: Finished difference Result 183 states and 238 transitions. [2024-11-11 20:55:59,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:55:59,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2024-11-11 20:55:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:59,058 INFO L225 Difference]: With dead ends: 183 [2024-11-11 20:55:59,059 INFO L226 Difference]: Without dead ends: 119 [2024-11-11 20:55:59,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:59,061 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 74 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:59,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 168 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:59,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-11 20:55:59,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2024-11-11 20:55:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.288888888888889) internal successors, (116), 97 states have internal predecessors, (116), 14 states have call successors, (14), 12 states have call predecessors, (14), 12 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2024-11-11 20:55:59,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2024-11-11 20:55:59,082 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 43 [2024-11-11 20:55:59,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:59,082 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2024-11-11 20:55:59,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:55:59,083 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2024-11-11 20:55:59,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 20:55:59,084 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:59,084 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:59,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:55:59,085 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:59,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:59,085 INFO L85 PathProgramCache]: Analyzing trace with hash -870205615, now seen corresponding path program 1 times [2024-11-11 20:55:59,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:59,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201284468] [2024-11-11 20:55:59,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:59,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:59,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:55:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:59,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 20:55:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:59,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:55:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:55:59,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:59,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201284468] [2024-11-11 20:55:59,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201284468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:59,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:59,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:55:59,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927341785] [2024-11-11 20:55:59,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:59,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:55:59,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:59,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:55:59,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:55:59,266 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (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-11 20:55:59,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:59,581 INFO L93 Difference]: Finished difference Result 255 states and 329 transitions. [2024-11-11 20:55:59,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:55:59,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-11 20:55:59,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:59,584 INFO L225 Difference]: With dead ends: 255 [2024-11-11 20:55:59,584 INFO L226 Difference]: Without dead ends: 146 [2024-11-11 20:55:59,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:55:59,586 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 51 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:59,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 364 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:55:59,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-11 20:55:59,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2024-11-11 20:55:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 112 states have (on average 1.2857142857142858) internal successors, (144), 119 states have internal predecessors, (144), 16 states have call successors, (16), 12 states have call predecessors, (16), 15 states have return successors, (23), 17 states have call predecessors, (23), 16 states have call successors, (23) [2024-11-11 20:55:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 183 transitions. [2024-11-11 20:55:59,612 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 183 transitions. Word has length 51 [2024-11-11 20:55:59,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:59,612 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 183 transitions. [2024-11-11 20:55:59,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (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-11 20:55:59,613 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 183 transitions. [2024-11-11 20:55:59,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 20:55:59,618 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:59,618 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:59,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:55:59,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:59,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:59,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1735817939, now seen corresponding path program 1 times [2024-11-11 20:55:59,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:59,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018601313] [2024-11-11 20:55:59,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:59,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:59,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:55:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:59,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 20:55:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:59,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:55:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:59,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:55:59,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:59,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018601313] [2024-11-11 20:55:59,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018601313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:59,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:59,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:55:59,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381028544] [2024-11-11 20:55:59,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:59,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:55:59,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:59,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:55:59,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:55:59,785 INFO L87 Difference]: Start difference. First operand 144 states and 183 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:55:59,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:59,943 INFO L93 Difference]: Finished difference Result 284 states and 370 transitions. [2024-11-11 20:55:59,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:55:59,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2024-11-11 20:55:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:59,945 INFO L225 Difference]: With dead ends: 284 [2024-11-11 20:55:59,947 INFO L226 Difference]: Without dead ends: 148 [2024-11-11 20:55:59,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:55:59,953 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 111 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:59,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 279 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:55:59,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-11 20:55:59,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2024-11-11 20:55:59,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 114 states have (on average 1.280701754385965) internal successors, (146), 121 states have internal predecessors, (146), 16 states have call successors, (16), 12 states have call predecessors, (16), 15 states have return successors, (23), 17 states have call predecessors, (23), 16 states have call successors, (23) [2024-11-11 20:55:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 185 transitions. [2024-11-11 20:55:59,981 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 185 transitions. Word has length 51 [2024-11-11 20:55:59,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:59,982 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 185 transitions. [2024-11-11 20:55:59,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:55:59,984 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 185 transitions. [2024-11-11 20:55:59,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 20:55:59,985 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:59,985 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:59,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:55:59,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:59,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:59,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2136447531, now seen corresponding path program 1 times [2024-11-11 20:55:59,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:59,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126256923] [2024-11-11 20:55:59,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:59,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:56:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 20:56:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:56:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:56:00,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:00,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126256923] [2024-11-11 20:56:00,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126256923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:56:00,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:56:00,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:56:00,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889983831] [2024-11-11 20:56:00,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:56:00,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:56:00,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:00,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:56:00,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:56:00,121 INFO L87 Difference]: Start difference. First operand 146 states and 185 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 3 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-11 20:56:00,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:00,366 INFO L93 Difference]: Finished difference Result 421 states and 552 transitions. [2024-11-11 20:56:00,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:56:00,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-11 20:56:00,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:00,370 INFO L225 Difference]: With dead ends: 421 [2024-11-11 20:56:00,371 INFO L226 Difference]: Without dead ends: 283 [2024-11-11 20:56:00,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:56:00,373 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 210 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:00,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 290 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:56:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-11 20:56:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 275. [2024-11-11 20:56:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 211 states have (on average 1.2559241706161137) internal successors, (265), 222 states have internal predecessors, (265), 34 states have call successors, (34), 28 states have call predecessors, (34), 29 states have return successors, (53), 34 states have call predecessors, (53), 34 states have call successors, (53) [2024-11-11 20:56:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 352 transitions. [2024-11-11 20:56:00,415 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 352 transitions. Word has length 51 [2024-11-11 20:56:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:00,416 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 352 transitions. [2024-11-11 20:56:00,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 3 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-11 20:56:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 352 transitions. [2024-11-11 20:56:00,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 20:56:00,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:00,417 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:56:00,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:56:00,418 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:00,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:00,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1858186128, now seen corresponding path program 1 times [2024-11-11 20:56:00,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:00,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813495545] [2024-11-11 20:56:00,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:00,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:56:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 20:56:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:56:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:56:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 20:56:00,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:00,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813495545] [2024-11-11 20:56:00,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813495545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:56:00,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:56:00,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:56:00,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755764024] [2024-11-11 20:56:00,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:56:00,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:56:00,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:00,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:56:00,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:56:00,550 INFO L87 Difference]: Start difference. First operand 275 states and 352 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 20:56:00,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:00,803 INFO L93 Difference]: Finished difference Result 540 states and 699 transitions. [2024-11-11 20:56:00,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:56:00,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2024-11-11 20:56:00,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:00,806 INFO L225 Difference]: With dead ends: 540 [2024-11-11 20:56:00,806 INFO L226 Difference]: Without dead ends: 273 [2024-11-11 20:56:00,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:56:00,808 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 125 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:00,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 366 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:56:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-11 20:56:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2024-11-11 20:56:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 207 states have (on average 1.2222222222222223) internal successors, (253), 218 states have internal predecessors, (253), 34 states have call successors, (34), 28 states have call predecessors, (34), 29 states have return successors, (53), 34 states have call predecessors, (53), 34 states have call successors, (53) [2024-11-11 20:56:00,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 340 transitions. [2024-11-11 20:56:00,836 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 340 transitions. Word has length 53 [2024-11-11 20:56:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:00,836 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 340 transitions. [2024-11-11 20:56:00,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 20:56:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 340 transitions. [2024-11-11 20:56:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 20:56:00,837 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:00,837 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:56:00,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:56:00,838 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:00,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:00,838 INFO L85 PathProgramCache]: Analyzing trace with hash -2030829189, now seen corresponding path program 1 times [2024-11-11 20:56:00,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:00,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394306294] [2024-11-11 20:56:00,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:00,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:56:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:01,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:56:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:01,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:56:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:01,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:56:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:56:01,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:01,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394306294] [2024-11-11 20:56:01,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394306294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:56:01,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:56:01,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:56:01,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945560957] [2024-11-11 20:56:01,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:56:01,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:56:01,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:01,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:56:01,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:56:01,046 INFO L87 Difference]: Start difference. First operand 271 states and 340 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 20:56:01,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:01,587 INFO L93 Difference]: Finished difference Result 813 states and 1064 transitions. [2024-11-11 20:56:01,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 20:56:01,587 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2024-11-11 20:56:01,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:01,592 INFO L225 Difference]: With dead ends: 813 [2024-11-11 20:56:01,592 INFO L226 Difference]: Without dead ends: 600 [2024-11-11 20:56:01,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2024-11-11 20:56:01,594 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 390 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:01,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 513 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 20:56:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-11 20:56:01,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 524. [2024-11-11 20:56:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 401 states have (on average 1.2194513715710724) internal successors, (489), 425 states have internal predecessors, (489), 65 states have call successors, (65), 49 states have call predecessors, (65), 57 states have return successors, (104), 67 states have call predecessors, (104), 65 states have call successors, (104) [2024-11-11 20:56:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 658 transitions. [2024-11-11 20:56:01,651 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 658 transitions. Word has length 55 [2024-11-11 20:56:01,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:01,651 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 658 transitions. [2024-11-11 20:56:01,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 20:56:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 658 transitions. [2024-11-11 20:56:01,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 20:56:01,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:01,654 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 20:56:01,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:56:01,654 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:01,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:01,655 INFO L85 PathProgramCache]: Analyzing trace with hash 309041265, now seen corresponding path program 1 times [2024-11-11 20:56:01,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:01,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37996095] [2024-11-11 20:56:01,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:01,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:01,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:56:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:01,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:56:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:01,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:01,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:56:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:01,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:56:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:01,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:56:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:01,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:56:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:01,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:56:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 20:56:01,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:01,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37996095] [2024-11-11 20:56:01,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37996095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:56:01,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798604192] [2024-11-11 20:56:01,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:01,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:56:01,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:56:01,873 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-11 20:56:01,874 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-11 20:56:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:01,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:56:01,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:56:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:56:02,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:56:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 20:56:02,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798604192] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:56:02,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:56:02,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 15 [2024-11-11 20:56:02,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395473721] [2024-11-11 20:56:02,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:56:02,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-11 20:56:02,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:02,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-11 20:56:02,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:56:02,345 INFO L87 Difference]: Start difference. First operand 524 states and 658 transitions. Second operand has 15 states, 15 states have (on average 8.6) internal successors, (129), 10 states have internal predecessors, (129), 6 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2024-11-11 20:56:03,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:03,523 INFO L93 Difference]: Finished difference Result 1125 states and 1452 transitions. [2024-11-11 20:56:03,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-11 20:56:03,523 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.6) internal successors, (129), 10 states have internal predecessors, (129), 6 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) Word has length 94 [2024-11-11 20:56:03,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:03,527 INFO L225 Difference]: With dead ends: 1125 [2024-11-11 20:56:03,528 INFO L226 Difference]: Without dead ends: 657 [2024-11-11 20:56:03,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 208 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=438, Invalid=1454, Unknown=0, NotChecked=0, Total=1892 [2024-11-11 20:56:03,531 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 359 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:03,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1324 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 20:56:03,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-11-11 20:56:03,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 585. [2024-11-11 20:56:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 441 states have (on average 1.2086167800453516) internal successors, (533), 473 states have internal predecessors, (533), 75 states have call successors, (75), 63 states have call predecessors, (75), 68 states have return successors, (100), 70 states have call predecessors, (100), 75 states have call successors, (100) [2024-11-11 20:56:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 708 transitions. [2024-11-11 20:56:03,581 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 708 transitions. Word has length 94 [2024-11-11 20:56:03,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:03,581 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 708 transitions. [2024-11-11 20:56:03,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.6) internal successors, (129), 10 states have internal predecessors, (129), 6 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2024-11-11 20:56:03,582 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 708 transitions. [2024-11-11 20:56:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 20:56:03,584 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:03,584 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-11 20:56:03,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:56:03,785 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-11 20:56:03,786 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:03,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:03,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1424558119, now seen corresponding path program 1 times [2024-11-11 20:56:03,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:03,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314292414] [2024-11-11 20:56:03,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:03,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:03,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:56:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:03,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:56:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:03,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:03,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:56:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:03,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:56:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:04,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:04,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:56:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:04,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:56:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:04,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:56:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:04,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:04,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 20:56:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:04,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-11 20:56:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:04,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-11 20:56:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:04,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-11 20:56:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:04,158 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 97 proven. 7 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-11 20:56:04,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:04,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314292414] [2024-11-11 20:56:04,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314292414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:56:04,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629236991] [2024-11-11 20:56:04,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:04,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:56:04,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:56:04,161 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-11 20:56:04,162 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-11 20:56:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:04,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-11 20:56:04,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:56:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 138 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-11 20:56:04,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:56:04,976 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 78 proven. 42 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-11 20:56:04,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629236991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:56:04,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:56:04,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 11] total 28 [2024-11-11 20:56:04,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301595734] [2024-11-11 20:56:04,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:56:04,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 20:56:04,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:04,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 20:56:04,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-11 20:56:04,979 INFO L87 Difference]: Start difference. First operand 585 states and 708 transitions. Second operand has 28 states, 28 states have (on average 7.5) internal successors, (210), 24 states have internal predecessors, (210), 9 states have call successors, (29), 8 states have call predecessors, (29), 10 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2024-11-11 20:56:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:06,859 INFO L93 Difference]: Finished difference Result 1678 states and 2119 transitions. [2024-11-11 20:56:06,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-11 20:56:06,860 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.5) internal successors, (210), 24 states have internal predecessors, (210), 9 states have call successors, (29), 8 states have call predecessors, (29), 10 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) Word has length 168 [2024-11-11 20:56:06,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:06,868 INFO L225 Difference]: With dead ends: 1678 [2024-11-11 20:56:06,868 INFO L226 Difference]: Without dead ends: 1101 [2024-11-11 20:56:06,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 361 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=887, Invalid=3943, Unknown=0, NotChecked=0, Total=4830 [2024-11-11 20:56:06,874 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 819 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:06,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 1364 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:56:06,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2024-11-11 20:56:06,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1029. [2024-11-11 20:56:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 783 states have (on average 1.1507024265644956) internal successors, (901), 825 states have internal predecessors, (901), 132 states have call successors, (132), 115 states have call predecessors, (132), 113 states have return successors, (155), 117 states have call predecessors, (155), 132 states have call successors, (155) [2024-11-11 20:56:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1188 transitions. [2024-11-11 20:56:06,976 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1188 transitions. Word has length 168 [2024-11-11 20:56:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:06,977 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1188 transitions. [2024-11-11 20:56:06,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.5) internal successors, (210), 24 states have internal predecessors, (210), 9 states have call successors, (29), 8 states have call predecessors, (29), 10 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2024-11-11 20:56:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1188 transitions. [2024-11-11 20:56:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-11 20:56:06,982 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:06,982 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-11 20:56:07,002 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-11 20:56:07,186 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-11 20:56:07,187 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:07,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:07,187 INFO L85 PathProgramCache]: Analyzing trace with hash 126290915, now seen corresponding path program 1 times [2024-11-11 20:56:07,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:07,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292046906] [2024-11-11 20:56:07,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:07,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:56:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:56:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:56:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:56:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:56:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:56:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 20:56:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:56:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:56:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:56:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 20:56:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-11 20:56:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-11 20:56:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-11 20:56:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 86 proven. 52 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-11 20:56:07,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:07,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292046906] [2024-11-11 20:56:07,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292046906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:56:07,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339116558] [2024-11-11 20:56:07,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:07,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:56:07,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:56:07,461 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-11 20:56:07,463 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-11 20:56:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:07,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 20:56:07,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:56:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 175 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-11 20:56:07,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:56:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 99 proven. 53 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-11 20:56:08,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339116558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:56:08,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:56:08,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 22 [2024-11-11 20:56:08,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964270335] [2024-11-11 20:56:08,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:56:08,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-11 20:56:08,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:08,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-11 20:56:08,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-11-11 20:56:08,152 INFO L87 Difference]: Start difference. First operand 1029 states and 1188 transitions. Second operand has 22 states, 22 states have (on average 9.863636363636363) internal successors, (217), 15 states have internal predecessors, (217), 7 states have call successors, (38), 8 states have call predecessors, (38), 11 states have return successors, (33), 10 states have call predecessors, (33), 7 states have call successors, (33) [2024-11-11 20:56:09,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:09,469 INFO L93 Difference]: Finished difference Result 2002 states and 2342 transitions. [2024-11-11 20:56:09,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-11 20:56:09,470 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.863636363636363) internal successors, (217), 15 states have internal predecessors, (217), 7 states have call successors, (38), 8 states have call predecessors, (38), 11 states have return successors, (33), 10 states have call predecessors, (33), 7 states have call successors, (33) Word has length 184 [2024-11-11 20:56:09,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:09,476 INFO L225 Difference]: With dead ends: 2002 [2024-11-11 20:56:09,477 INFO L226 Difference]: Without dead ends: 1077 [2024-11-11 20:56:09,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 401 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=449, Invalid=1807, Unknown=0, NotChecked=0, Total=2256 [2024-11-11 20:56:09,480 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 516 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:09,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 406 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:56:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2024-11-11 20:56:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1027. [2024-11-11 20:56:09,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 783 states have (on average 1.1392081736909323) internal successors, (892), 823 states have internal predecessors, (892), 126 states have call successors, (126), 117 states have call predecessors, (126), 117 states have return successors, (149), 115 states have call predecessors, (149), 126 states have call successors, (149) [2024-11-11 20:56:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1167 transitions. [2024-11-11 20:56:09,557 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1167 transitions. Word has length 184 [2024-11-11 20:56:09,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:09,559 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1167 transitions. [2024-11-11 20:56:09,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.863636363636363) internal successors, (217), 15 states have internal predecessors, (217), 7 states have call successors, (38), 8 states have call predecessors, (38), 11 states have return successors, (33), 10 states have call predecessors, (33), 7 states have call successors, (33) [2024-11-11 20:56:09,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1167 transitions. [2024-11-11 20:56:09,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-11 20:56:09,563 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:09,564 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-11 20:56:09,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 20:56:09,767 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-11 20:56:09,768 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:09,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:09,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2113019229, now seen corresponding path program 1 times [2024-11-11 20:56:09,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:09,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691740668] [2024-11-11 20:56:09,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:09,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:56:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:56:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:56:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:56:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:56:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:56:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 20:56:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:56:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:56:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:56:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 20:56:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-11 20:56:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-11 20:56:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-11 20:56:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 86 proven. 43 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-11 20:56:10,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:10,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691740668] [2024-11-11 20:56:10,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691740668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:56:10,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012850937] [2024-11-11 20:56:10,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:10,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:56:10,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:56:10,310 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-11 20:56:10,312 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-11 20:56:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:10,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-11 20:56:10,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:56:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 122 proven. 26 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-11 20:56:10,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:56:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 95 proven. 45 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-11 20:56:11,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012850937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:56:11,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:56:11,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 13] total 23 [2024-11-11 20:56:11,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906931926] [2024-11-11 20:56:11,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:56:11,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-11 20:56:11,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:11,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-11 20:56:11,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:56:11,307 INFO L87 Difference]: Start difference. First operand 1027 states and 1167 transitions. Second operand has 23 states, 23 states have (on average 9.434782608695652) internal successors, (217), 19 states have internal predecessors, (217), 13 states have call successors, (39), 11 states have call predecessors, (39), 13 states have return successors, (35), 13 states have call predecessors, (35), 13 states have call successors, (35) [2024-11-11 20:56:12,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:12,710 INFO L93 Difference]: Finished difference Result 1894 states and 2201 transitions. [2024-11-11 20:56:12,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-11 20:56:12,711 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.434782608695652) internal successors, (217), 19 states have internal predecessors, (217), 13 states have call successors, (39), 11 states have call predecessors, (39), 13 states have return successors, (35), 13 states have call predecessors, (35), 13 states have call successors, (35) Word has length 185 [2024-11-11 20:56:12,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:12,714 INFO L225 Difference]: With dead ends: 1894 [2024-11-11 20:56:12,714 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 20:56:12,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 405 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=844, Invalid=2816, Unknown=0, NotChecked=0, Total=3660 [2024-11-11 20:56:12,720 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 651 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:12,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 487 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:56:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 20:56:12,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 20:56:12,722 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-11 20:56:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 20:56:12,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 185 [2024-11-11 20:56:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:12,723 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 20:56:12,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.434782608695652) internal successors, (217), 19 states have internal predecessors, (217), 13 states have call successors, (39), 11 states have call predecessors, (39), 13 states have return successors, (35), 13 states have call predecessors, (35), 13 states have call successors, (35) [2024-11-11 20:56:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 20:56:12,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 20:56:12,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:56:12,746 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-11 20:56:12,928 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-11 20:56:12,931 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:56:12,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 20:56:20,858 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:56:20,886 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (and (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= 1 ~systemActive~0)) (.cse2 (<= ~waterLevel~0 2))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and (= ~pumpRunning~0 0) .cse1 .cse2) (and .cse0 (= |old(~methaneLevelCritical~0)| 0) .cse1 .cse2 (<= 1 ~switchedOnBeforeTS~0)))) (= |old(~methaneLevelCritical~0)| ~methaneLevelCritical~0)) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= 1 ~systemActive~0)) (.cse2 (<= ~waterLevel~0 2))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and (= ~pumpRunning~0 0) .cse1 .cse2) (and .cse0 (= ~methaneLevelCritical~0 0) .cse1 .cse2 (<= 1 ~switchedOnBeforeTS~0)))) [2024-11-11 20:56:20,908 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse0 (= ~pumpRunning~0 |old(~pumpRunning~0)|)) (.cse1 (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|)) (.cse3 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse5 (= |old(~pumpRunning~0)| 0)) (.cse2 (= 1 ~systemActive~0)) (.cse4 (= |old(~waterLevel~0)| 2))) (and (or (< 1 |old(~waterLevel~0)|) (and .cse0 .cse1 .cse2 .cse3 (<= 1 ~switchedOnBeforeTS~0)) (< |old(~pumpRunning~0)| 1)) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (not .cse4)) (or (and (= ~pumpRunning~0 0) .cse1 .cse3) (not .cse5)) (let ((.cse6 (<= 1 |old(~pumpRunning~0)|))) (or (and (<= |old(~waterLevel~0)| 1) .cse6) (and .cse2 .cse5 (<= |old(~waterLevel~0)| 2)) (and .cse2 .cse6 .cse4))))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int) (|old(~switchedOnBeforeTS~0)| Int) (|old(~waterLevel~0)| Int)) (let ((.cse0 (= ~pumpRunning~0 |old(~pumpRunning~0)|)) (.cse1 (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|)) (.cse3 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse5 (= |old(~pumpRunning~0)| 0)) (.cse2 (= 1 ~systemActive~0)) (.cse4 (= |old(~waterLevel~0)| 2))) (and (or (< 1 |old(~waterLevel~0)|) (and .cse0 .cse1 .cse2 .cse3 (<= 1 ~switchedOnBeforeTS~0)) (< |old(~pumpRunning~0)| 1)) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (not .cse4)) (or (and (= ~pumpRunning~0 0) .cse1 .cse3) (not .cse5)) (let ((.cse6 (<= 1 |old(~pumpRunning~0)|))) (or (and (<= |old(~waterLevel~0)| 1) .cse6) (and .cse2 .cse5 (<= |old(~waterLevel~0)| 2)) (and .cse2 .cse6 .cse4)))))) [2024-11-11 20:56:20,921 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 20:56:20,930 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (= |old(~pumpRunning~0)| 0) (<= ~waterLevel~0 2)) (and (= ~methaneLevelCritical~0 0) (<= ~waterLevel~0 1) .cse0 (<= 1 ~switchedOnBeforeTS~0) (<= 1 |old(~pumpRunning~0)|))))) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~pumpRunning~0 0) .cse0 (<= ~waterLevel~0 2)) (and (<= 1 ~pumpRunning~0) (= ~methaneLevelCritical~0 0) (<= ~waterLevel~0 1) .cse0 (<= 1 ~switchedOnBeforeTS~0)))) [2024-11-11 20:56:20,940 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse2 (= |old(~waterLevel~0)| 2)) (.cse0 (= ~pumpRunning~0 0)) (.cse3 (<= 1 ~pumpRunning~0)) (.cse1 (= 1 ~systemActive~0)) (.cse4 (<= |old(~waterLevel~0)| 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and .cse0 .cse1 .cse4) (and .cse3 (= ~methaneLevelCritical~0 0) .cse1 .cse4 (<= 1 ~switchedOnBeforeTS~0)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse3 (<= ~waterLevel~0 1)) (.cse4 (= ~pumpRunning~0 0)) (.cse1 (= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 (= ~methaneLevelCritical~0 0) .cse3 .cse2 (<= 1 ~switchedOnBeforeTS~0)) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse2))) [2024-11-11 20:56:20,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:56:20 BoogieIcfgContainer [2024-11-11 20:56:20,957 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:56:20,957 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:56:20,957 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:56:20,958 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:56:20,958 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:55:58" (3/4) ... [2024-11-11 20:56:20,961 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 20:56:20,965 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-11 20:56:20,966 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-11 20:56:20,966 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-11 20:56:20,966 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-11 20:56:20,966 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:56:20,966 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-11 20:56:20,966 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2024-11-11 20:56:20,974 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-11 20:56:20,975 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-11 20:56:20,975 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-11 20:56:20,976 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:56:20,976 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:56:21,096 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:56:21,096 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 20:56:21,096 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:56:21,097 INFO L158 Benchmark]: Toolchain (without parser) took 24217.31ms. Allocated memory was 159.4MB in the beginning and 421.5MB in the end (delta: 262.1MB). Free memory was 100.7MB in the beginning and 146.6MB in the end (delta: -45.9MB). Peak memory consumption was 219.2MB. Max. memory is 16.1GB. [2024-11-11 20:56:21,097 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:56:21,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.56ms. Allocated memory is still 159.4MB. Free memory was 100.7MB in the beginning and 79.0MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-11 20:56:21,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.71ms. Allocated memory is still 159.4MB. Free memory was 79.0MB in the beginning and 76.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:56:21,099 INFO L158 Benchmark]: Boogie Preprocessor took 51.61ms. Allocated memory is still 159.4MB. Free memory was 76.9MB in the beginning and 74.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:56:21,100 INFO L158 Benchmark]: RCFGBuilder took 582.51ms. Allocated memory was 159.4MB in the beginning and 234.9MB in the end (delta: 75.5MB). Free memory was 74.4MB in the beginning and 198.6MB in the end (delta: -124.3MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-11-11 20:56:21,100 INFO L158 Benchmark]: TraceAbstraction took 22860.67ms. Allocated memory was 234.9MB in the beginning and 421.5MB in the end (delta: 186.6MB). Free memory was 198.6MB in the beginning and 154.9MB in the end (delta: 43.7MB). Peak memory consumption was 249.6MB. Max. memory is 16.1GB. [2024-11-11 20:56:21,100 INFO L158 Benchmark]: Witness Printer took 139.21ms. Allocated memory is still 421.5MB. Free memory was 154.9MB in the beginning and 146.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 20:56:21,102 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 159.4MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.56ms. Allocated memory is still 159.4MB. Free memory was 100.7MB in the beginning and 79.0MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.71ms. Allocated memory is still 159.4MB. Free memory was 79.0MB in the beginning and 76.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.61ms. Allocated memory is still 159.4MB. Free memory was 76.9MB in the beginning and 74.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 582.51ms. Allocated memory was 159.4MB in the beginning and 234.9MB in the end (delta: 75.5MB). Free memory was 74.4MB in the beginning and 198.6MB in the end (delta: -124.3MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * TraceAbstraction took 22860.67ms. Allocated memory was 234.9MB in the beginning and 421.5MB in the end (delta: 186.6MB). Free memory was 198.6MB in the beginning and 154.9MB in the end (delta: 43.7MB). Peak memory consumption was 249.6MB. Max. memory is 16.1GB. * Witness Printer took 139.21ms. Allocated memory is still 421.5MB. Free memory was 154.9MB in the beginning and 146.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] - GenericResultAtLocation [Line: 150]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [150] - GenericResultAtLocation [Line: 201]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [201] - GenericResultAtLocation [Line: 304]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [304] - GenericResultAtLocation [Line: 313]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [313] - GenericResultAtLocation [Line: 496]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [496] - GenericResultAtLocation [Line: 561]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [561] - GenericResultAtLocation [Line: 596]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [596] - 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: 309]: 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 8 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 13, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3424 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3387 mSDsluCounter, 5930 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4683 mSDsCounter, 1027 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6848 IncrementalHoareTripleChecker+Invalid, 7875 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1027 mSolverCounterUnsat, 1247 mSDtfsCounter, 6848 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1729 GetRequests, 1447 SyntacticMatches, 15 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1029occurred in iteration=11, InterpolantAutomatonStates: 207, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 286 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1668 NumberOfCodeBlocks, 1668 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2278 ConstructedInterpolants, 0 QuantifiedInterpolants, 5241 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1884 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 21 InterpolantComputations, 9 PerfectInterpolantSequences, 1757/2073 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: 214]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 506]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: ((((((((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel <= 0)) && (1 <= switchedOnBeforeTS))) || ((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS))) - ProcedureContractResult [Line: 346]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) Ensures: (((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) && (((((((waterLevel == \old(waterLevel)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 83]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) Ensures: (((((((pumpRunning < 1) || (2 == waterLevel)) || (\old(methaneLevelCritical) == 0)) && ((methaneLevelCritical == 0) || (\old(methaneLevelCritical) == 0))) && (((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)))) && ((\old(methaneLevelCritical) != 0) || (methaneLevelCritical != 0))) && ((((((waterLevel == \old(waterLevel)) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 319]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: ((((((((((0 < \old(waterLevel)) || (\old(waterLevel) == waterLevel)) && ((((((1 == systemActive) && (1 <= \old(switchedOnBeforeTS))) && (\old(waterLevel) <= 1)) && (1 <= \old(pumpRunning))) || (((1 == systemActive) && (\old(pumpRunning) == 0)) && (\old(waterLevel) <= 2))) || (((1 == systemActive) && (1 <= \old(pumpRunning))) && (\old(waterLevel) == 2)))) && (((methaneLevelCritical == 0) || ((pumpRunning == 0) && (1 <= switchedOnBeforeTS))) || (\old(pumpRunning) < 1))) && ((((\old(pumpRunning) != 0) || ((1 <= pumpRunning) && (2 == waterLevel))) || ((pumpRunning == 0) && (2 == waterLevel))) || (\old(waterLevel) != 2))) && (((1 < \old(waterLevel)) || (waterLevel < 1)) || (\old(pumpRunning) < 1))) && (((1 < \old(waterLevel)) || (\old(pumpRunning) != 0)) || ((pumpRunning == 0) && (\old(waterLevel) == waterLevel)))) && (((\old(waterLevel) != 2) || (\old(pumpRunning) < 1)) || (waterLevel == 1))) && ((((pumpRunning == \old(pumpRunning)) && (1 <= switchedOnBeforeTS)) || (methaneLevelCritical != 0)) || (\old(pumpRunning) < 1))) && ((((methaneLevelCritical == \old(methaneLevelCritical)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 204]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((methaneLevelCritical == \old(methaneLevelCritical)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 354]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) Ensures: ((((((pumpRunning == \old(pumpRunning)) || (\old(pumpRunning) < 1)) && ((((1 <= pumpRunning) && (2 == waterLevel)) || ((pumpRunning == 0) && (2 == waterLevel))) || (waterLevel < 2))) && (((1 == systemActive) && (\old(pumpRunning) == 0)) || ((((methaneLevelCritical == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)))) && (((1 < waterLevel) || (0 < \old(pumpRunning))) || ((pumpRunning == 0) && (\old(pumpRunning) == 0)))) && ((((((waterLevel == \old(waterLevel)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 71]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) Ensures: ((((((2 == waterLevel) || (\old(waterLevel) != 2)) && (waterLevel <= ((long long) \old(waterLevel) + 1))) && ((((long long) \old(waterLevel) + 1) == waterLevel) || (2 == waterLevel))) && ((((((pumpRunning == 0) && (1 == systemActive)) && (\old(waterLevel) == 2)) || (((1 <= pumpRunning) && (1 == systemActive)) && (\old(waterLevel) == 2))) || (((pumpRunning == 0) && (1 == systemActive)) && (\old(waterLevel) <= 1))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (\old(waterLevel) <= 1)) && (1 <= switchedOnBeforeTS)))) && ((((((methaneLevelCritical == \old(methaneLevelCritical)) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 432]: Procedure Contract for isPumpRunning Derived contract for procedure isPumpRunning. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) Ensures: (((pumpRunning == \result) && (((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)))) && (((((((waterLevel == \old(waterLevel)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head)))) RESULT: Ultimate proved your program to be correct! [2024-11-11 20:56:21,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE