./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product34.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec3_product34.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 750fa47004e8b71818a419cd0705c167dc764081be79a2bed3ff642b9979f0ab --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:54:08,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:54:08,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:54:08,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:54:08,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:54:08,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:54:08,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:54:08,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:54:08,710 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:54:08,710 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:54:08,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:54:08,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:54:08,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:54:08,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:54:08,713 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:54:08,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:54:08,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:54:08,715 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:54:08,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:54:08,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:54:08,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:54:08,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:54:08,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:54:08,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:54:08,717 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:54:08,718 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:54:08,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:54:08,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:54:08,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:54:08,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:54:08,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:54:08,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:54:08,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:54:08,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:54:08,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:54:08,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:54:08,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:54:08,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:54:08,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:54:08,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:54:08,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:54:08,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:54:08,723 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 -> 750fa47004e8b71818a419cd0705c167dc764081be79a2bed3ff642b9979f0ab [2024-11-11 20:54:08,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:54:09,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:54:09,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:54:09,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:54:09,014 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:54:09,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product34.cil.c [2024-11-11 20:54:10,449 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:54:10,738 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:54:10,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product34.cil.c [2024-11-11 20:54:10,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a4cda927/c8a94cf70f91412ca0c64c01a8f53b9d/FLAG14b95bc7f [2024-11-11 20:54:10,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a4cda927/c8a94cf70f91412ca0c64c01a8f53b9d [2024-11-11 20:54:10,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:54:10,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:54:10,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:54:10,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:54:10,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:54:10,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:54:10" (1/1) ... [2024-11-11 20:54:10,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cc677a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:10, skipping insertion in model container [2024-11-11 20:54:10,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:54:10" (1/1) ... [2024-11-11 20:54:10,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:54:11,067 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_spec3_product34.cil.c[16171,16184] [2024-11-11 20:54:11,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:54:11,094 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:54:11,103 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2024-11-11 20:54:11,104 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [121] [2024-11-11 20:54:11,105 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [221] [2024-11-11 20:54:11,105 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [389] [2024-11-11 20:54:11,105 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [755] [2024-11-11 20:54:11,105 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [791] [2024-11-11 20:54:11,105 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [800] [2024-11-11 20:54:11,106 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [894] [2024-11-11 20:54:11,184 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_spec3_product34.cil.c[16171,16184] [2024-11-11 20:54:11,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:54:11,221 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:54:11,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:11 WrapperNode [2024-11-11 20:54:11,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:54:11,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:54:11,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:54:11,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:54:11,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:11" (1/1) ... [2024-11-11 20:54:11,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:11" (1/1) ... [2024-11-11 20:54:11,268 INFO L138 Inliner]: procedures = 53, calls = 95, calls flagged for inlining = 21, calls inlined = 18, statements flattened = 179 [2024-11-11 20:54:11,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:54:11,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:54:11,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:54:11,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:54:11,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:11" (1/1) ... [2024-11-11 20:54:11,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:11" (1/1) ... [2024-11-11 20:54:11,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:11" (1/1) ... [2024-11-11 20:54:11,316 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 20:54:11,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:11" (1/1) ... [2024-11-11 20:54:11,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:11" (1/1) ... [2024-11-11 20:54:11,320 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:11" (1/1) ... [2024-11-11 20:54:11,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:11" (1/1) ... [2024-11-11 20:54:11,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:11" (1/1) ... [2024-11-11 20:54:11,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:11" (1/1) ... [2024-11-11 20:54:11,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:54:11,330 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:54:11,330 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:54:11,330 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:54:11,331 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:11" (1/1) ... [2024-11-11 20:54:11,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:54:11,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:54:11,361 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:54:11,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:54:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:54:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-11 20:54:11,405 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-11 20:54:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-11 20:54:11,406 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-11 20:54:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:54:11,406 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:54:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:54:11,406 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:54:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-11 20:54:11,406 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-11 20:54:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:54:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-11 20:54:11,406 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-11 20:54:11,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:54:11,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:54:11,469 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:54:11,471 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:54:11,734 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-11 20:54:11,734 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:54:11,760 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:54:11,760 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:54:11,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:54:11 BoogieIcfgContainer [2024-11-11 20:54:11,765 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:54:11,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:54:11,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:54:11,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:54:11,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:54:10" (1/3) ... [2024-11-11 20:54:11,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557aea4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:54:11, skipping insertion in model container [2024-11-11 20:54:11,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:11" (2/3) ... [2024-11-11 20:54:11,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557aea4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:54:11, skipping insertion in model container [2024-11-11 20:54:11,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:54:11" (3/3) ... [2024-11-11 20:54:11,775 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product34.cil.c [2024-11-11 20:54:11,788 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:54:11,789 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:54:11,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:54:11,849 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;@7136c391, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:54:11,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:54:11,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 60 states have (on average 1.4) internal successors, (84), 66 states have internal predecessors, (84), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-11 20:54:11,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 20:54:11,879 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:11,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:11,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:11,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:11,888 INFO L85 PathProgramCache]: Analyzing trace with hash 77119383, now seen corresponding path program 1 times [2024-11-11 20:54:11,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:11,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947593106] [2024-11-11 20:54:11,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:11,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:12,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:54:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:12,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:12,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947593106] [2024-11-11 20:54:12,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947593106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:12,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:12,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:54:12,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20458347] [2024-11-11 20:54:12,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:12,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:54:12,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:12,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:54:12,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:54:12,171 INFO L87 Difference]: Start difference. First operand has 77 states, 60 states have (on average 1.4) internal successors, (84), 66 states have internal predecessors, (84), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:12,205 INFO L93 Difference]: Finished difference Result 146 states and 199 transitions. [2024-11-11 20:54:12,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:54:12,207 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-11 20:54:12,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:12,215 INFO L225 Difference]: With dead ends: 146 [2024-11-11 20:54:12,216 INFO L226 Difference]: Without dead ends: 68 [2024-11-11 20:54:12,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:54:12,224 INFO L435 NwaCegarLoop]: 96 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, 96 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:12,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:54:12,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-11 20:54:12,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-11 20:54:12,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.320754716981132) internal successors, (70), 58 states have internal predecessors, (70), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-11 20:54:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2024-11-11 20:54:12,272 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 25 [2024-11-11 20:54:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:12,273 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2024-11-11 20:54:12,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2024-11-11 20:54:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 20:54:12,276 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:12,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:12,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:54:12,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:12,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:12,278 INFO L85 PathProgramCache]: Analyzing trace with hash -736072085, now seen corresponding path program 1 times [2024-11-11 20:54:12,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:12,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312557666] [2024-11-11 20:54:12,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:12,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:12,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:54:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:12,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:12,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312557666] [2024-11-11 20:54:12,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312557666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:12,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:12,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:54:12,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140799417] [2024-11-11 20:54:12,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:12,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:54:12,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:12,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:54:12,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:54:12,436 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:12,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:12,449 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2024-11-11 20:54:12,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:54:12,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-11 20:54:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:12,451 INFO L225 Difference]: With dead ends: 101 [2024-11-11 20:54:12,452 INFO L226 Difference]: Without dead ends: 59 [2024-11-11 20:54:12,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:54:12,454 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:12,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 131 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:54:12,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-11 20:54:12,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-11 20:54:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 52 states have internal predecessors, (63), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 20:54:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2024-11-11 20:54:12,464 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 26 [2024-11-11 20:54:12,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:12,464 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2024-11-11 20:54:12,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:12,465 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2024-11-11 20:54:12,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 20:54:12,467 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:12,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:12,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:54:12,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:12,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:12,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1036891216, now seen corresponding path program 1 times [2024-11-11 20:54:12,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:12,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904760319] [2024-11-11 20:54:12,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:12,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:12,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:54:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:12,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:12,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904760319] [2024-11-11 20:54:12,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904760319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:12,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:12,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:54:12,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867843902] [2024-11-11 20:54:12,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:12,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:54:12,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:12,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:54:12,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:54:12,618 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:12,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:12,656 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2024-11-11 20:54:12,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:54:12,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-11 20:54:12,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:12,657 INFO L225 Difference]: With dead ends: 111 [2024-11-11 20:54:12,657 INFO L226 Difference]: Without dead ends: 59 [2024-11-11 20:54:12,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:54:12,658 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 69 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:12,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 211 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:54:12,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-11 20:54:12,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-11 20:54:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 52 states have internal predecessors, (62), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 20:54:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2024-11-11 20:54:12,665 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 31 [2024-11-11 20:54:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:12,666 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2024-11-11 20:54:12,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2024-11-11 20:54:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-11 20:54:12,667 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:12,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:12,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:54:12,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:12,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:12,669 INFO L85 PathProgramCache]: Analyzing trace with hash -349370363, now seen corresponding path program 1 times [2024-11-11 20:54:12,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:12,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131243956] [2024-11-11 20:54:12,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:12,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:12,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:54:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:12,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:54:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:12,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:12,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:12,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131243956] [2024-11-11 20:54:12,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131243956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:12,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:12,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:54:12,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274720843] [2024-11-11 20:54:12,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:12,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:54:12,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:12,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:54:12,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:54:12,703 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:54:12,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:12,726 INFO L93 Difference]: Finished difference Result 152 states and 195 transitions. [2024-11-11 20:54:12,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:54:12,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-11 20:54:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:12,728 INFO L225 Difference]: With dead ends: 152 [2024-11-11 20:54:12,728 INFO L226 Difference]: Without dead ends: 100 [2024-11-11 20:54:12,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:54:12,729 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 63 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:12,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 141 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:54:12,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-11 20:54:12,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-11-11 20:54:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 83 states have internal predecessors, (101), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-11 20:54:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 123 transitions. [2024-11-11 20:54:12,742 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 123 transitions. Word has length 36 [2024-11-11 20:54:12,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:12,742 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 123 transitions. [2024-11-11 20:54:12,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:54:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 123 transitions. [2024-11-11 20:54:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-11 20:54:12,744 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:12,744 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:12,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:54:12,745 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:12,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:12,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2107801392, now seen corresponding path program 1 times [2024-11-11 20:54:12,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:12,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982766723] [2024-11-11 20:54:12,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:12,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:54:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:12,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:12,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982766723] [2024-11-11 20:54:12,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982766723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:12,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:12,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:54:12,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859691011] [2024-11-11 20:54:12,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:12,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:54:12,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:12,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:54:12,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:54:12,855 INFO L87 Difference]: Start difference. First operand 98 states and 123 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:12,949 INFO L93 Difference]: Finished difference Result 192 states and 245 transitions. [2024-11-11 20:54:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:54:12,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-11-11 20:54:12,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:12,953 INFO L225 Difference]: With dead ends: 192 [2024-11-11 20:54:12,953 INFO L226 Difference]: Without dead ends: 101 [2024-11-11 20:54:12,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:54:12,960 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:12,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:54:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-11 20:54:12,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-11 20:54:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.3) internal successors, (104), 86 states have internal predecessors, (104), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-11 20:54:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2024-11-11 20:54:12,978 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 40 [2024-11-11 20:54:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:12,979 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2024-11-11 20:54:12,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:12,979 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2024-11-11 20:54:12,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-11 20:54:12,980 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:12,980 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:12,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:54:12,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:12,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:12,985 INFO L85 PathProgramCache]: Analyzing trace with hash 113656686, now seen corresponding path program 1 times [2024-11-11 20:54:12,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:12,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909489227] [2024-11-11 20:54:12,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:12,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:13,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:54:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:13,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:13,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909489227] [2024-11-11 20:54:13,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909489227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:13,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:13,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 20:54:13,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302354593] [2024-11-11 20:54:13,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:13,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 20:54:13,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:13,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 20:54:13,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 20:54:13,095 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:13,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:13,127 INFO L93 Difference]: Finished difference Result 197 states and 252 transitions. [2024-11-11 20:54:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 20:54:13,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-11-11 20:54:13,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:13,129 INFO L225 Difference]: With dead ends: 197 [2024-11-11 20:54:13,129 INFO L226 Difference]: Without dead ends: 103 [2024-11-11 20:54:13,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 20:54:13,131 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:13,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:54:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-11 20:54:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-11 20:54:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 88 states have internal predecessors, (106), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-11 20:54:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2024-11-11 20:54:13,145 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 40 [2024-11-11 20:54:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:13,145 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2024-11-11 20:54:13,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:13,146 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2024-11-11 20:54:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-11 20:54:13,147 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:13,147 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:13,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:54:13,147 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:13,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:13,148 INFO L85 PathProgramCache]: Analyzing trace with hash -703991764, now seen corresponding path program 1 times [2024-11-11 20:54:13,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:13,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261407074] [2024-11-11 20:54:13,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:13,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:13,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:54:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:13,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:13,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261407074] [2024-11-11 20:54:13,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261407074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:13,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:13,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:54:13,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287635797] [2024-11-11 20:54:13,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:13,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:54:13,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:13,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:54:13,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:54:13,261 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:13,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:13,289 INFO L93 Difference]: Finished difference Result 245 states and 308 transitions. [2024-11-11 20:54:13,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:54:13,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-11-11 20:54:13,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:13,293 INFO L225 Difference]: With dead ends: 245 [2024-11-11 20:54:13,293 INFO L226 Difference]: Without dead ends: 149 [2024-11-11 20:54:13,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:54:13,295 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 39 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:13,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 131 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:54:13,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-11 20:54:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2024-11-11 20:54:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 117 states have (on average 1.2735042735042734) internal successors, (149), 124 states have internal predecessors, (149), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-11 20:54:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 181 transitions. [2024-11-11 20:54:13,323 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 181 transitions. Word has length 40 [2024-11-11 20:54:13,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:13,324 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 181 transitions. [2024-11-11 20:54:13,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 181 transitions. [2024-11-11 20:54:13,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 20:54:13,326 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:13,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:13,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:54:13,327 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:13,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:13,327 INFO L85 PathProgramCache]: Analyzing trace with hash -430431235, now seen corresponding path program 1 times [2024-11-11 20:54:13,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:13,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769151137] [2024-11-11 20:54:13,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:13,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:13,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 20:54:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:13,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:54:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:13,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:13,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769151137] [2024-11-11 20:54:13,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769151137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:13,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:13,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:54:13,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597166247] [2024-11-11 20:54:13,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:13,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:54:13,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:13,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:54:13,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:54:13,442 INFO L87 Difference]: Start difference. First operand 147 states and 181 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:54:13,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:13,510 INFO L93 Difference]: Finished difference Result 285 states and 353 transitions. [2024-11-11 20:54:13,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:54:13,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2024-11-11 20:54:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:13,513 INFO L225 Difference]: With dead ends: 285 [2024-11-11 20:54:13,513 INFO L226 Difference]: Without dead ends: 145 [2024-11-11 20:54:13,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:54:13,515 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 23 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:13,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 264 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:54:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-11 20:54:13,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-11 20:54:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 115 states have (on average 1.2608695652173914) internal successors, (145), 122 states have internal predecessors, (145), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-11 20:54:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 177 transitions. [2024-11-11 20:54:13,538 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 177 transitions. Word has length 42 [2024-11-11 20:54:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:13,539 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 177 transitions. [2024-11-11 20:54:13,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:54:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 177 transitions. [2024-11-11 20:54:13,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 20:54:13,540 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:13,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:13,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:54:13,541 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:13,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:13,542 INFO L85 PathProgramCache]: Analyzing trace with hash -994693806, now seen corresponding path program 1 times [2024-11-11 20:54:13,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:13,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992391789] [2024-11-11 20:54:13,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:13,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:13,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:13,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:54:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:13,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:13,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:13,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992391789] [2024-11-11 20:54:13,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992391789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:13,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:13,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:54:13,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732205259] [2024-11-11 20:54:13,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:13,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:54:13,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:13,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:54:13,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:54:13,621 INFO L87 Difference]: Start difference. First operand 145 states and 177 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:54:13,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:13,852 INFO L93 Difference]: Finished difference Result 261 states and 325 transitions. [2024-11-11 20:54:13,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:54:13,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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 44 [2024-11-11 20:54:13,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:13,856 INFO L225 Difference]: With dead ends: 261 [2024-11-11 20:54:13,857 INFO L226 Difference]: Without dead ends: 104 [2024-11-11 20:54:13,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:54:13,858 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 94 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:13,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 362 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:54:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-11 20:54:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2024-11-11 20:54:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.2125) internal successors, (97), 85 states have internal predecessors, (97), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-11 20:54:13,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2024-11-11 20:54:13,880 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 44 [2024-11-11 20:54:13,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:13,881 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2024-11-11 20:54:13,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:54:13,881 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2024-11-11 20:54:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 20:54:13,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:13,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:13,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:54:13,882 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:13,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:13,883 INFO L85 PathProgramCache]: Analyzing trace with hash -622219357, now seen corresponding path program 1 times [2024-11-11 20:54:13,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:13,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826996057] [2024-11-11 20:54:13,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:13,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:13,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:54:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:13,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:54:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:13,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:13,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826996057] [2024-11-11 20:54:13,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826996057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:13,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:13,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:54:13,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294055388] [2024-11-11 20:54:13,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:13,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:54:13,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:13,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:54:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:54:13,999 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:14,125 INFO L93 Difference]: Finished difference Result 197 states and 238 transitions. [2024-11-11 20:54:14,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:54:14,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-11 20:54:14,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:14,128 INFO L225 Difference]: With dead ends: 197 [2024-11-11 20:54:14,131 INFO L226 Difference]: Without dead ends: 145 [2024-11-11 20:54:14,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:54:14,132 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 101 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:14,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 211 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:54:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-11 20:54:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-11 20:54:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 114 states have (on average 1.2280701754385965) internal successors, (140), 121 states have internal predecessors, (140), 15 states have call successors, (15), 15 states have call predecessors, (15), 15 states have return successors, (18), 14 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-11 20:54:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 173 transitions. [2024-11-11 20:54:14,153 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 173 transitions. Word has length 46 [2024-11-11 20:54:14,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:14,154 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 173 transitions. [2024-11-11 20:54:14,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:14,154 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 173 transitions. [2024-11-11 20:54:14,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 20:54:14,159 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:14,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:14,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:54:14,159 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:14,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:14,160 INFO L85 PathProgramCache]: Analyzing trace with hash -403364639, now seen corresponding path program 1 times [2024-11-11 20:54:14,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:14,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534015764] [2024-11-11 20:54:14,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:14,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:54:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:54:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:14,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:14,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534015764] [2024-11-11 20:54:14,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534015764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:14,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:14,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:54:14,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854329415] [2024-11-11 20:54:14,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:14,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:54:14,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:14,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:54:14,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:54:14,236 INFO L87 Difference]: Start difference. First operand 145 states and 173 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:14,309 INFO L93 Difference]: Finished difference Result 241 states and 292 transitions. [2024-11-11 20:54:14,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:54:14,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-11 20:54:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:14,311 INFO L225 Difference]: With dead ends: 241 [2024-11-11 20:54:14,311 INFO L226 Difference]: Without dead ends: 145 [2024-11-11 20:54:14,311 INFO L434 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-11 20:54:14,312 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 33 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:14,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 173 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:54:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-11 20:54:14,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-11 20:54:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 114 states have (on average 1.2105263157894737) internal successors, (138), 121 states have internal predecessors, (138), 15 states have call successors, (15), 15 states have call predecessors, (15), 15 states have return successors, (18), 14 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-11 20:54:14,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 171 transitions. [2024-11-11 20:54:14,326 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 171 transitions. Word has length 46 [2024-11-11 20:54:14,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:14,326 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 171 transitions. [2024-11-11 20:54:14,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:14,326 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 171 transitions. [2024-11-11 20:54:14,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 20:54:14,327 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:14,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:14,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:54:14,328 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:14,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:14,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1221013089, now seen corresponding path program 1 times [2024-11-11 20:54:14,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:14,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810650664] [2024-11-11 20:54:14,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:14,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:54:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:54:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:14,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:14,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810650664] [2024-11-11 20:54:14,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810650664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:14,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:14,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:54:14,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571387268] [2024-11-11 20:54:14,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:14,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:54:14,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:14,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:54:14,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:54:14,411 INFO L87 Difference]: Start difference. First operand 145 states and 171 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:14,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:14,532 INFO L93 Difference]: Finished difference Result 216 states and 258 transitions. [2024-11-11 20:54:14,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:54:14,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-11 20:54:14,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:14,534 INFO L225 Difference]: With dead ends: 216 [2024-11-11 20:54:14,534 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 20:54:14,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:54:14,535 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 28 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:14,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 283 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:54:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 20:54:14,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 20:54:14,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:54:14,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 20:54:14,538 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-11-11 20:54:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:14,539 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 20:54:14,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:14,539 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 20:54:14,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 20:54:14,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:54:14,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:54:14,545 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:14,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 20:54:15,414 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:54:15,482 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse1 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse2 (= |old(~pumpRunning~0)| 1)) (.cse0 (= |old(~pumpRunning~0)| 0))) (and (or (not .cse0) (and (= ~pumpRunning~0 0) .cse1)) (or (not .cse2) (and .cse1 (= ~pumpRunning~0 1))) (let ((.cse3 (not (= 0 ~systemActive~0)))) (or (and .cse2 .cse3) (and .cse0 .cse3))))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int) (|old(~waterLevel~0)| Int)) (let ((.cse1 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse2 (= |old(~pumpRunning~0)| 1)) (.cse0 (= |old(~pumpRunning~0)| 0))) (and (or (not .cse0) (and (= ~pumpRunning~0 0) .cse1)) (or (not .cse2) (and .cse1 (= ~pumpRunning~0 1))) (let ((.cse3 (not (= 0 ~systemActive~0)))) (or (and .cse2 .cse3) (and .cse0 .cse3)))))) [2024-11-11 20:54:15,495 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 20:54:15,502 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse0 (not (= 0 ~systemActive~0)))) (or (and (= ~pumpRunning~0 0) (not (= |old(~waterLevel~0)| 2)) .cse0) (and .cse0 (= ~pumpRunning~0 1)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (not (= 0 ~systemActive~0)))) (or (and (= ~pumpRunning~0 0) (not (= 2 ~waterLevel~0)) .cse0) (and .cse0 (= ~pumpRunning~0 1)))) [2024-11-11 20:54:15,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:54:15 BoogieIcfgContainer [2024-11-11 20:54:15,509 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:54:15,510 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:54:15,510 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:54:15,510 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:54:15,511 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:54:11" (3/4) ... [2024-11-11 20:54:15,513 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 20:54:15,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-11 20:54:15,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-11 20:54:15,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-11-11 20:54:15,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-11 20:54:15,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-11 20:54:15,519 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-11 20:54:15,526 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-11 20:54:15,527 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-11 20:54:15,527 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-11 20:54:15,527 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:54:15,528 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:54:15,649 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:54:15,650 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 20:54:15,650 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:54:15,651 INFO L158 Benchmark]: Toolchain (without parser) took 4875.49ms. Allocated memory was 169.9MB in the beginning and 211.8MB in the end (delta: 41.9MB). Free memory was 137.6MB in the beginning and 119.0MB in the end (delta: 18.6MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. [2024-11-11 20:54:15,651 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 169.9MB. Free memory was 141.2MB in the beginning and 141.0MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:54:15,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.16ms. Allocated memory is still 169.9MB. Free memory was 137.6MB in the beginning and 116.2MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-11 20:54:15,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.95ms. Allocated memory is still 169.9MB. Free memory was 116.2MB in the beginning and 114.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:54:15,652 INFO L158 Benchmark]: Boogie Preprocessor took 56.30ms. Allocated memory is still 169.9MB. Free memory was 114.1MB in the beginning and 112.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:54:15,652 INFO L158 Benchmark]: RCFGBuilder took 435.04ms. Allocated memory is still 169.9MB. Free memory was 112.0MB in the beginning and 94.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 20:54:15,653 INFO L158 Benchmark]: TraceAbstraction took 3742.83ms. Allocated memory was 169.9MB in the beginning and 211.8MB in the end (delta: 41.9MB). Free memory was 94.0MB in the beginning and 126.3MB in the end (delta: -32.3MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. [2024-11-11 20:54:15,653 INFO L158 Benchmark]: Witness Printer took 140.11ms. Allocated memory is still 211.8MB. Free memory was 126.3MB in the beginning and 119.0MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 20:54:15,654 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.24ms. Allocated memory is still 169.9MB. Free memory was 141.2MB in the beginning and 141.0MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.16ms. Allocated memory is still 169.9MB. Free memory was 137.6MB in the beginning and 116.2MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.95ms. Allocated memory is still 169.9MB. Free memory was 116.2MB in the beginning and 114.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.30ms. Allocated memory is still 169.9MB. Free memory was 114.1MB in the beginning and 112.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 435.04ms. Allocated memory is still 169.9MB. Free memory was 112.0MB in the beginning and 94.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3742.83ms. Allocated memory was 169.9MB in the beginning and 211.8MB in the end (delta: 41.9MB). Free memory was 94.0MB in the beginning and 126.3MB in the end (delta: -32.3MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. * Witness Printer took 140.11ms. Allocated memory is still 211.8MB. Free memory was 126.3MB in the beginning and 119.0MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] - GenericResultAtLocation [Line: 121]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [121] - GenericResultAtLocation [Line: 221]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [221] - GenericResultAtLocation [Line: 389]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [389] - GenericResultAtLocation [Line: 755]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [755] - GenericResultAtLocation [Line: 791]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [791] - GenericResultAtLocation [Line: 800]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [800] - GenericResultAtLocation [Line: 894]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [894] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 796]: 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 7 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 477 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 463 mSDsluCounter, 2490 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1635 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 479 IncrementalHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 855 mSDtfsCounter, 479 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=7, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 450 ConstructedInterpolants, 0 QuantifiedInterpolants, 674 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 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: 65]: Loop Invariant Derived loop invariant: (((((pumpRunning == 0) && (2 != waterLevel)) && (splverifierCounter == 0)) && (0 != systemActive)) || (((splverifierCounter == 0) && (0 != systemActive)) && (pumpRunning == 1))) - InvariantResult [Line: 64]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 257]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((pumpRunning == 0) && (2 != waterLevel)) && (0 != systemActive)) || ((0 != systemActive) && (pumpRunning == 1))) Ensures: (((((pumpRunning == 0) && (2 != waterLevel)) && (0 != systemActive)) || ((0 != systemActive) && (pumpRunning == 1))) && ((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 827]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((pumpRunning == 0) && (0 != systemActive)) || ((0 != systemActive) && (pumpRunning == 1))) Ensures: ((((pumpRunning == 0) && (0 != systemActive)) || ((0 != systemActive) && (pumpRunning == 1))) && (((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head))) && (waterLevel == \old(waterLevel)))) - ProcedureContractResult [Line: 839]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((pumpRunning == 0) && (2 != waterLevel)) && (0 != systemActive)) || ((0 != systemActive) && (pumpRunning == 1))) Ensures: (((((pumpRunning == 0) && (2 != waterLevel)) && (0 != systemActive)) || ((0 != systemActive) && (pumpRunning == 1))) && ((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 123]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (systemActive == \old(systemActive))) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 233]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: ((((((\old(pumpRunning) != 1) || (pumpRunning == 1)) && (((\old(pumpRunning) != 0) || (pumpRunning == 0)) || (\old(waterLevel) != 1))) && (((\old(pumpRunning) != 0) || (((pumpRunning == 0) && (2 != waterLevel)) && (\old(waterLevel) == waterLevel))) || ((\old(waterLevel) == waterLevel) && (pumpRunning == 1)))) && (((\old(pumpRunning) == 1) && (0 != systemActive)) || ((\old(pumpRunning) == 0) && (0 != systemActive)))) && ((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (systemActive == \old(systemActive))) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 815]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((pumpRunning == 0) && (2 != waterLevel)) && (0 != systemActive)) || ((0 != systemActive) && (pumpRunning == 1))) Ensures: (((((pumpRunning == 0) && (\old(waterLevel) != 2)) && (0 != systemActive)) || ((0 != systemActive) && (pumpRunning == 1))) && (((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical)))) RESULT: Ultimate proved your program to be correct! [2024-11-11 20:54:15,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE