./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product36.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product36.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 dae9a870dcbd894d53325794bcd1e36e0da0523a0c6f117be41bebebda51818a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 02:02:59,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 02:02:59,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 02:02:59,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 02:02:59,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 02:02:59,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 02:02:59,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 02:02:59,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 02:02:59,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 02:02:59,975 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 02:02:59,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 02:02:59,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 02:02:59,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 02:02:59,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 02:02:59,976 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 02:02:59,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 02:02:59,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 02:02:59,977 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 02:02:59,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 02:02:59,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 02:02:59,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 02:02:59,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 02:02:59,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 02:02:59,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 02:02:59,983 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 02:02:59,983 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 02:02:59,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 02:02:59,983 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 02:02:59,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 02:02:59,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 02:02:59,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 02:02:59,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 02:02:59,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 02:02:59,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 02:02:59,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 02:02:59,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 02:02:59,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 02:02:59,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 02:02:59,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 02:02:59,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 02:02:59,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 02:02:59,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 02:02:59,986 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 -> dae9a870dcbd894d53325794bcd1e36e0da0523a0c6f117be41bebebda51818a [2024-11-22 02:03:00,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 02:03:00,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 02:03:00,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 02:03:00,184 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 02:03:00,184 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 02:03:00,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product36.cil.c [2024-11-22 02:03:01,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 02:03:01,883 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 02:03:01,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product36.cil.c [2024-11-22 02:03:01,892 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be22693ba/e500141b5e884bf6b158ee5df1d78667/FLAG4e206c8fb [2024-11-22 02:03:02,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be22693ba/e500141b5e884bf6b158ee5df1d78667 [2024-11-22 02:03:02,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 02:03:02,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 02:03:02,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 02:03:02,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 02:03:02,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 02:03:02,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:03:02" (1/1) ... [2024-11-22 02:03:02,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f486c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:02, skipping insertion in model container [2024-11-22 02:03:02,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:03:02" (1/1) ... [2024-11-22 02:03:02,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 02:03:02,502 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_spec1_product36.cil.c[1605,1618] [2024-11-22 02:03:02,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 02:03:02,637 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 02:03:02,644 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2024-11-22 02:03:02,646 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [58] [2024-11-22 02:03:02,646 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [245] [2024-11-22 02:03:02,646 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [342] [2024-11-22 02:03:02,646 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [412] [2024-11-22 02:03:02,646 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [450] [2024-11-22 02:03:02,647 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [816] [2024-11-22 02:03:02,647 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [842] [2024-11-22 02:03:02,650 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_spec1_product36.cil.c[1605,1618] [2024-11-22 02:03:02,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 02:03:02,721 INFO L204 MainTranslator]: Completed translation [2024-11-22 02:03:02,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:02 WrapperNode [2024-11-22 02:03:02,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 02:03:02,722 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 02:03:02,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 02:03:02,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 02:03:02,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:02" (1/1) ... [2024-11-22 02:03:02,741 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:02" (1/1) ... [2024-11-22 02:03:02,783 INFO L138 Inliner]: procedures = 54, calls = 96, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 174 [2024-11-22 02:03:02,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 02:03:02,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 02:03:02,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 02:03:02,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 02:03:02,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:02" (1/1) ... [2024-11-22 02:03:02,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:02" (1/1) ... [2024-11-22 02:03:02,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:02" (1/1) ... [2024-11-22 02:03:02,816 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-22 02:03:02,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:02" (1/1) ... [2024-11-22 02:03:02,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:02" (1/1) ... [2024-11-22 02:03:02,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:02" (1/1) ... [2024-11-22 02:03:02,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:02" (1/1) ... [2024-11-22 02:03:02,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:02" (1/1) ... [2024-11-22 02:03:02,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:02" (1/1) ... [2024-11-22 02:03:02,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 02:03:02,834 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 02:03:02,834 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 02:03:02,834 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 02:03:02,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:02" (1/1) ... [2024-11-22 02:03:02,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 02:03:02,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:03:02,864 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-22 02:03:02,867 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-22 02:03:02,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 02:03:02,923 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-22 02:03:02,924 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-22 02:03:02,924 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-22 02:03:02,924 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-22 02:03:02,924 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-22 02:03:02,924 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-22 02:03:02,924 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-22 02:03:02,924 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-22 02:03:02,924 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-22 02:03:02,924 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-22 02:03:02,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 02:03:02,924 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-22 02:03:02,924 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-22 02:03:02,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 02:03:02,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 02:03:02,974 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 02:03:02,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 02:03:03,201 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-22 02:03:03,201 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 02:03:03,211 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 02:03:03,211 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 02:03:03,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:03:03 BoogieIcfgContainer [2024-11-22 02:03:03,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 02:03:03,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 02:03:03,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 02:03:03,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 02:03:03,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:03:02" (1/3) ... [2024-11-22 02:03:03,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d07018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:03:03, skipping insertion in model container [2024-11-22 02:03:03,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:03:02" (2/3) ... [2024-11-22 02:03:03,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d07018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:03:03, skipping insertion in model container [2024-11-22 02:03:03,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:03:03" (3/3) ... [2024-11-22 02:03:03,220 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product36.cil.c [2024-11-22 02:03:03,232 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 02:03:03,232 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 02:03:03,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 02:03:03,300 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;@ecb53c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 02:03:03,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 02:03:03,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 68 states have internal predecessors, (86), 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-22 02:03:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 02:03:03,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:03,311 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:03:03,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:03,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:03,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1839487273, now seen corresponding path program 1 times [2024-11-22 02:03:03,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:03,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570822605] [2024-11-22 02:03:03,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:03,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:03,501 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-22 02:03:03,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:03,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570822605] [2024-11-22 02:03:03,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570822605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:03:03,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:03:03,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 02:03:03,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462537458] [2024-11-22 02:03:03,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:03,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 02:03:03,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:03,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 02:03:03,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 02:03:03,543 INFO L87 Difference]: Start difference. First operand has 79 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 68 states have internal predecessors, (86), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-22 02:03:03,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:03,573 INFO L93 Difference]: Finished difference Result 150 states and 203 transitions. [2024-11-22 02:03:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 02:03:03,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 23 [2024-11-22 02:03:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:03,583 INFO L225 Difference]: With dead ends: 150 [2024-11-22 02:03:03,583 INFO L226 Difference]: Without dead ends: 70 [2024-11-22 02:03:03,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-22 02:03:03,589 INFO L432 NwaCegarLoop]: 98 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, 98 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-22 02:03:03,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:03,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-22 02:03:03,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-22 02:03:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.309090909090909) internal successors, (72), 60 states have internal predecessors, (72), 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-22 02:03:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2024-11-22 02:03:03,697 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 23 [2024-11-22 02:03:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:03,697 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2024-11-22 02:03:03,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-22 02:03:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2024-11-22 02:03:03,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 02:03:03,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:03,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:03:03,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 02:03:03,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:03,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:03,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1995101318, now seen corresponding path program 1 times [2024-11-22 02:03:03,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:03,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094988642] [2024-11-22 02:03:03,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:03,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:03,886 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-22 02:03:03,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:03,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094988642] [2024-11-22 02:03:03,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094988642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:03:03,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:03:03,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 02:03:03,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569314748] [2024-11-22 02:03:03,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:03,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 02:03:03,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:03,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 02:03:03,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 02:03:03,893 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-22 02:03:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:03,913 INFO L93 Difference]: Finished difference Result 101 states and 128 transitions. [2024-11-22 02:03:03,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 02:03:03,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 24 [2024-11-22 02:03:03,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:03,916 INFO L225 Difference]: With dead ends: 101 [2024-11-22 02:03:03,916 INFO L226 Difference]: Without dead ends: 61 [2024-11-22 02:03:03,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 02:03:03,919 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 18 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 130 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-22 02:03:03,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 130 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:03,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-22 02:03:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-22 02:03:03,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 54 states have internal predecessors, (65), 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-22 02:03:03,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2024-11-22 02:03:03,936 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 24 [2024-11-22 02:03:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:03,936 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2024-11-22 02:03:03,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-22 02:03:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2024-11-22 02:03:03,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-22 02:03:03,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:03,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:03:03,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 02:03:03,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:03,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:03,942 INFO L85 PathProgramCache]: Analyzing trace with hash 613473394, now seen corresponding path program 1 times [2024-11-22 02:03:03,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:03,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707428081] [2024-11-22 02:03:03,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:03,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:04,150 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-22 02:03:04,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:04,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707428081] [2024-11-22 02:03:04,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707428081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:03:04,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:03:04,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:03:04,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023652681] [2024-11-22 02:03:04,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:04,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 02:03:04,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:04,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 02:03:04,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:03:04,155 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-22 02:03:04,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:04,229 INFO L93 Difference]: Finished difference Result 154 states and 199 transitions. [2024-11-22 02:03:04,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 02:03:04,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 29 [2024-11-22 02:03:04,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:04,231 INFO L225 Difference]: With dead ends: 154 [2024-11-22 02:03:04,231 INFO L226 Difference]: Without dead ends: 100 [2024-11-22 02:03:04,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-22 02:03:04,232 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 70 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:03:04,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 312 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-22 02:03:04,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2024-11-22 02:03:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 82 states have internal predecessors, (101), 10 states have call successors, (10), 9 states have call predecessors, (10), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-22 02:03:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2024-11-22 02:03:04,249 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 29 [2024-11-22 02:03:04,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:04,249 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2024-11-22 02:03:04,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-22 02:03:04,249 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2024-11-22 02:03:04,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-22 02:03:04,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:04,250 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:03:04,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 02:03:04,256 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:04,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:04,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2110247573, now seen corresponding path program 1 times [2024-11-22 02:03:04,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:04,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397022432] [2024-11-22 02:03:04,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:04,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:04,342 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-22 02:03:04,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:04,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397022432] [2024-11-22 02:03:04,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397022432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:03:04,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:03:04,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:03:04,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507424369] [2024-11-22 02:03:04,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:04,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 02:03:04,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:04,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 02:03:04,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:03:04,345 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 02:03:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:04,404 INFO L93 Difference]: Finished difference Result 219 states and 289 transitions. [2024-11-22 02:03:04,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 02:03:04,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-22 02:03:04,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:04,407 INFO L225 Difference]: With dead ends: 219 [2024-11-22 02:03:04,407 INFO L226 Difference]: Without dead ends: 131 [2024-11-22 02:03:04,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-22 02:03:04,411 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 41 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:03:04,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 261 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:04,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-22 02:03:04,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-22 02:03:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 110 states have internal predecessors, (132), 14 states have call successors, (14), 14 states have call predecessors, (14), 14 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2024-11-22 02:03:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2024-11-22 02:03:04,428 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 32 [2024-11-22 02:03:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:04,428 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2024-11-22 02:03:04,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 02:03:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2024-11-22 02:03:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-22 02:03:04,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:04,435 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:03:04,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 02:03:04,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:04,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:04,436 INFO L85 PathProgramCache]: Analyzing trace with hash -304840246, now seen corresponding path program 1 times [2024-11-22 02:03:04,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:04,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561175735] [2024-11-22 02:03:04,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:04,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:04,495 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-22 02:03:04,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:04,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561175735] [2024-11-22 02:03:04,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561175735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:03:04,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:03:04,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:03:04,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195531254] [2024-11-22 02:03:04,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:04,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 02:03:04,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:04,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 02:03:04,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:03:04,499 INFO L87 Difference]: Start difference. First operand 131 states and 164 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (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-22 02:03:04,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:04,523 INFO L93 Difference]: Finished difference Result 258 states and 328 transitions. [2024-11-22 02:03:04,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 02:03:04,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (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 38 [2024-11-22 02:03:04,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:04,525 INFO L225 Difference]: With dead ends: 258 [2024-11-22 02:03:04,526 INFO L226 Difference]: Without dead ends: 134 [2024-11-22 02:03:04,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-22 02:03:04,528 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:03:04,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:04,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-22 02:03:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-22 02:03:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 105 states have (on average 1.2857142857142858) internal successors, (135), 113 states have internal predecessors, (135), 14 states have call successors, (14), 14 states have call predecessors, (14), 14 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2024-11-22 02:03:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2024-11-22 02:03:04,545 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 167 transitions. Word has length 38 [2024-11-22 02:03:04,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:04,546 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 167 transitions. [2024-11-22 02:03:04,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (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-22 02:03:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 167 transitions. [2024-11-22 02:03:04,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-22 02:03:04,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:04,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:03:04,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 02:03:04,548 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:04,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:04,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1325908600, now seen corresponding path program 1 times [2024-11-22 02:03:04,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:04,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253704127] [2024-11-22 02:03:04,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:04,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:04,619 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-22 02:03:04,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:04,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253704127] [2024-11-22 02:03:04,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253704127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:03:04,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:03:04,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 02:03:04,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117356195] [2024-11-22 02:03:04,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:04,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 02:03:04,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:04,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 02:03:04,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 02:03:04,622 INFO L87 Difference]: Start difference. First operand 134 states and 167 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-22 02:03:04,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:04,650 INFO L93 Difference]: Finished difference Result 263 states and 336 transitions. [2024-11-22 02:03:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 02:03:04,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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 38 [2024-11-22 02:03:04,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:04,652 INFO L225 Difference]: With dead ends: 263 [2024-11-22 02:03:04,652 INFO L226 Difference]: Without dead ends: 136 [2024-11-22 02:03:04,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 02:03:04,653 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 357 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-22 02:03:04,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 357 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:04,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-22 02:03:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-22 02:03:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 107 states have (on average 1.280373831775701) internal successors, (137), 115 states have internal predecessors, (137), 14 states have call successors, (14), 14 states have call predecessors, (14), 14 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2024-11-22 02:03:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 169 transitions. [2024-11-22 02:03:04,677 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 169 transitions. Word has length 38 [2024-11-22 02:03:04,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:04,677 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 169 transitions. [2024-11-22 02:03:04,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-22 02:03:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 169 transitions. [2024-11-22 02:03:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-22 02:03:04,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:04,679 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:03:04,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 02:03:04,679 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:04,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:04,679 INFO L85 PathProgramCache]: Analyzing trace with hash 974913990, now seen corresponding path program 1 times [2024-11-22 02:03:04,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:04,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665180555] [2024-11-22 02:03:04,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:04,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:04,797 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-22 02:03:04,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:04,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665180555] [2024-11-22 02:03:04,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665180555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:03:04,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:03:04,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 02:03:04,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730633868] [2024-11-22 02:03:04,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:04,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 02:03:04,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:04,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 02:03:04,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 02:03:04,799 INFO L87 Difference]: Start difference. First operand 136 states and 169 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-22 02:03:04,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:04,819 INFO L93 Difference]: Finished difference Result 340 states and 431 transitions. [2024-11-22 02:03:04,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 02:03:04,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 38 [2024-11-22 02:03:04,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:04,822 INFO L225 Difference]: With dead ends: 340 [2024-11-22 02:03:04,822 INFO L226 Difference]: Without dead ends: 211 [2024-11-22 02:03:04,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 02:03:04,824 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 38 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:03:04,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 139 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-22 02:03:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-22 02:03:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 166 states have (on average 1.2590361445783131) internal successors, (209), 176 states have internal predecessors, (209), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (28), 21 states have call predecessors, (28), 23 states have call successors, (28) [2024-11-22 02:03:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 260 transitions. [2024-11-22 02:03:04,850 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 260 transitions. Word has length 38 [2024-11-22 02:03:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:04,852 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 260 transitions. [2024-11-22 02:03:04,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-22 02:03:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 260 transitions. [2024-11-22 02:03:04,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 02:03:04,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:04,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:03:04,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 02:03:04,855 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:04,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:04,856 INFO L85 PathProgramCache]: Analyzing trace with hash -457608212, now seen corresponding path program 1 times [2024-11-22 02:03:04,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:04,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174880327] [2024-11-22 02:03:04,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:04,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:03:04,956 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-22 02:03:04,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:03:04,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174880327] [2024-11-22 02:03:04,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174880327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:03:04,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:03:04,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 02:03:04,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683037336] [2024-11-22 02:03:04,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:03:04,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 02:03:04,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:03:04,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 02:03:04,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 02:03:04,959 INFO L87 Difference]: Start difference. First operand 211 states and 260 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 02:03:05,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:03:05,040 INFO L93 Difference]: Finished difference Result 607 states and 774 transitions. [2024-11-22 02:03:05,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 02:03:05,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2024-11-22 02:03:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:03:05,043 INFO L225 Difference]: With dead ends: 607 [2024-11-22 02:03:05,044 INFO L226 Difference]: Without dead ends: 403 [2024-11-22 02:03:05,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 02:03:05,046 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 40 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:03:05,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 342 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:03:05,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-22 02:03:05,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2024-11-22 02:03:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 314 states have (on average 1.2388535031847134) internal successors, (389), 333 states have internal predecessors, (389), 46 states have call successors, (46), 46 states have call predecessors, (46), 42 states have return successors, (61), 42 states have call predecessors, (61), 46 states have call successors, (61) [2024-11-22 02:03:05,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 496 transitions. [2024-11-22 02:03:05,080 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 496 transitions. Word has length 42 [2024-11-22 02:03:05,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:03:05,080 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 496 transitions. [2024-11-22 02:03:05,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 02:03:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 496 transitions. [2024-11-22 02:03:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 02:03:05,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:03:05,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:03:05,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 02:03:05,083 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:03:05,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:03:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash -212622224, now seen corresponding path program 1 times [2024-11-22 02:03:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:03:05,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479464186] [2024-11-22 02:03:05,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:03:05,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:03:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 02:03:05,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 02:03:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 02:03:05,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 02:03:05,136 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 02:03:05,138 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 02:03:05,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 02:03:05,142 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:03:05,183 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 02:03:05,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:03:05 BoogieIcfgContainer [2024-11-22 02:03:05,188 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 02:03:05,188 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 02:03:05,188 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 02:03:05,188 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 02:03:05,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:03:03" (3/4) ... [2024-11-22 02:03:05,189 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 02:03:05,245 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 02:03:05,248 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 02:03:05,249 INFO L158 Benchmark]: Toolchain (without parser) took 2982.62ms. Allocated memory was 142.6MB in the beginning and 255.9MB in the end (delta: 113.2MB). Free memory was 70.5MB in the beginning and 139.1MB in the end (delta: -68.6MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2024-11-22 02:03:05,249 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 02:03:05,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.65ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 49.2MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-22 02:03:05,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.92ms. Allocated memory was 142.6MB in the beginning and 255.9MB in the end (delta: 113.2MB). Free memory was 49.2MB in the beginning and 224.9MB in the end (delta: -175.7MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-11-22 02:03:05,249 INFO L158 Benchmark]: Boogie Preprocessor took 48.92ms. Allocated memory is still 255.9MB. Free memory was 224.8MB in the beginning and 222.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 02:03:05,250 INFO L158 Benchmark]: RCFGBuilder took 378.28ms. Allocated memory is still 255.9MB. Free memory was 222.6MB in the beginning and 211.7MB in the end (delta: 11.0MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-11-22 02:03:05,250 INFO L158 Benchmark]: TraceAbstraction took 1973.27ms. Allocated memory is still 255.9MB. Free memory was 210.6MB in the beginning and 143.3MB in the end (delta: 67.3MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2024-11-22 02:03:05,250 INFO L158 Benchmark]: Witness Printer took 60.05ms. Allocated memory is still 255.9MB. Free memory was 143.3MB in the beginning and 139.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 02:03:05,251 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.14ms. Allocated memory is still 142.6MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.65ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 49.2MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.92ms. Allocated memory was 142.6MB in the beginning and 255.9MB in the end (delta: 113.2MB). Free memory was 49.2MB in the beginning and 224.9MB in the end (delta: -175.7MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.92ms. Allocated memory is still 255.9MB. Free memory was 224.8MB in the beginning and 222.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 378.28ms. Allocated memory is still 255.9MB. Free memory was 222.6MB in the beginning and 211.7MB in the end (delta: 11.0MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1973.27ms. Allocated memory is still 255.9MB. Free memory was 210.6MB in the beginning and 143.3MB in the end (delta: 67.3MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. * Witness Printer took 60.05ms. Allocated memory is still 255.9MB. Free memory was 143.3MB in the beginning and 139.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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,"wsllib_check.i","") [49] - GenericResultAtLocation [Line: 58]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [58] - GenericResultAtLocation [Line: 245]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [245] - GenericResultAtLocation [Line: 342]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [342] - GenericResultAtLocation [Line: 412]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [412] - GenericResultAtLocation [Line: 450]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [450] - GenericResultAtLocation [Line: 816]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [816] - GenericResultAtLocation [Line: 842]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [842] * 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 - CounterExampleResult [Line: 54]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L70] int pumpRunning = 0; [L71] int systemActive = 1; [L249] int waterLevel = 1; [L250] int methaneLevelCritical = 0; [L620] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L843] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L916] int retValue_acc ; [L917] int tmp ; [L921] FCALL select_helpers() [L922] FCALL select_features() [L923] CALL, EXPR valid_product() [L442] int retValue_acc ; [L445] retValue_acc = 1 [L446] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L923] RET, EXPR valid_product() [L923] tmp = valid_product() [L925] COND TRUE \read(tmp) [L927] FCALL setup() [L928] CALL runTest() [L910] CALL test() [L345] int splverifierCounter ; [L346] int tmp ; [L347] int tmp___0 ; [L348] int tmp___1 ; [L349] int tmp___2 ; [L352] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L354] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L356] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L362] tmp = __VERIFIER_nondet_int() [L364] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L366] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L267] COND TRUE waterLevel < 2 [L268] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L366] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L372] tmp___0 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L376] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L279] COND FALSE !(\read(methaneLevelCritical)) [L282] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L376] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L382] tmp___2 = __VERIFIER_nondet_int() [L384] COND TRUE \read(tmp___2) [L386] CALL startSystem() [L241] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L386] RET startSystem() [L401] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L78] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L85] COND TRUE \read(systemActive) [L87] CALL processEnvironment() [L107] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L110] COND TRUE ! pumpRunning [L112] CALL, EXPR isHighWaterLevel() [L204] int retValue_acc ; [L205] int tmp ; [L206] int tmp___0 ; [L210] CALL, EXPR isHighWaterSensorDry() [L329] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L332] COND FALSE !(waterLevel < 2) [L336] retValue_acc = 0 [L337] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L210] RET, EXPR isHighWaterSensorDry() [L210] tmp = isHighWaterSensorDry() [L212] COND FALSE !(\read(tmp)) [L215] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L217] retValue_acc = tmp___0 [L218] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L112] RET, EXPR isHighWaterLevel() [L112] tmp = isHighWaterLevel() [L114] COND TRUE \read(tmp) [L116] CALL activatePump() [L135] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L116] RET activatePump() [L87] RET processEnvironment() [L93] CALL __utac_acc__Specification1_spec__1() [L818] int tmp ; [L819] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L823] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L288] int retValue_acc ; [L291] retValue_acc = methaneLevelCritical [L292] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L823] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L823] tmp = isMethaneLevelCritical() [L825] COND TRUE \read(tmp) [L827] CALL, EXPR isPumpRunning() [L159] int retValue_acc ; [L162] retValue_acc = pumpRunning [L163] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L827] RET, EXPR isPumpRunning() [L827] tmp___0 = isPumpRunning() [L829] COND TRUE \read(tmp___0) [L831] CALL __automaton_fail() [L54] reach_error() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 211 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 207 mSDsluCounter, 1928 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1296 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 127 IncrementalHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 632 mSDtfsCounter, 127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=8, InterpolantAutomatonStates: 36, 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, 8 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 464 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-22 02:03:05,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE