./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product64.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_product64.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 323b2112d56f35ec9fc5a7837411d8e54d2d46e3d8981d77e080eaf0dd99497b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:17:18,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:17:19,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:17:19,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:17:19,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:17:19,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:17:19,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:17:19,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:17:19,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:17:19,082 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:17:19,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:17:19,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:17:19,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:17:19,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:17:19,084 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:17:19,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:17:19,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:17:19,085 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:17:19,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:17:19,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:17:19,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:17:19,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:17:19,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:17:19,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:17:19,087 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:17:19,087 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:17:19,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:17:19,087 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:17:19,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:17:19,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:17:19,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:17:19,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:17:19,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:17:19,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:17:19,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:17:19,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:17:19,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:17:19,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:17:19,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:17:19,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:17:19,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:17:19,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:17:19,091 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 -> 323b2112d56f35ec9fc5a7837411d8e54d2d46e3d8981d77e080eaf0dd99497b [2024-11-08 15:17:19,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:17:19,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:17:19,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:17:19,318 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:17:19,318 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:17:19,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product64.cil.c [2024-11-08 15:17:20,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:17:20,761 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:17:20,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product64.cil.c [2024-11-08 15:17:20,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011c7d78d/000833b2860e4f038f84f46ace47ffa1/FLAG893e74e27 [2024-11-08 15:17:21,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011c7d78d/000833b2860e4f038f84f46ace47ffa1 [2024-11-08 15:17:21,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:17:21,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:17:21,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:17:21,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:17:21,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:17:21,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:17:21" (1/1) ... [2024-11-08 15:17:21,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd134c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:21, skipping insertion in model container [2024-11-08 15:17:21,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:17:21" (1/1) ... [2024-11-08 15:17:21,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:17:21,357 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_product64.cil.c[9626,9639] [2024-11-08 15:17:21,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:17:21,430 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:17:21,437 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [49] [2024-11-08 15:17:21,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [101] [2024-11-08 15:17:21,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [176] [2024-11-08 15:17:21,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [450] [2024-11-08 15:17:21,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [553] [2024-11-08 15:17:21,440 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [653] [2024-11-08 15:17:21,440 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [662] [2024-11-08 15:17:21,440 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [697] [2024-11-08 15:17:21,457 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_product64.cil.c[9626,9639] [2024-11-08 15:17:21,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:17:21,510 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:17:21,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:21 WrapperNode [2024-11-08 15:17:21,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:17:21,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:17:21,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:17:21,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:17:21,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:21" (1/1) ... [2024-11-08 15:17:21,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:21" (1/1) ... [2024-11-08 15:17:21,559 INFO L138 Inliner]: procedures = 61, calls = 110, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 249 [2024-11-08 15:17:21,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:17:21,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:17:21,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:17:21,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:17:21,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:21" (1/1) ... [2024-11-08 15:17:21,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:21" (1/1) ... [2024-11-08 15:17:21,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:21" (1/1) ... [2024-11-08 15:17:21,585 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-08 15:17:21,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:21" (1/1) ... [2024-11-08 15:17:21,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:21" (1/1) ... [2024-11-08 15:17:21,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:21" (1/1) ... [2024-11-08 15:17:21,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:21" (1/1) ... [2024-11-08 15:17:21,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:21" (1/1) ... [2024-11-08 15:17:21,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:21" (1/1) ... [2024-11-08 15:17:21,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:17:21,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:17:21,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:17:21,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:17:21,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:21" (1/1) ... [2024-11-08 15:17:21,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:17:21,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:17:21,633 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-08 15:17:21,641 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-08 15:17:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:17:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-08 15:17:21,682 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-08 15:17:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-08 15:17:21,682 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-08 15:17:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-08 15:17:21,682 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-08 15:17:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-08 15:17:21,682 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-08 15:17:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-08 15:17:21,683 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-08 15:17:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2024-11-08 15:17:21,683 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2024-11-08 15:17:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2024-11-08 15:17:21,684 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2024-11-08 15:17:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2024-11-08 15:17:21,684 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2024-11-08 15:17:21,684 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-08 15:17:21,684 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-08 15:17:21,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:17:21,685 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-08 15:17:21,685 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-08 15:17:21,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:17:21,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:17:21,759 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:17:21,761 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:17:22,035 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-11-08 15:17:22,036 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:17:22,046 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:17:22,046 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 15:17:22,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:17:22 BoogieIcfgContainer [2024-11-08 15:17:22,047 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:17:22,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:17:22,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:17:22,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:17:22,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:17:21" (1/3) ... [2024-11-08 15:17:22,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185da80e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:17:22, skipping insertion in model container [2024-11-08 15:17:22,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:21" (2/3) ... [2024-11-08 15:17:22,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185da80e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:17:22, skipping insertion in model container [2024-11-08 15:17:22,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:17:22" (3/3) ... [2024-11-08 15:17:22,053 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product64.cil.c [2024-11-08 15:17:22,065 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:17:22,065 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:17:22,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:17:22,112 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;@1aa1102c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:17:22,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:17:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 98 states have internal predecessors, (118), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (19), 14 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 15:17:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 15:17:22,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:22,124 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:17:22,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:22,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:22,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1423497268, now seen corresponding path program 1 times [2024-11-08 15:17:22,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:22,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214803399] [2024-11-08 15:17:22,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:22,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:22,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 15:17:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:22,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:17:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:22,290 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-08 15:17:22,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:22,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214803399] [2024-11-08 15:17:22,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214803399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:17:22,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:17:22,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:17:22,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746222682] [2024-11-08 15:17:22,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:17:22,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:17:22,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:22,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:17:22,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:17:22,316 INFO L87 Difference]: Start difference. First operand has 118 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 98 states have internal predecessors, (118), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (19), 14 states have call predecessors, (19), 19 states have call successors, (19) 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-08 15:17:22,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:22,342 INFO L93 Difference]: Finished difference Result 227 states and 306 transitions. [2024-11-08 15:17:22,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:17:22,344 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-08 15:17:22,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:22,352 INFO L225 Difference]: With dead ends: 227 [2024-11-08 15:17:22,352 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 15:17:22,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:17:22,358 INFO L432 NwaCegarLoop]: 150 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, 150 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-08 15:17:22,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:17:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 15:17:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-08 15:17:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.3) internal successors, (104), 90 states have internal predecessors, (104), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 15:17:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 141 transitions. [2024-11-08 15:17:22,391 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 141 transitions. Word has length 32 [2024-11-08 15:17:22,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:22,392 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 141 transitions. [2024-11-08 15:17:22,392 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-08 15:17:22,392 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 141 transitions. [2024-11-08 15:17:22,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 15:17:22,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:22,394 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:17:22,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:17:22,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:22,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:22,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1062885571, now seen corresponding path program 1 times [2024-11-08 15:17:22,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:22,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930523088] [2024-11-08 15:17:22,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:22,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:22,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:17:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:22,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:17:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:22,498 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-08 15:17:22,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:22,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930523088] [2024-11-08 15:17:22,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930523088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:17:22,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:17:22,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:17:22,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19118705] [2024-11-08 15:17:22,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:17:22,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:17:22,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:22,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:17:22,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:17:22,501 INFO L87 Difference]: Start difference. First operand 109 states and 141 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-08 15:17:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:22,532 INFO L93 Difference]: Finished difference Result 178 states and 230 transitions. [2024-11-08 15:17:22,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:17:22,533 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-08 15:17:22,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:22,534 INFO L225 Difference]: With dead ends: 178 [2024-11-08 15:17:22,534 INFO L226 Difference]: Without dead ends: 100 [2024-11-08 15:17:22,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:17:22,536 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 17 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 234 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-08 15:17:22,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 234 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:17:22,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-08 15:17:22,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-08 15:17:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 84 states have internal predecessors, (97), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 15:17:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 129 transitions. [2024-11-08 15:17:22,546 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 129 transitions. Word has length 33 [2024-11-08 15:17:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:22,547 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 129 transitions. [2024-11-08 15:17:22,547 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-08 15:17:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2024-11-08 15:17:22,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 15:17:22,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:22,548 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:17:22,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:17:22,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:22,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:22,549 INFO L85 PathProgramCache]: Analyzing trace with hash 214115468, now seen corresponding path program 1 times [2024-11-08 15:17:22,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:22,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080297568] [2024-11-08 15:17:22,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:22,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:22,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:17:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:22,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:17:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:22,667 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-08 15:17:22,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:22,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080297568] [2024-11-08 15:17:22,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080297568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:17:22,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:17:22,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:17:22,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986846446] [2024-11-08 15:17:22,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:17:22,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:17:22,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:22,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:17:22,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:17:22,669 INFO L87 Difference]: Start difference. First operand 100 states and 129 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (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-08 15:17:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:22,722 INFO L93 Difference]: Finished difference Result 239 states and 312 transitions. [2024-11-08 15:17:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:17:22,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (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 38 [2024-11-08 15:17:22,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:22,724 INFO L225 Difference]: With dead ends: 239 [2024-11-08 15:17:22,724 INFO L226 Difference]: Without dead ends: 147 [2024-11-08 15:17:22,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:17:22,725 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 118 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:22,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 478 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:17:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-08 15:17:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2024-11-08 15:17:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.3271028037383177) internal successors, (142), 120 states have internal predecessors, (142), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (23), 16 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-08 15:17:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 187 transitions. [2024-11-08 15:17:22,744 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 187 transitions. Word has length 38 [2024-11-08 15:17:22,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:22,745 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 187 transitions. [2024-11-08 15:17:22,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (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-08 15:17:22,749 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2024-11-08 15:17:22,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 15:17:22,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:22,750 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:17:22,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:17:22,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:22,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:22,751 INFO L85 PathProgramCache]: Analyzing trace with hash 384205224, now seen corresponding path program 1 times [2024-11-08 15:17:22,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:22,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488928526] [2024-11-08 15:17:22,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:22,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:22,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 15:17:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:22,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 15:17:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:22,899 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-08 15:17:22,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:22,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488928526] [2024-11-08 15:17:22,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488928526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:17:22,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:17:22,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:17:22,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54140319] [2024-11-08 15:17:22,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:17:22,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:17:22,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:22,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:17:22,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:17:22,903 INFO L87 Difference]: Start difference. First operand 144 states and 187 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:17:23,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:23,063 INFO L93 Difference]: Finished difference Result 328 states and 436 transitions. [2024-11-08 15:17:23,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:17:23,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2024-11-08 15:17:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:23,066 INFO L225 Difference]: With dead ends: 328 [2024-11-08 15:17:23,066 INFO L226 Difference]: Without dead ends: 192 [2024-11-08 15:17:23,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:17:23,069 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 65 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:23,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 539 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:17:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-08 15:17:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2024-11-08 15:17:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 143 states have (on average 1.2587412587412588) internal successors, (180), 155 states have internal predecessors, (180), 26 states have call successors, (26), 21 states have call predecessors, (26), 21 states have return successors, (34), 24 states have call predecessors, (34), 26 states have call successors, (34) [2024-11-08 15:17:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 240 transitions. [2024-11-08 15:17:23,100 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 240 transitions. Word has length 41 [2024-11-08 15:17:23,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:23,100 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 240 transitions. [2024-11-08 15:17:23,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:17:23,100 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 240 transitions. [2024-11-08 15:17:23,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 15:17:23,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:23,103 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:17:23,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:17:23,103 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:23,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:23,104 INFO L85 PathProgramCache]: Analyzing trace with hash -578050563, now seen corresponding path program 1 times [2024-11-08 15:17:23,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:23,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560248185] [2024-11-08 15:17:23,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:23,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:17:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 15:17:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 15:17:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,245 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-08 15:17:23,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:23,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560248185] [2024-11-08 15:17:23,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560248185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:17:23,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:17:23,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:17:23,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308489253] [2024-11-08 15:17:23,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:17:23,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:17:23,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:23,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:17:23,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:17:23,250 INFO L87 Difference]: Start difference. First operand 191 states and 240 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:17:23,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:23,437 INFO L93 Difference]: Finished difference Result 406 states and 524 transitions. [2024-11-08 15:17:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:17:23,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2024-11-08 15:17:23,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:23,439 INFO L225 Difference]: With dead ends: 406 [2024-11-08 15:17:23,439 INFO L226 Difference]: Without dead ends: 223 [2024-11-08 15:17:23,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:17:23,443 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 70 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:23,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 441 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:17:23,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-08 15:17:23,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2024-11-08 15:17:23,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 166 states have (on average 1.2469879518072289) internal successors, (207), 178 states have internal predecessors, (207), 28 states have call successors, (28), 21 states have call predecessors, (28), 26 states have return successors, (41), 30 states have call predecessors, (41), 28 states have call successors, (41) [2024-11-08 15:17:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 276 transitions. [2024-11-08 15:17:23,472 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 276 transitions. Word has length 65 [2024-11-08 15:17:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:23,472 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 276 transitions. [2024-11-08 15:17:23,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:17:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 276 transitions. [2024-11-08 15:17:23,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-08 15:17:23,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:23,477 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:17:23,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:17:23,477 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:23,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:23,478 INFO L85 PathProgramCache]: Analyzing trace with hash 783466595, now seen corresponding path program 1 times [2024-11-08 15:17:23,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:23,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933947067] [2024-11-08 15:17:23,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:23,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 15:17:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 15:17:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 15:17:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,564 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-08 15:17:23,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:23,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933947067] [2024-11-08 15:17:23,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933947067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:17:23,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:17:23,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:17:23,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013022448] [2024-11-08 15:17:23,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:17:23,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:17:23,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:23,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:17:23,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:17:23,572 INFO L87 Difference]: Start difference. First operand 221 states and 276 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 15:17:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:23,700 INFO L93 Difference]: Finished difference Result 438 states and 547 transitions. [2024-11-08 15:17:23,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:17:23,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 68 [2024-11-08 15:17:23,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:23,702 INFO L225 Difference]: With dead ends: 438 [2024-11-08 15:17:23,702 INFO L226 Difference]: Without dead ends: 225 [2024-11-08 15:17:23,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:17:23,703 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 107 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:23,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 282 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:17:23,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-08 15:17:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 221. [2024-11-08 15:17:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 166 states have (on average 1.2409638554216869) internal successors, (206), 178 states have internal predecessors, (206), 28 states have call successors, (28), 21 states have call predecessors, (28), 26 states have return successors, (39), 30 states have call predecessors, (39), 28 states have call successors, (39) [2024-11-08 15:17:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 273 transitions. [2024-11-08 15:17:23,720 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 273 transitions. Word has length 68 [2024-11-08 15:17:23,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:23,722 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 273 transitions. [2024-11-08 15:17:23,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 15:17:23,723 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 273 transitions. [2024-11-08 15:17:23,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 15:17:23,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:23,723 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:17:23,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:17:23,724 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:23,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:23,724 INFO L85 PathProgramCache]: Analyzing trace with hash 808152831, now seen corresponding path program 1 times [2024-11-08 15:17:23,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:23,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676352211] [2024-11-08 15:17:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:23,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:17:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 15:17:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 15:17:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:23,833 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-08 15:17:23,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:23,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676352211] [2024-11-08 15:17:23,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676352211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:17:23,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:17:23,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:17:23,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712285199] [2024-11-08 15:17:23,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:17:23,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:17:23,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:23,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:17:23,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:17:23,836 INFO L87 Difference]: Start difference. First operand 221 states and 273 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:17:23,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:23,953 INFO L93 Difference]: Finished difference Result 438 states and 554 transitions. [2024-11-08 15:17:23,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:17:23,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2024-11-08 15:17:23,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:23,955 INFO L225 Difference]: With dead ends: 438 [2024-11-08 15:17:23,956 INFO L226 Difference]: Without dead ends: 225 [2024-11-08 15:17:23,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:17:23,957 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 69 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:23,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 344 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:17:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-08 15:17:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2024-11-08 15:17:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 168 states have (on average 1.2380952380952381) internal successors, (208), 180 states have internal predecessors, (208), 28 states have call successors, (28), 21 states have call predecessors, (28), 26 states have return successors, (39), 30 states have call predecessors, (39), 28 states have call successors, (39) [2024-11-08 15:17:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 275 transitions. [2024-11-08 15:17:23,976 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 275 transitions. Word has length 65 [2024-11-08 15:17:23,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:23,979 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 275 transitions. [2024-11-08 15:17:23,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:17:23,979 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 275 transitions. [2024-11-08 15:17:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 15:17:23,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:23,980 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:17:23,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:17:23,980 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:23,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:23,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1509752705, now seen corresponding path program 1 times [2024-11-08 15:17:23,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:23,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927628327] [2024-11-08 15:17:23,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:23,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:24,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:17:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:24,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 15:17:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:24,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:24,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:24,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 15:17:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:24,048 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-08 15:17:24,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:24,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927628327] [2024-11-08 15:17:24,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927628327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:17:24,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:17:24,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:17:24,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137161609] [2024-11-08 15:17:24,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:17:24,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:17:24,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:24,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:17:24,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:17:24,051 INFO L87 Difference]: Start difference. First operand 223 states and 275 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 15:17:24,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:24,248 INFO L93 Difference]: Finished difference Result 661 states and 844 transitions. [2024-11-08 15:17:24,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:17:24,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 65 [2024-11-08 15:17:24,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:24,251 INFO L225 Difference]: With dead ends: 661 [2024-11-08 15:17:24,251 INFO L226 Difference]: Without dead ends: 446 [2024-11-08 15:17:24,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:17:24,252 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 259 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:24,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 363 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:17:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-08 15:17:24,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 444. [2024-11-08 15:17:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 334 states have (on average 1.2125748502994012) internal successors, (405), 354 states have internal predecessors, (405), 59 states have call successors, (59), 48 states have call predecessors, (59), 50 states have return successors, (86), 59 states have call predecessors, (86), 59 states have call successors, (86) [2024-11-08 15:17:24,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 550 transitions. [2024-11-08 15:17:24,281 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 550 transitions. Word has length 65 [2024-11-08 15:17:24,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:24,281 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 550 transitions. [2024-11-08 15:17:24,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 15:17:24,282 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 550 transitions. [2024-11-08 15:17:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 15:17:24,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:24,282 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:17:24,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:17:24,283 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:24,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:24,283 INFO L85 PathProgramCache]: Analyzing trace with hash 920584039, now seen corresponding path program 1 times [2024-11-08 15:17:24,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:24,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735564230] [2024-11-08 15:17:24,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:24,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:24,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:24,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:17:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:24,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:17:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:24,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:24,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:24,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 15:17:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:24,460 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-08 15:17:24,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:24,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735564230] [2024-11-08 15:17:24,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735564230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:17:24,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:17:24,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 15:17:24,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171262748] [2024-11-08 15:17:24,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:17:24,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 15:17:24,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:24,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 15:17:24,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:17:24,462 INFO L87 Difference]: Start difference. First operand 444 states and 550 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 15:17:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:25,017 INFO L93 Difference]: Finished difference Result 1289 states and 1651 transitions. [2024-11-08 15:17:25,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 15:17:25,018 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 69 [2024-11-08 15:17:25,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:25,023 INFO L225 Difference]: With dead ends: 1289 [2024-11-08 15:17:25,023 INFO L226 Difference]: Without dead ends: 946 [2024-11-08 15:17:25,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-11-08 15:17:25,026 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 573 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:25,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 583 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:17:25,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2024-11-08 15:17:25,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 822. [2024-11-08 15:17:25,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 617 states have (on average 1.2106969205834683) internal successors, (747), 658 states have internal predecessors, (747), 109 states have call successors, (109), 83 states have call predecessors, (109), 95 states have return successors, (160), 110 states have call predecessors, (160), 109 states have call successors, (160) [2024-11-08 15:17:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1016 transitions. [2024-11-08 15:17:25,081 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1016 transitions. Word has length 69 [2024-11-08 15:17:25,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:25,081 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1016 transitions. [2024-11-08 15:17:25,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 15:17:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1016 transitions. [2024-11-08 15:17:25,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 15:17:25,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:25,084 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:17:25,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:17:25,084 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:25,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:25,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1227003405, now seen corresponding path program 1 times [2024-11-08 15:17:25,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:25,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535525638] [2024-11-08 15:17:25,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:25,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:25,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:25,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:17:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:25,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:25,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:17:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:25,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:25,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:25,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 15:17:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:25,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:17:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:25,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 15:17:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:25,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 15:17:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:25,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:25,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 15:17:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 15:17:25,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:25,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535525638] [2024-11-08 15:17:25,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535525638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:17:25,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505105863] [2024-11-08 15:17:25,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:25,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:17:25,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:17:25,276 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-08 15:17:25,277 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-08 15:17:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:25,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:17:25,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:17:25,519 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 31 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:17:25,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:17:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 15:17:25,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505105863] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:17:25,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:17:25,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2024-11-08 15:17:25,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725644318] [2024-11-08 15:17:25,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:17:25,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 15:17:25,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:25,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 15:17:25,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:17:25,715 INFO L87 Difference]: Start difference. First operand 822 states and 1016 transitions. Second operand has 16 states, 16 states have (on average 9.0625) internal successors, (145), 11 states have internal predecessors, (145), 5 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (23), 7 states have call predecessors, (23), 5 states have call successors, (23) [2024-11-08 15:17:26,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:26,805 INFO L93 Difference]: Finished difference Result 1858 states and 2365 transitions. [2024-11-08 15:17:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-08 15:17:26,805 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.0625) internal successors, (145), 11 states have internal predecessors, (145), 5 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (23), 7 states have call predecessors, (23), 5 states have call successors, (23) Word has length 123 [2024-11-08 15:17:26,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:26,811 INFO L225 Difference]: With dead ends: 1858 [2024-11-08 15:17:26,811 INFO L226 Difference]: Without dead ends: 1133 [2024-11-08 15:17:26,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 274 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=400, Invalid=1762, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 15:17:26,814 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 351 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:26,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1599 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 15:17:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2024-11-08 15:17:26,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 919. [2024-11-08 15:17:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 682 states have (on average 1.187683284457478) internal successors, (810), 735 states have internal predecessors, (810), 126 states have call successors, (126), 104 states have call predecessors, (126), 110 states have return successors, (159), 116 states have call predecessors, (159), 126 states have call successors, (159) [2024-11-08 15:17:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1095 transitions. [2024-11-08 15:17:26,862 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1095 transitions. Word has length 123 [2024-11-08 15:17:26,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:26,863 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1095 transitions. [2024-11-08 15:17:26,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.0625) internal successors, (145), 11 states have internal predecessors, (145), 5 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (23), 7 states have call predecessors, (23), 5 states have call successors, (23) [2024-11-08 15:17:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1095 transitions. [2024-11-08 15:17:26,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 15:17:26,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:26,867 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:17:26,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 15:17:27,067 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-08 15:17:27,068 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:27,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:27,068 INFO L85 PathProgramCache]: Analyzing trace with hash 238833209, now seen corresponding path program 1 times [2024-11-08 15:17:27,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:27,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419253538] [2024-11-08 15:17:27,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:27,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:17:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:17:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 15:17:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:17:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 15:17:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 15:17:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:17:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 15:17:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 15:17:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-08 15:17:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 96 proven. 45 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-08 15:17:27,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:27,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419253538] [2024-11-08 15:17:27,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419253538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:17:27,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405345974] [2024-11-08 15:17:27,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:27,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:17:27,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:17:27,509 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-08 15:17:27,510 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-08 15:17:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:27,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 15:17:27,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:17:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 167 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 15:17:27,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:17:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 81 proven. 39 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-08 15:17:28,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405345974] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:17:28,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:17:28,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 11] total 30 [2024-11-08 15:17:28,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177014245] [2024-11-08 15:17:28,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:17:28,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 15:17:28,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:28,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 15:17:28,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2024-11-08 15:17:28,251 INFO L87 Difference]: Start difference. First operand 919 states and 1095 transitions. Second operand has 30 states, 30 states have (on average 7.933333333333334) internal successors, (238), 23 states have internal predecessors, (238), 10 states have call successors, (40), 8 states have call predecessors, (40), 12 states have return successors, (44), 12 states have call predecessors, (44), 10 states have call successors, (44) [2024-11-08 15:17:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:30,556 INFO L93 Difference]: Finished difference Result 2747 states and 3403 transitions. [2024-11-08 15:17:30,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-08 15:17:30,557 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.933333333333334) internal successors, (238), 23 states have internal predecessors, (238), 10 states have call successors, (40), 8 states have call predecessors, (40), 12 states have return successors, (44), 12 states have call predecessors, (44), 10 states have call successors, (44) Word has length 215 [2024-11-08 15:17:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:30,564 INFO L225 Difference]: With dead ends: 2747 [2024-11-08 15:17:30,564 INFO L226 Difference]: Without dead ends: 1836 [2024-11-08 15:17:30,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 473 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1300, Invalid=7072, Unknown=0, NotChecked=0, Total=8372 [2024-11-08 15:17:30,568 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1778 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 3076 mSolverCounterSat, 776 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1778 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 3852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 776 IncrementalHoareTripleChecker+Valid, 3076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:30,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1778 Valid, 1577 Invalid, 3852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [776 Valid, 3076 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 15:17:30,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2024-11-08 15:17:30,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1785. [2024-11-08 15:17:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1337 states have (on average 1.1368735976065818) internal successors, (1520), 1417 states have internal predecessors, (1520), 247 states have call successors, (247), 211 states have call predecessors, (247), 200 states have return successors, (280), 214 states have call predecessors, (280), 247 states have call successors, (280) [2024-11-08 15:17:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2047 transitions. [2024-11-08 15:17:30,700 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2047 transitions. Word has length 215 [2024-11-08 15:17:30,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:30,700 INFO L471 AbstractCegarLoop]: Abstraction has 1785 states and 2047 transitions. [2024-11-08 15:17:30,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.933333333333334) internal successors, (238), 23 states have internal predecessors, (238), 10 states have call successors, (40), 8 states have call predecessors, (40), 12 states have return successors, (44), 12 states have call predecessors, (44), 10 states have call successors, (44) [2024-11-08 15:17:30,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2047 transitions. [2024-11-08 15:17:30,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-08 15:17:30,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:30,706 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:17:30,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 15:17:30,907 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-08 15:17:30,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:30,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:30,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1449036705, now seen corresponding path program 1 times [2024-11-08 15:17:30,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:30,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928645220] [2024-11-08 15:17:30,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:30,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:17:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:17:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 15:17:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:17:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 15:17:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 15:17:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 15:17:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 15:17:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:17:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 15:17:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 15:17:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-08 15:17:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-08 15:17:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-08 15:17:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-08 15:17:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,213 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 100 proven. 50 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-08 15:17:31,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:31,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928645220] [2024-11-08 15:17:31,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928645220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:17:31,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111991535] [2024-11-08 15:17:31,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:31,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:17:31,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:17:31,215 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-08 15:17:31,217 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-08 15:17:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:31,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 15:17:31,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:17:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 211 proven. 11 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-08 15:17:31,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:17:31,914 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 106 proven. 62 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-08 15:17:31,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111991535] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:17:31,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:17:31,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 23 [2024-11-08 15:17:31,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406801278] [2024-11-08 15:17:31,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:17:31,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 15:17:31,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:31,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 15:17:31,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-11-08 15:17:31,918 INFO L87 Difference]: Start difference. First operand 1785 states and 2047 transitions. Second operand has 23 states, 23 states have (on average 10.956521739130435) internal successors, (252), 16 states have internal predecessors, (252), 6 states have call successors, (54), 8 states have call predecessors, (54), 11 states have return successors, (47), 9 states have call predecessors, (47), 6 states have call successors, (47) [2024-11-08 15:17:33,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:33,123 INFO L93 Difference]: Finished difference Result 3492 states and 4018 transitions. [2024-11-08 15:17:33,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 15:17:33,123 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.956521739130435) internal successors, (252), 16 states have internal predecessors, (252), 6 states have call successors, (54), 8 states have call predecessors, (54), 11 states have return successors, (47), 9 states have call predecessors, (47), 6 states have call successors, (47) Word has length 239 [2024-11-08 15:17:33,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:33,130 INFO L225 Difference]: With dead ends: 3492 [2024-11-08 15:17:33,131 INFO L226 Difference]: Without dead ends: 1893 [2024-11-08 15:17:33,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 530 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=399, Invalid=1857, Unknown=0, NotChecked=0, Total=2256 [2024-11-08 15:17:33,134 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 459 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 2407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:33,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 549 Invalid, 2407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 15:17:33,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2024-11-08 15:17:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1726. [2024-11-08 15:17:33,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1298 states have (on average 1.1317411402157165) internal successors, (1469), 1368 states have internal predecessors, (1469), 224 states have call successors, (224), 206 states have call predecessors, (224), 203 states have return successors, (257), 207 states have call predecessors, (257), 224 states have call successors, (257) [2024-11-08 15:17:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 1950 transitions. [2024-11-08 15:17:33,219 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 1950 transitions. Word has length 239 [2024-11-08 15:17:33,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:33,219 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 1950 transitions. [2024-11-08 15:17:33,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.956521739130435) internal successors, (252), 16 states have internal predecessors, (252), 6 states have call successors, (54), 8 states have call predecessors, (54), 11 states have return successors, (47), 9 states have call predecessors, (47), 6 states have call successors, (47) [2024-11-08 15:17:33,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 1950 transitions. [2024-11-08 15:17:33,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-08 15:17:33,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:33,224 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:17:33,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 15:17:33,424 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-08 15:17:33,425 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:33,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:33,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1667126754, now seen corresponding path program 1 times [2024-11-08 15:17:33,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:33,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755919238] [2024-11-08 15:17:33,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:33,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:17:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:17:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 15:17:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:17:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-08 15:17:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 15:17:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 15:17:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 15:17:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:17:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 15:17:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-08 15:17:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-08 15:17:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:17:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-08 15:17:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-08 15:17:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 120 proven. 43 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-08 15:17:33,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:33,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755919238] [2024-11-08 15:17:33,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755919238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:17:33,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547747734] [2024-11-08 15:17:33,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:33,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:17:33,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:17:33,888 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-08 15:17:33,889 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-08 15:17:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:34,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 15:17:34,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:17:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 151 proven. 26 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-08 15:17:34,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:17:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 107 proven. 45 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-08 15:17:34,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547747734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:17:34,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:17:34,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 13] total 25 [2024-11-08 15:17:34,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197121278] [2024-11-08 15:17:34,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:17:34,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 15:17:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:34,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 15:17:34,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2024-11-08 15:17:34,680 INFO L87 Difference]: Start difference. First operand 1726 states and 1950 transitions. Second operand has 25 states, 25 states have (on average 10.76) internal successors, (269), 21 states have internal predecessors, (269), 16 states have call successors, (56), 11 states have call predecessors, (56), 14 states have return successors, (51), 16 states have call predecessors, (51), 16 states have call successors, (51) [2024-11-08 15:17:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:36,032 INFO L93 Difference]: Finished difference Result 3368 states and 3897 transitions. [2024-11-08 15:17:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-08 15:17:36,033 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.76) internal successors, (269), 21 states have internal predecessors, (269), 16 states have call successors, (56), 11 states have call predecessors, (56), 14 states have return successors, (51), 16 states have call predecessors, (51), 16 states have call successors, (51) Word has length 240 [2024-11-08 15:17:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:36,035 INFO L225 Difference]: With dead ends: 3368 [2024-11-08 15:17:36,036 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 15:17:36,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 529 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1003, Invalid=3419, Unknown=0, NotChecked=0, Total=4422 [2024-11-08 15:17:36,041 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 769 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 2258 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 2541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 2258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:36,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 770 Invalid, 2541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 2258 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 15:17:36,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 15:17:36,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 15:17:36,042 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-08 15:17:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 15:17:36,043 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 240 [2024-11-08 15:17:36,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:36,043 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 15:17:36,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.76) internal successors, (269), 21 states have internal predecessors, (269), 16 states have call successors, (56), 11 states have call predecessors, (56), 14 states have return successors, (51), 16 states have call predecessors, (51), 16 states have call successors, (51) [2024-11-08 15:17:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 15:17:36,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 15:17:36,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:17:36,059 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-08 15:17:36,246 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-08 15:17:36,248 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:17:36,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 15:17:49,787 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:17:49,804 WARN L156 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (<= ~waterLevel~0 2)) (.cse1 (<= 1 |old(~pumpRunning~0)|)) (.cse2 (not (= 0 ~systemActive~0)))) (or (and .cse0 (<= 1 ~switchedOnBeforeTS~0) .cse1 .cse2) (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2)))) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (not (= 0 ~systemActive~0)))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and .cse0 (<= ~waterLevel~0 2) (<= 1 ~switchedOnBeforeTS~0) .cse1))) [2024-11-08 15:17:49,815 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse2 (= ~pumpRunning~0 0))) (and (= |old(~methaneLevelCritical~0)| ~methaneLevelCritical~0) (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (not (= 0 ~systemActive~0)))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and .cse2 (<= ~waterLevel~0 2)) (and .cse0 (<= ~waterLevel~0 1) (<= 1 ~switchedOnBeforeTS~0) .cse1))) (or .cse2 (= |old(~methaneLevelCritical~0)| 0)))) Eliminated clause: (let ((.cse2 (= ~pumpRunning~0 0))) (and (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (not (= 0 ~systemActive~0)))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and .cse2 (<= ~waterLevel~0 2)) (and .cse0 (<= ~waterLevel~0 1) (<= 1 ~switchedOnBeforeTS~0) .cse1))) (or .cse2 (= ~methaneLevelCritical~0 0)))) [2024-11-08 15:17:49,819 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|) (let ((.cse0 (<= 1 |old(~pumpRunning~0)|)) (.cse1 (not (= 0 ~systemActive~0)))) (or (and .cse0 .cse1 (= |old(~waterLevel~0)| 2)) (and (<= 1 |old(~switchedOnBeforeTS~0)|) (<= |old(~waterLevel~0)| 1) .cse0 .cse1) (and (= |old(~pumpRunning~0)| 0) (<= |old(~waterLevel~0)| 2)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (not (= 0 ~systemActive~0)))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and (= ~pumpRunning~0 0) (<= ~waterLevel~0 2)) (and .cse0 (<= ~waterLevel~0 1) (<= 1 ~switchedOnBeforeTS~0) .cse1))) [2024-11-08 15:17:49,840 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (not (= 0 ~systemActive~0)))) (or (and (= |old(~pumpRunning~0)| 0) (<= ~waterLevel~0 2) .cse0) (and (= ~methaneLevelCritical~0 0) (<= ~waterLevel~0 1) (<= 1 ~switchedOnBeforeTS~0) (<= 1 |old(~pumpRunning~0)|) .cse0)))) Eliminated clause: (let ((.cse0 (not (= 0 ~systemActive~0)))) (or (and (= ~pumpRunning~0 0) (<= ~waterLevel~0 2) .cse0) (and (<= 1 ~pumpRunning~0) (= ~methaneLevelCritical~0 0) (<= ~waterLevel~0 1) (<= 1 ~switchedOnBeforeTS~0) .cse0))) [2024-11-08 15:17:49,845 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse0 (= ~pumpRunning~0 0)) (.cse5 (= |old(~waterLevel~0)| 2)) (.cse2 (<= 1 ~pumpRunning~0)) (.cse3 (= ~methaneLevelCritical~0 0)) (.cse1 (<= |old(~waterLevel~0)| 1)) (.cse4 (not (= 0 ~systemActive~0)))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse5) (and .cse2 .cse3 .cse1 (<= 1 ~switchedOnBeforeTS~0) .cse4)))) Eliminated clause: (let ((.cse2 (<= 1 ~pumpRunning~0)) (.cse1 (= 2 ~waterLevel~0)) (.cse3 (= ~methaneLevelCritical~0 0)) (.cse5 (not (= 0 ~systemActive~0))) (.cse0 (= ~pumpRunning~0 0)) (.cse4 (<= ~waterLevel~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 (<= 1 ~switchedOnBeforeTS~0) .cse5) (and .cse2 .cse1 .cse3 .cse5) (and .cse0 .cse4))) [2024-11-08 15:17:49,850 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__methaneQuery contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (not (= 0 ~systemActive~0)))) (or (and (= |old(~pumpRunning~0)| 0) (<= ~waterLevel~0 2) .cse0) (and (= ~methaneLevelCritical~0 0) (<= ~waterLevel~0 1) (<= 1 ~switchedOnBeforeTS~0) (<= 1 |old(~pumpRunning~0)|) .cse0)))) Eliminated clause: (let ((.cse0 (not (= 0 ~systemActive~0)))) (or (and (= ~pumpRunning~0 0) (<= ~waterLevel~0 2) .cse0) (and (<= 1 ~pumpRunning~0) (= ~methaneLevelCritical~0 0) (<= ~waterLevel~0 1) (<= 1 ~switchedOnBeforeTS~0) .cse0))) [2024-11-08 15:17:49,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:17:49 BoogieIcfgContainer [2024-11-08 15:17:49,856 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:17:49,857 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:17:49,857 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:17:49,857 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:17:49,857 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:17:22" (3/4) ... [2024-11-08 15:17:49,860 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 15:17:49,863 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-11-08 15:17:49,863 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-08 15:17:49,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-08 15:17:49,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-08 15:17:49,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-08 15:17:49,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-11-08 15:17:49,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-08 15:17:49,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__methaneQuery [2024-11-08 15:17:49,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2024-11-08 15:17:49,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneAlarm [2024-11-08 15:17:49,870 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-08 15:17:49,871 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-08 15:17:49,871 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 15:17:49,872 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:17:49,872 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:17:49,961 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:17:49,961 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 15:17:49,961 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:17:49,961 INFO L158 Benchmark]: Toolchain (without parser) took 28834.30ms. Allocated memory was 159.4MB in the beginning and 545.3MB in the end (delta: 385.9MB). Free memory was 105.3MB in the beginning and 482.6MB in the end (delta: -377.3MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-11-08 15:17:49,962 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:17:49,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.48ms. Allocated memory is still 159.4MB. Free memory was 105.3MB in the beginning and 83.0MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 15:17:49,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.33ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 80.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:17:49,962 INFO L158 Benchmark]: Boogie Preprocessor took 42.27ms. Allocated memory is still 159.4MB. Free memory was 80.5MB in the beginning and 78.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:17:49,962 INFO L158 Benchmark]: RCFGBuilder took 443.32ms. Allocated memory is still 159.4MB. Free memory was 78.0MB in the beginning and 117.1MB in the end (delta: -39.1MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-11-08 15:17:49,962 INFO L158 Benchmark]: TraceAbstraction took 27808.35ms. Allocated memory was 159.4MB in the beginning and 545.3MB in the end (delta: 385.9MB). Free memory was 116.3MB in the beginning and 491.0MB in the end (delta: -374.7MB). Peak memory consumption was 323.4MB. Max. memory is 16.1GB. [2024-11-08 15:17:49,962 INFO L158 Benchmark]: Witness Printer took 104.28ms. Allocated memory is still 545.3MB. Free memory was 491.0MB in the beginning and 482.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 15:17:49,963 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.48ms. Allocated memory is still 159.4MB. Free memory was 105.3MB in the beginning and 83.0MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.33ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 80.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.27ms. Allocated memory is still 159.4MB. Free memory was 80.5MB in the beginning and 78.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 443.32ms. Allocated memory is still 159.4MB. Free memory was 78.0MB in the beginning and 117.1MB in the end (delta: -39.1MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * TraceAbstraction took 27808.35ms. Allocated memory was 159.4MB in the beginning and 545.3MB in the end (delta: 385.9MB). Free memory was 116.3MB in the beginning and 491.0MB in the end (delta: -374.7MB). Peak memory consumption was 323.4MB. Max. memory is 16.1GB. * Witness Printer took 104.28ms. Allocated memory is still 545.3MB. Free memory was 491.0MB in the beginning and 482.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,"Specification5_spec.i","") [49] - GenericResultAtLocation [Line: 101]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [101] - GenericResultAtLocation [Line: 176]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [176] - GenericResultAtLocation [Line: 450]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [450] - GenericResultAtLocation [Line: 553]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [553] - GenericResultAtLocation [Line: 653]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [653] - GenericResultAtLocation [Line: 662]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [662] - GenericResultAtLocation [Line: 697]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [697] * 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: 658]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.2s, OverallIterations: 13, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4697 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4635 mSDsluCounter, 7909 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6324 mSDsCounter, 1686 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10270 IncrementalHoareTripleChecker+Invalid, 11956 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1686 mSolverCounterUnsat, 1585 mSDtfsCounter, 10270 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2212 GetRequests, 1898 SyntacticMatches, 16 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4300 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1785occurred in iteration=11, InterpolantAutomatonStates: 240, 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, 570 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2110 NumberOfCodeBlocks, 2110 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2906 ConstructedInterpolants, 0 QuantifiedInterpolants, 6179 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2348 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 21 InterpolantComputations, 9 PerfectInterpolantSequences, 2178/2535 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: 565]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: (((((((((1 <= pumpRunning) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (splverifierCounter == 0)) && (0 != systemActive)) || (((pumpRunning == 0) && (splverifierCounter == 0)) && (waterLevel == 1))) || (((pumpRunning == 0) && (2 == waterLevel)) && (splverifierCounter == 0))) || (((pumpRunning == 0) && (splverifierCounter == 0)) && (waterLevel <= 0))) || ((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (splverifierCounter == 0)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) - ProcedureContractResult [Line: 325]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: ((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || ((((1 <= pumpRunning) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) Ensures: (((pumpRunning == 0) && (((((waterLevel <= 2) && (1 <= switchedOnBeforeTS)) && (1 <= \old(pumpRunning))) && (0 != systemActive)) || (((2 == waterLevel) && (1 <= \old(pumpRunning))) && (0 != systemActive)))) && ((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 215]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((pumpRunning == 0) && (waterLevel <= 2)) && (0 != systemActive)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) Ensures: (((((pumpRunning == 0) && (waterLevel <= 2)) && (0 != systemActive)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) && (((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 477]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || ((pumpRunning == 0) && (waterLevel <= 2))) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) && ((pumpRunning == 0) || (methaneLevelCritical == 0))) Ensures: ((((((((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) || ((1 <= pumpRunning) && (2 == waterLevel))) || ((pumpRunning == 0) && (waterLevel <= 2))) && ((pumpRunning < 1) || (methaneLevelCritical != 0))) && ((methaneLevelCritical == 0) || (\old(methaneLevelCritical) == 0))) && ((pumpRunning == 0) || (0 != systemActive))) && ((\old(methaneLevelCritical) != 0) || (methaneLevelCritical != 0))) && ((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 555]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((systemActive == \old(systemActive)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 188]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || ((pumpRunning == 0) && (waterLevel <= 2))) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) Ensures: (((((((((((((1 < \old(waterLevel)) || (methaneLevelCritical == 0)) || ((((pumpRunning == 0) && (waterLevel <= 0)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || (\old(pumpRunning) < 1)) && ((((\old(pumpRunning) != 0) || ((1 <= pumpRunning) && (2 == waterLevel))) || ((pumpRunning == 0) && (2 == waterLevel))) || (\old(waterLevel) != 2))) && (((pumpRunning == 0) && (\old(waterLevel) == waterLevel)) || (0 != systemActive))) && ((((((pumpRunning == \old(pumpRunning)) && (\old(waterLevel) == waterLevel)) && (1 <= switchedOnBeforeTS)) || (0 < \old(waterLevel))) || (\old(pumpRunning) < 1)) || (((pumpRunning == 0) && (\old(waterLevel) == waterLevel)) && (1 <= switchedOnBeforeTS)))) && (((((((pumpRunning == \old(pumpRunning)) && (methaneLevelCritical == 0)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS)) || (\old(waterLevel) != 2)) || (\old(pumpRunning) < 1)) || (((pumpRunning == 0) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS)))) && ((((\old(pumpRunning) != 0) || (methaneLevelCritical == 0)) || ((pumpRunning == 0) && (2 == waterLevel))) || (\old(waterLevel) != 2))) && (((1 < \old(waterLevel)) || (\old(pumpRunning) != 0)) || ((pumpRunning == 0) && (\old(waterLevel) == waterLevel)))) && ((((((1 <= \old(switchedOnBeforeTS)) && (\old(waterLevel) <= 1)) && (1 <= \old(pumpRunning))) && (0 != systemActive)) || ((1 <= \old(pumpRunning)) && (\old(waterLevel) == 2))) || ((\old(pumpRunning) == 0) && (\old(waterLevel) <= 2)))) && ((((\old(waterLevel) != 1) || ((((pumpRunning == 0) && (waterLevel <= 0)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || (((pumpRunning == \old(pumpRunning)) && (waterLevel <= 0)) && (1 <= switchedOnBeforeTS))) || (\old(pumpRunning) < 1))) && ((((systemActive == \old(systemActive)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 223]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((((pumpRunning == 0) && (waterLevel <= 2)) && (0 != systemActive)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) Ensures: (((((((pumpRunning == \old(pumpRunning)) || (\old(pumpRunning) < 1)) && ((0 < pumpRunning) || (pumpRunning == 0))) && ((((\old(pumpRunning) == 0) && (waterLevel <= 2)) && (0 != systemActive)) || (((waterLevel <= 1) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)))) && ((pumpRunning == 0) || (methaneLevelCritical == 0))) && (((1 < waterLevel) || (0 < \old(pumpRunning))) || ((pumpRunning == 0) && (\old(pumpRunning) == 0)))) && ((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 465]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((((pumpRunning == 0) && (2 == waterLevel)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (0 != systemActive))) || ((pumpRunning == 0) && (waterLevel <= 1))) Ensures: ((((((((long long) \old(waterLevel) + 1) == waterLevel) || (0 < \old(waterLevel))) && ((2 == waterLevel) || (\old(waterLevel) != 2))) && ((2 == waterLevel) || (\old(waterLevel) != 1))) && (((((pumpRunning == 0) && (\old(waterLevel) <= 1)) || ((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (0 != systemActive)) && (\old(waterLevel) == 2))) || ((pumpRunning == 0) && (\old(waterLevel) == 2))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (\old(waterLevel) <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)))) && ((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 249]: Procedure Contract for processEnvironment__wrappee__methaneQuery Derived contract for procedure processEnvironment__wrappee__methaneQuery. Requires: ((((pumpRunning == 0) && (waterLevel <= 2)) && (0 != systemActive)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) Ensures: (((((((((0 < pumpRunning) || ((pumpRunning == 0) && (2 == waterLevel))) || ((waterLevel <= 1) && (\old(pumpRunning) == 0))) || (0 < \old(pumpRunning))) && (((pumpRunning == \old(pumpRunning)) || (pumpRunning == 0)) || (0 < waterLevel))) && (((waterLevel != 1) || (pumpRunning == \old(pumpRunning))) || (pumpRunning == 0))) && ((((\old(pumpRunning) == 0) && (waterLevel <= 2)) && (0 != systemActive)) || ((((methaneLevelCritical == 0) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)))) && ((pumpRunning == 0) || (methaneLevelCritical == 0))) && ((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 344]: Procedure Contract for isPumpRunning Derived contract for procedure isPumpRunning. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || ((pumpRunning == 0) && (waterLevel <= 2))) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) Ensures: (((((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || ((pumpRunning == 0) && (waterLevel <= 2))) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) && (pumpRunning == \result)) && (((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 333]: Procedure Contract for isMethaneAlarm Derived contract for procedure isMethaneAlarm. Requires: ((((pumpRunning == 0) && (2 == waterLevel)) && (0 != systemActive)) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) Ensures: (((methaneLevelCritical == \result) && ((((pumpRunning == 0) && (2 == waterLevel)) && (0 != systemActive)) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)))) && (((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) RESULT: Ultimate proved your program to be correct! [2024-11-08 15:17:49,991 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