./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product57.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product57.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 7573d0f26b9c64760f56bc1038037f99fa78fd69add5234955c16ce4082df45a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:10:08,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:10:08,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:10:08,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:10:08,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:10:08,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:10:08,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:10:08,103 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:10:08,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:10:08,105 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:10:08,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:10:08,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:10:08,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:10:08,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:10:08,109 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:10:08,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:10:08,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:10:08,110 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:10:08,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:10:08,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:10:08,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:10:08,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:10:08,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:10:08,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:10:08,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:10:08,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:10:08,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:10:08,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:10:08,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:10:08,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:10:08,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:10:08,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:10:08,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:10:08,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:10:08,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:10:08,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:10:08,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:10:08,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:10:08,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:10:08,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:10:08,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:10:08,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:10:08,117 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 -> 7573d0f26b9c64760f56bc1038037f99fa78fd69add5234955c16ce4082df45a [2024-10-14 03:10:08,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:10:08,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:10:08,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:10:08,409 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:10:08,410 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:10:08,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product57.cil.c [2024-10-14 03:10:09,841 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:10:10,089 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:10:10,090 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product57.cil.c [2024-10-14 03:10:10,102 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b6db20f8/e91717954c2749e6b4574cc11c6d0c99/FLAG2fee3f503 [2024-10-14 03:10:10,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b6db20f8/e91717954c2749e6b4574cc11c6d0c99 [2024-10-14 03:10:10,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:10:10,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:10:10,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:10:10,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:10:10,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:10:10,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:10:10" (1/1) ... [2024-10-14 03:10:10,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d9bde5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:10, skipping insertion in model container [2024-10-14 03:10:10,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:10:10" (1/1) ... [2024-10-14 03:10:10,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:10:10,431 WARN L248 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_spec4_product57.cil.c[18691,18704] [2024-10-14 03:10:10,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:10:10,452 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:10:10,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2024-10-14 03:10:10,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [118] [2024-10-14 03:10:10,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [343] [2024-10-14 03:10:10,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [371] [2024-10-14 03:10:10,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [474] [2024-10-14 03:10:10,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [512] [2024-10-14 03:10:10,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [608] [2024-10-14 03:10:10,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [974] [2024-10-14 03:10:10,539 WARN L248 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_spec4_product57.cil.c[18691,18704] [2024-10-14 03:10:10,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:10:10,560 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:10:10,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:10 WrapperNode [2024-10-14 03:10:10,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:10:10,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:10:10,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:10:10,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:10:10,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:10" (1/1) ... [2024-10-14 03:10:10,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:10" (1/1) ... [2024-10-14 03:10:10,611 INFO L138 Inliner]: procedures = 56, calls = 100, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 227 [2024-10-14 03:10:10,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:10:10,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:10:10,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:10:10,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:10:10,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:10" (1/1) ... [2024-10-14 03:10:10,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:10" (1/1) ... [2024-10-14 03:10:10,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:10" (1/1) ... [2024-10-14 03:10:10,669 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-10-14 03:10:10,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:10" (1/1) ... [2024-10-14 03:10:10,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:10" (1/1) ... [2024-10-14 03:10:10,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:10" (1/1) ... [2024-10-14 03:10:10,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:10" (1/1) ... [2024-10-14 03:10:10,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:10" (1/1) ... [2024-10-14 03:10:10,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:10" (1/1) ... [2024-10-14 03:10:10,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:10:10,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:10:10,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:10:10,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:10:10,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:10" (1/1) ... [2024-10-14 03:10:10,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:10:10,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:10:10,753 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-10-14 03:10:10,763 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-10-14 03:10:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:10:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-14 03:10:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-14 03:10:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 03:10:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 03:10:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 03:10:10,814 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 03:10:10,814 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-14 03:10:10,815 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-14 03:10:10,815 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-14 03:10:10,815 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-14 03:10:10,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:10:10,815 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-14 03:10:10,815 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-14 03:10:10,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:10:10,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:10:10,883 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:10:10,885 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:10:11,135 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-10-14 03:10:11,137 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:10:11,200 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:10:11,200 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 03:10:11,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:10:11 BoogieIcfgContainer [2024-10-14 03:10:11,201 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:10:11,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:10:11,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:10:11,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:10:11,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:10:10" (1/3) ... [2024-10-14 03:10:11,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e79f0c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:10:11, skipping insertion in model container [2024-10-14 03:10:11,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:10:10" (2/3) ... [2024-10-14 03:10:11,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e79f0c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:10:11, skipping insertion in model container [2024-10-14 03:10:11,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:10:11" (3/3) ... [2024-10-14 03:10:11,210 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product57.cil.c [2024-10-14 03:10:11,224 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:10:11,224 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:10:11,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:10:11,311 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;@1395cbc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:10:11,312 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:10:11,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 47 states have (on average 1.574468085106383) internal successors, (74), 55 states have internal predecessors, (74), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 03:10:11,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 03:10:11,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:11,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:10:11,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:11,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:11,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1880363651, now seen corresponding path program 1 times [2024-10-14 03:10:11,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:11,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547877966] [2024-10-14 03:10:11,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:11,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:10:11,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:11,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547877966] [2024-10-14 03:10:11,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547877966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:11,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:11,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:10:11,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921912658] [2024-10-14 03:10:11,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:11,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:10:11,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:11,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:10:11,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:10:11,552 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.574468085106383) internal successors, (74), 55 states have internal predecessors, (74), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:10:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:11,621 INFO L93 Difference]: Finished difference Result 128 states and 189 transitions. [2024-10-14 03:10:11,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:10:11,623 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 03:10:11,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:11,632 INFO L225 Difference]: With dead ends: 128 [2024-10-14 03:10:11,632 INFO L226 Difference]: Without dead ends: 60 [2024-10-14 03:10:11,635 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-10-14 03:10:11,640 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:11,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:10:11,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-14 03:10:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-14 03:10:11,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 51 states have internal predecessors, (64), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 03:10:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2024-10-14 03:10:11,675 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 12 [2024-10-14 03:10:11,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:11,676 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2024-10-14 03:10:11,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:10:11,676 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2024-10-14 03:10:11,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 03:10:11,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:11,677 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:10:11,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:10:11,678 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:11,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:11,679 INFO L85 PathProgramCache]: Analyzing trace with hash 672199937, now seen corresponding path program 1 times [2024-10-14 03:10:11,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:11,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121665356] [2024-10-14 03:10:11,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:11,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:10:11,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:11,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121665356] [2024-10-14 03:10:11,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121665356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:11,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:11,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:10:11,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723212706] [2024-10-14 03:10:11,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:11,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:10:11,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:11,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:10:11,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:10:11,774 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:10:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:11,810 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2024-10-14 03:10:11,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:10:11,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 03:10:11,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:11,811 INFO L225 Difference]: With dead ends: 93 [2024-10-14 03:10:11,812 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 03:10:11,812 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-10-14 03:10:11,813 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:11,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 106 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:10:11,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 03:10:11,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-14 03:10:11,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 46 states have internal predecessors, (58), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 03:10:11,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2024-10-14 03:10:11,822 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 13 [2024-10-14 03:10:11,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:11,822 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2024-10-14 03:10:11,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:10:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2024-10-14 03:10:11,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 03:10:11,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:11,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:10:11,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:10:11,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:11,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:11,825 INFO L85 PathProgramCache]: Analyzing trace with hash 199184816, now seen corresponding path program 1 times [2024-10-14 03:10:11,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:11,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234325876] [2024-10-14 03:10:11,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:11,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:10:11,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234325876] [2024-10-14 03:10:11,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234325876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:11,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:11,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:10:11,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741016030] [2024-10-14 03:10:11,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:11,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:10:11,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:11,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:10:11,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:10:11,939 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:10:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:11,978 INFO L93 Difference]: Finished difference Result 102 states and 143 transitions. [2024-10-14 03:10:11,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:10:11,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 03:10:11,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:11,983 INFO L225 Difference]: With dead ends: 102 [2024-10-14 03:10:11,983 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 03:10:11,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-14 03:10:11,986 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:11,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 58 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:10:11,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 03:10:11,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-14 03:10:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 46 states have internal predecessors, (57), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 03:10:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-14 03:10:11,999 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 16 [2024-10-14 03:10:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:11,999 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-14 03:10:12,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:10:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-14 03:10:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 03:10:12,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:12,001 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] [2024-10-14 03:10:12,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:10:12,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:12,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:12,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1023137457, now seen corresponding path program 1 times [2024-10-14 03:10:12,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:12,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456920790] [2024-10-14 03:10:12,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:12,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:10:12,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:12,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456920790] [2024-10-14 03:10:12,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456920790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:12,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:12,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:10:12,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815727551] [2024-10-14 03:10:12,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:12,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:10:12,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:12,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:10:12,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:10:12,117 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:10:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:12,188 INFO L93 Difference]: Finished difference Result 137 states and 190 transitions. [2024-10-14 03:10:12,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:10:12,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 03:10:12,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:12,191 INFO L225 Difference]: With dead ends: 137 [2024-10-14 03:10:12,191 INFO L226 Difference]: Without dead ends: 87 [2024-10-14 03:10:12,192 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-10-14 03:10:12,193 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 45 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:12,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 101 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:10:12,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-14 03:10:12,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-10-14 03:10:12,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.40625) internal successors, (90), 72 states have internal predecessors, (90), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-10-14 03:10:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 114 transitions. [2024-10-14 03:10:12,232 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 114 transitions. Word has length 21 [2024-10-14 03:10:12,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:12,232 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 114 transitions. [2024-10-14 03:10:12,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:10:12,233 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2024-10-14 03:10:12,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 03:10:12,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:12,234 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] [2024-10-14 03:10:12,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:10:12,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:12,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:12,235 INFO L85 PathProgramCache]: Analyzing trace with hash 20628466, now seen corresponding path program 1 times [2024-10-14 03:10:12,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:12,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8116560] [2024-10-14 03:10:12,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:12,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:12,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:10:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:10:12,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:12,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8116560] [2024-10-14 03:10:12,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8116560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:12,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:12,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:10:12,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107081629] [2024-10-14 03:10:12,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:12,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:10:12,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:12,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:10:12,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:10:12,382 INFO L87 Difference]: Start difference. First operand 85 states and 114 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-10-14 03:10:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:12,530 INFO L93 Difference]: Finished difference Result 186 states and 256 transitions. [2024-10-14 03:10:12,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:10:12,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 30 [2024-10-14 03:10:12,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:12,533 INFO L225 Difference]: With dead ends: 186 [2024-10-14 03:10:12,533 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 03:10:12,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:10:12,535 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 43 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:12,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 137 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:10:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 03:10:12,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2024-10-14 03:10:12,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 85 states have internal predecessors, (107), 10 states have call successors, (10), 10 states have call predecessors, (10), 13 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2024-10-14 03:10:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 134 transitions. [2024-10-14 03:10:12,559 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 134 transitions. Word has length 30 [2024-10-14 03:10:12,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:12,561 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 134 transitions. [2024-10-14 03:10:12,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-10-14 03:10:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 134 transitions. [2024-10-14 03:10:12,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 03:10:12,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:12,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:10:12,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:10:12,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:12,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:12,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1092666458, now seen corresponding path program 1 times [2024-10-14 03:10:12,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:12,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894492213] [2024-10-14 03:10:12,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:12,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:12,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:10:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:12,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:10:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:10:12,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:12,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894492213] [2024-10-14 03:10:12,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894492213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:12,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:12,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:10:12,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830298796] [2024-10-14 03:10:12,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:12,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:10:12,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:12,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:10:12,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:10:12,699 INFO L87 Difference]: Start difference. First operand 101 states and 134 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:10:12,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:12,872 INFO L93 Difference]: Finished difference Result 105 states and 136 transitions. [2024-10-14 03:10:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:10:12,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-14 03:10:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:12,874 INFO L225 Difference]: With dead ends: 105 [2024-10-14 03:10:12,875 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 03:10:12,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:10:12,877 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 89 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:12,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 137 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:10:12,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 03:10:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2024-10-14 03:10:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 85 states have internal predecessors, (105), 10 states have call successors, (10), 10 states have call predecessors, (10), 13 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2024-10-14 03:10:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 132 transitions. [2024-10-14 03:10:12,902 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 132 transitions. Word has length 31 [2024-10-14 03:10:12,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:12,904 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 132 transitions. [2024-10-14 03:10:12,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:10:12,905 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 132 transitions. [2024-10-14 03:10:12,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 03:10:12,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:12,906 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] [2024-10-14 03:10:12,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:10:12,907 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:12,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:12,907 INFO L85 PathProgramCache]: Analyzing trace with hash 565825264, now seen corresponding path program 1 times [2024-10-14 03:10:12,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:12,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177239897] [2024-10-14 03:10:12,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:12,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:12,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:10:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:13,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:10:13,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:13,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177239897] [2024-10-14 03:10:13,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177239897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:13,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:13,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:10:13,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753462386] [2024-10-14 03:10:13,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:13,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:10:13,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:13,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:10:13,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:10:13,016 INFO L87 Difference]: Start difference. First operand 101 states and 132 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-10-14 03:10:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:13,163 INFO L93 Difference]: Finished difference Result 204 states and 274 transitions. [2024-10-14 03:10:13,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:10:13,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 30 [2024-10-14 03:10:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:13,165 INFO L225 Difference]: With dead ends: 204 [2024-10-14 03:10:13,166 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 03:10:13,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:10:13,167 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 105 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:13,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 137 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:10:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 03:10:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2024-10-14 03:10:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 87 states have internal predecessors, (107), 10 states have call successors, (10), 10 states have call predecessors, (10), 13 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2024-10-14 03:10:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 134 transitions. [2024-10-14 03:10:13,187 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 134 transitions. Word has length 30 [2024-10-14 03:10:13,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:13,188 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 134 transitions. [2024-10-14 03:10:13,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-10-14 03:10:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 134 transitions. [2024-10-14 03:10:13,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 03:10:13,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:13,191 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] [2024-10-14 03:10:13,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:10:13,192 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:13,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:13,192 INFO L85 PathProgramCache]: Analyzing trace with hash -445291986, now seen corresponding path program 1 times [2024-10-14 03:10:13,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:13,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103231133] [2024-10-14 03:10:13,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:13,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:13,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:10:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:10:13,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:13,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103231133] [2024-10-14 03:10:13,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103231133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:13,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:13,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:10:13,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259149250] [2024-10-14 03:10:13,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:13,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:10:13,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:13,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:10:13,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:10:13,282 INFO L87 Difference]: Start difference. First operand 103 states and 134 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-10-14 03:10:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:13,478 INFO L93 Difference]: Finished difference Result 299 states and 411 transitions. [2024-10-14 03:10:13,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:10:13,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 30 [2024-10-14 03:10:13,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:13,481 INFO L225 Difference]: With dead ends: 299 [2024-10-14 03:10:13,482 INFO L226 Difference]: Without dead ends: 198 [2024-10-14 03:10:13,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:10:13,484 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 162 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:13,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 162 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:10:13,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-14 03:10:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2024-10-14 03:10:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 148 states have (on average 1.3108108108108107) internal successors, (194), 160 states have internal predecessors, (194), 23 states have call successors, (23), 23 states have call predecessors, (23), 24 states have return successors, (42), 23 states have call predecessors, (42), 23 states have call successors, (42) [2024-10-14 03:10:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 259 transitions. [2024-10-14 03:10:13,522 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 259 transitions. Word has length 30 [2024-10-14 03:10:13,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:13,522 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 259 transitions. [2024-10-14 03:10:13,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-10-14 03:10:13,523 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 259 transitions. [2024-10-14 03:10:13,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 03:10:13,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:13,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:10:13,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:10:13,525 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:13,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:13,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1592998548, now seen corresponding path program 1 times [2024-10-14 03:10:13,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:13,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988688611] [2024-10-14 03:10:13,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:13,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:10:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:13,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:10:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:10:13,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:13,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988688611] [2024-10-14 03:10:13,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988688611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:13,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:13,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:10:13,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727404204] [2024-10-14 03:10:13,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:13,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:10:13,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:13,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:10:13,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:10:13,601 INFO L87 Difference]: Start difference. First operand 196 states and 259 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:10:13,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:13,936 INFO L93 Difference]: Finished difference Result 408 states and 560 transitions. [2024-10-14 03:10:13,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:10:13,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 3 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 34 [2024-10-14 03:10:13,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:13,939 INFO L225 Difference]: With dead ends: 408 [2024-10-14 03:10:13,939 INFO L226 Difference]: Without dead ends: 251 [2024-10-14 03:10:13,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:10:13,944 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 151 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:13,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 208 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:10:13,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-14 03:10:13,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 226. [2024-10-14 03:10:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 171 states have (on average 1.286549707602339) internal successors, (220), 187 states have internal predecessors, (220), 25 states have call successors, (25), 23 states have call predecessors, (25), 29 states have return successors, (54), 27 states have call predecessors, (54), 25 states have call successors, (54) [2024-10-14 03:10:14,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 299 transitions. [2024-10-14 03:10:14,001 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 299 transitions. Word has length 34 [2024-10-14 03:10:14,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:14,002 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 299 transitions. [2024-10-14 03:10:14,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:10:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 299 transitions. [2024-10-14 03:10:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:10:14,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:14,007 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:10:14,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:10:14,008 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:14,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:14,009 INFO L85 PathProgramCache]: Analyzing trace with hash -98642546, now seen corresponding path program 1 times [2024-10-14 03:10:14,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:14,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979783591] [2024-10-14 03:10:14,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:14,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:14,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:10:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:14,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:10:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:14,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:10:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:14,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:10:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:14,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:10:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:10:14,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:14,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979783591] [2024-10-14 03:10:14,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979783591] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:10:14,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055462378] [2024-10-14 03:10:14,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:14,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:10:14,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:10:14,179 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:10:14,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:10:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:14,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 03:10:14,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:10:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:10:14,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:10:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:10:14,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055462378] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:10:14,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:10:14,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 8 [2024-10-14 03:10:14,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538526747] [2024-10-14 03:10:14,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:10:14,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:10:14,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:14,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:10:14,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:10:14,500 INFO L87 Difference]: Start difference. First operand 226 states and 299 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:10:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:14,932 INFO L93 Difference]: Finished difference Result 573 states and 800 transitions. [2024-10-14 03:10:14,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 03:10:14,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2024-10-14 03:10:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:14,935 INFO L225 Difference]: With dead ends: 573 [2024-10-14 03:10:14,935 INFO L226 Difference]: Without dead ends: 349 [2024-10-14 03:10:14,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2024-10-14 03:10:14,937 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 221 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:14,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 247 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:10:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-14 03:10:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 307. [2024-10-14 03:10:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 230 states have (on average 1.2869565217391303) internal successors, (296), 252 states have internal predecessors, (296), 36 states have call successors, (36), 33 states have call predecessors, (36), 40 states have return successors, (82), 36 states have call predecessors, (82), 36 states have call successors, (82) [2024-10-14 03:10:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 414 transitions. [2024-10-14 03:10:14,981 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 414 transitions. Word has length 63 [2024-10-14 03:10:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:14,983 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 414 transitions. [2024-10-14 03:10:14,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:10:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 414 transitions. [2024-10-14 03:10:14,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:10:14,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:14,988 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:10:15,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 03:10:15,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 03:10:15,189 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:15,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:15,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1699670828, now seen corresponding path program 2 times [2024-10-14 03:10:15,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:15,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007353687] [2024-10-14 03:10:15,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:15,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:15,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:10:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:15,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:10:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:15,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:10:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:15,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 03:10:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:15,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:10:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:15,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:10:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:15,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:10:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:15,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:10:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 44 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 03:10:15,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:15,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007353687] [2024-10-14 03:10:15,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007353687] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:10:15,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664529602] [2024-10-14 03:10:15,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 03:10:15,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:10:15,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:10:15,480 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:10:15,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:10:15,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 03:10:15,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 03:10:15,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 03:10:15,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:10:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 03:10:15,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:10:15,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664529602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:15,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:10:15,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-14 03:10:15,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418705996] [2024-10-14 03:10:15,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:15,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:10:15,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:15,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:10:15,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:10:15,666 INFO L87 Difference]: Start difference. First operand 307 states and 414 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 03:10:15,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:15,858 INFO L93 Difference]: Finished difference Result 807 states and 1150 transitions. [2024-10-14 03:10:15,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:10:15,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2024-10-14 03:10:15,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:15,862 INFO L225 Difference]: With dead ends: 807 [2024-10-14 03:10:15,863 INFO L226 Difference]: Without dead ends: 539 [2024-10-14 03:10:15,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:10:15,865 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 89 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:15,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 309 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:10:15,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-10-14 03:10:15,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 520. [2024-10-14 03:10:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 391 states have (on average 1.278772378516624) internal successors, (500), 421 states have internal predecessors, (500), 62 states have call successors, (62), 59 states have call predecessors, (62), 66 states have return successors, (126), 61 states have call predecessors, (126), 62 states have call successors, (126) [2024-10-14 03:10:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 688 transitions. [2024-10-14 03:10:15,913 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 688 transitions. Word has length 92 [2024-10-14 03:10:15,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:15,914 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 688 transitions. [2024-10-14 03:10:15,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 03:10:15,914 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 688 transitions. [2024-10-14 03:10:15,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:10:15,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:15,917 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-14 03:10:15,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 03:10:16,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 03:10:16,122 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:16,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:16,122 INFO L85 PathProgramCache]: Analyzing trace with hash -806184490, now seen corresponding path program 1 times [2024-10-14 03:10:16,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:16,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316946667] [2024-10-14 03:10:16,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:16,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:16,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:10:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:16,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:10:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:16,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:10:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:16,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 03:10:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:16,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:10:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:16,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:10:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:16,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:10:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:16,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:10:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:10:16,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:16,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316946667] [2024-10-14 03:10:16,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316946667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:16,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:16,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:10:16,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715274990] [2024-10-14 03:10:16,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:16,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:10:16,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:16,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:10:16,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:10:16,239 INFO L87 Difference]: Start difference. First operand 520 states and 688 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 03:10:16,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:16,406 INFO L93 Difference]: Finished difference Result 722 states and 938 transitions. [2024-10-14 03:10:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:10:16,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 92 [2024-10-14 03:10:16,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:16,408 INFO L225 Difference]: With dead ends: 722 [2024-10-14 03:10:16,409 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 03:10:16,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:10:16,411 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 77 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:16,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 110 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:10:16,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 03:10:16,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 03:10:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:10:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 03:10:16,413 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2024-10-14 03:10:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:16,413 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 03:10:16,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 03:10:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 03:10:16,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 03:10:16,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:10:16,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:10:16,419 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:10:16,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 03:10:17,412 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:10:17,442 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (<= 2 |old(~waterLevel~0)|)) (and .cse0 (= |old(~pumpRunning~0)| 0) (<= 1 |old(~waterLevel~0)|))))) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~pumpRunning~0 0) .cse0 (<= 1 ~waterLevel~0)) (and (<= 2 ~waterLevel~0) .cse0))) [2024-10-14 03:10:17,447 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 0) (= 1 ~systemActive~0) (= |old(~pumpRunning~0)| 0) (<= 1 ~waterLevel~0)) Eliminated clause: (and (= ~pumpRunning~0 0) (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)) [2024-10-14 03:10:17,450 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (<= 2 |old(~waterLevel~0)|)) (and (= ~pumpRunning~0 0) .cse0 (<= 1 |old(~waterLevel~0)|)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~pumpRunning~0 0) .cse0 (<= 1 ~waterLevel~0)) (and (<= 2 ~waterLevel~0) .cse0))) [2024-10-14 03:10:17,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:10:17 BoogieIcfgContainer [2024-10-14 03:10:17,453 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:10:17,454 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:10:17,454 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:10:17,454 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:10:17,455 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:10:11" (3/4) ... [2024-10-14 03:10:17,457 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 03:10:17,460 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-14 03:10:17,461 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-14 03:10:17,461 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-14 03:10:17,461 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-14 03:10:17,461 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-10-14 03:10:17,461 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-14 03:10:17,470 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2024-10-14 03:10:17,472 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-14 03:10:17,473 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 03:10:17,473 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 03:10:17,474 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 03:10:17,590 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:10:17,593 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 03:10:17,593 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:10:17,594 INFO L158 Benchmark]: Toolchain (without parser) took 7476.09ms. Allocated memory was 161.5MB in the beginning and 197.1MB in the end (delta: 35.7MB). Free memory was 92.4MB in the beginning and 101.3MB in the end (delta: -8.8MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-10-14 03:10:17,594 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 78.7MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:10:17,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.64ms. Allocated memory is still 161.5MB. Free memory was 92.1MB in the beginning and 71.6MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 03:10:17,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.04ms. Allocated memory is still 161.5MB. Free memory was 71.6MB in the beginning and 69.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:10:17,595 INFO L158 Benchmark]: Boogie Preprocessor took 78.97ms. Allocated memory is still 161.5MB. Free memory was 69.3MB in the beginning and 133.1MB in the end (delta: -63.8MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-10-14 03:10:17,595 INFO L158 Benchmark]: RCFGBuilder took 505.32ms. Allocated memory is still 161.5MB. Free memory was 133.1MB in the beginning and 108.3MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 03:10:17,595 INFO L158 Benchmark]: TraceAbstraction took 6248.10ms. Allocated memory was 161.5MB in the beginning and 197.1MB in the end (delta: 35.7MB). Free memory was 107.9MB in the beginning and 108.6MB in the end (delta: -696.3kB). Peak memory consumption was 93.7MB. Max. memory is 16.1GB. [2024-10-14 03:10:17,596 INFO L158 Benchmark]: Witness Printer took 139.50ms. Allocated memory is still 197.1MB. Free memory was 108.6MB in the beginning and 101.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 03:10:17,597 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.18ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 78.7MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.64ms. Allocated memory is still 161.5MB. Free memory was 92.1MB in the beginning and 71.6MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.04ms. Allocated memory is still 161.5MB. Free memory was 71.6MB in the beginning and 69.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.97ms. Allocated memory is still 161.5MB. Free memory was 69.3MB in the beginning and 133.1MB in the end (delta: -63.8MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * RCFGBuilder took 505.32ms. Allocated memory is still 161.5MB. Free memory was 133.1MB in the beginning and 108.3MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6248.10ms. Allocated memory was 161.5MB in the beginning and 197.1MB in the end (delta: 35.7MB). Free memory was 107.9MB in the beginning and 108.6MB in the end (delta: -696.3kB). Peak memory consumption was 93.7MB. Max. memory is 16.1GB. * Witness Printer took 139.50ms. Allocated memory is still 197.1MB. Free memory was 108.6MB in the beginning and 101.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] - GenericResultAtLocation [Line: 118]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [118] - GenericResultAtLocation [Line: 343]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [343] - GenericResultAtLocation [Line: 371]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [371] - GenericResultAtLocation [Line: 474]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [474] - GenericResultAtLocation [Line: 512]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [512] - GenericResultAtLocation [Line: 608]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [608] - GenericResultAtLocation [Line: 974]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [974] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 979]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1075 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1053 mSDsluCounter, 1786 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1109 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1451 IncrementalHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 677 mSDtfsCounter, 1451 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 290 SyntacticMatches, 9 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=520occurred in iteration=11, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 96 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 619 NumberOfCodeBlocks, 619 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 667 ConstructedInterpolants, 0 QuantifiedInterpolants, 1303 SizeOfPredicates, 3 NumberOfNonLiveVariables, 544 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 224/249 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 63]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 524]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: ((((2 <= waterLevel) && (1 == systemActive)) && (splverifierCounter == 0)) || ((((pumpRunning == 0) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) - ProcedureContractResult [Line: 156]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) Ensures: (((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) - ProcedureContractResult [Line: 398]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) Ensures: ((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) - ProcedureContractResult [Line: 514]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 132]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) Ensures: (((((1 == systemActive) && (\old(pumpRunning) == 0)) || ((1 == systemActive) && (2 <= \old(waterLevel)))) && ((1 < waterLevel) || ((pumpRunning == 0) && (waterLevel == 1)))) && ((\old(pumpRunning) != 0) || (\old(waterLevel) == waterLevel))) - ProcedureContractResult [Line: 164]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: (((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) Ensures: ((((1 == systemActive) && (\old(pumpRunning) == 0)) && ((waterLevel != 1) || (pumpRunning == 0))) && (1 <= waterLevel)) - ProcedureContractResult [Line: 386]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) Ensures: ((((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel)) && (2 <= waterLevel)) && (((1 == systemActive) && (2 <= \old(waterLevel))) || (((pumpRunning == 0) && (1 == systemActive)) && (1 <= \old(waterLevel))))) RESULT: Ultimate proved your program to be correct! [2024-10-14 03:10:17,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE