./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_spec1_product48.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_spec1_product48.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 ae2f7a85a5093ad80fd05f69a7d0bbcf9a510999a9154b6f2d8037f035f00930 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:39:27,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:39:27,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:39:27,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:39:27,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:39:27,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:39:27,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:39:27,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:39:27,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:39:27,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:39:27,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:39:27,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:39:27,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:39:27,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:39:27,160 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:39:27,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:39:27,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:39:27,161 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:39:27,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:39:27,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:39:27,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:39:27,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:39:27,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:39:27,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:39:27,163 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:39:27,163 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:39:27,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:39:27,163 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:39:27,163 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:39:27,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:39:27,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:39:27,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:39:27,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:39:27,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:39:27,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:39:27,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:39:27,165 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:39:27,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:39:27,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:39:27,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:39:27,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:39:27,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:39:27,168 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 -> ae2f7a85a5093ad80fd05f69a7d0bbcf9a510999a9154b6f2d8037f035f00930 [2024-10-12 19:39:27,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:39:27,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:39:27,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:39:27,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:39:27,385 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:39:27,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product48.cil.c [2024-10-12 19:39:28,617 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:39:28,797 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:39:28,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product48.cil.c [2024-10-12 19:39:28,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821ade572/1699e14642d349d59c505bd96f1f67eb/FLAG401eb70f6 [2024-10-12 19:39:28,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821ade572/1699e14642d349d59c505bd96f1f67eb [2024-10-12 19:39:28,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:39:28,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:39:28,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:39:28,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:39:28,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:39:28,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:39:28" (1/1) ... [2024-10-12 19:39:28,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18657c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:28, skipping insertion in model container [2024-10-12 19:39:28,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:39:28" (1/1) ... [2024-10-12 19:39:28,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:39:29,127 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_spec1_product48.cil.c[17123,17136] [2024-10-12 19:39:29,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:39:29,152 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:39:29,160 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2024-10-12 19:39:29,161 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [150] [2024-10-12 19:39:29,161 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [252] [2024-10-12 19:39:29,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [618] [2024-10-12 19:39:29,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [646] [2024-10-12 19:39:29,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [868] [2024-10-12 19:39:29,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [877] [2024-10-12 19:39:29,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [946] [2024-10-12 19:39:29,215 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_spec1_product48.cil.c[17123,17136] [2024-10-12 19:39:29,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:39:29,243 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:39:29,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29 WrapperNode [2024-10-12 19:39:29,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:39:29,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:39:29,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:39:29,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:39:29,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,279 INFO L138 Inliner]: procedures = 56, calls = 102, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 191 [2024-10-12 19:39:29,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:39:29,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:39:29,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:39:29,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:39:29,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,315 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-12 19:39:29,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,319 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:39:29,325 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:39:29,325 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:39:29,326 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:39:29,326 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:39:29,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:39:29,353 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-12 19:39:29,355 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-12 19:39:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:39:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-12 19:39:29,393 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-12 19:39:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:39:29,393 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:39:29,394 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:39:29,394 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:39:29,394 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-12 19:39:29,394 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-12 19:39:29,394 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-12 19:39:29,394 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-12 19:39:29,394 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2024-10-12 19:39:29,394 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2024-10-12 19:39:29,394 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2024-10-12 19:39:29,394 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2024-10-12 19:39:29,394 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-10-12 19:39:29,394 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-10-12 19:39:29,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:39:29,395 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-12 19:39:29,395 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-12 19:39:29,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:39:29,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:39:29,454 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:39:29,457 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:39:29,636 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-10-12 19:39:29,636 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:39:29,694 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:39:29,694 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 19:39:29,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:39:29 BoogieIcfgContainer [2024-10-12 19:39:29,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:39:29,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:39:29,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:39:29,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:39:29,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:39:28" (1/3) ... [2024-10-12 19:39:29,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df5b86e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:39:29, skipping insertion in model container [2024-10-12 19:39:29,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (2/3) ... [2024-10-12 19:39:29,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df5b86e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:39:29, skipping insertion in model container [2024-10-12 19:39:29,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:39:29" (3/3) ... [2024-10-12 19:39:29,706 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product48.cil.c [2024-10-12 19:39:29,721 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:39:29,721 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:39:29,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:39:29,769 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;@9c8db05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:39:29,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:39:29,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.5) internal successors, (81), 63 states have internal predecessors, (81), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-12 19:39:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 19:39:29,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:29,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:29,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:29,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:29,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1686108372, now seen corresponding path program 1 times [2024-10-12 19:39:29,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:29,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872099464] [2024-10-12 19:39:29,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:29,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:29,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:39:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:29,963 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-12 19:39:29,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:29,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872099464] [2024-10-12 19:39:29,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872099464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:29,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:29,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:39:29,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405051023] [2024-10-12 19:39:29,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:29,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:39:29,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:29,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:39:29,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:39:29,993 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.5) internal successors, (81), 63 states have internal predecessors, (81), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:30,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:30,049 INFO L93 Difference]: Finished difference Result 160 states and 227 transitions. [2024-10-12 19:39:30,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:39:30,052 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-12 19:39:30,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:30,071 INFO L225 Difference]: With dead ends: 160 [2024-10-12 19:39:30,072 INFO L226 Difference]: Without dead ends: 76 [2024-10-12 19:39:30,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:39:30,077 INFO L432 NwaCegarLoop]: 93 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, 93 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-12 19:39:30,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:39:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-12 19:39:30,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-12 19:39:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.392156862745098) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-12 19:39:30,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2024-10-12 19:39:30,138 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 16 [2024-10-12 19:39:30,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:30,138 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2024-10-12 19:39:30,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:30,138 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2024-10-12 19:39:30,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 19:39:30,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:30,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:30,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:39:30,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:30,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:30,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1708652508, now seen corresponding path program 1 times [2024-10-12 19:39:30,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:30,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639683804] [2024-10-12 19:39:30,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:30,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:39:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,217 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-12 19:39:30,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:30,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639683804] [2024-10-12 19:39:30,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639683804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:30,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:30,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:39:30,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246255788] [2024-10-12 19:39:30,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:30,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:39:30,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:30,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:39:30,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:30,223 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:30,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:30,256 INFO L93 Difference]: Finished difference Result 122 states and 162 transitions. [2024-10-12 19:39:30,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:39:30,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-12 19:39:30,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:30,257 INFO L225 Difference]: With dead ends: 122 [2024-10-12 19:39:30,257 INFO L226 Difference]: Without dead ends: 68 [2024-10-12 19:39:30,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:30,261 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:30,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 142 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:39:30,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-12 19:39:30,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-12 19:39:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-12 19:39:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 91 transitions. [2024-10-12 19:39:30,273 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 91 transitions. Word has length 17 [2024-10-12 19:39:30,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:30,273 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 91 transitions. [2024-10-12 19:39:30,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:30,273 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2024-10-12 19:39:30,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 19:39:30,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:30,274 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] [2024-10-12 19:39:30,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:39:30,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:30,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:30,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2024705190, now seen corresponding path program 1 times [2024-10-12 19:39:30,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:30,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204619281] [2024-10-12 19:39:30,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:30,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,353 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-12 19:39:30,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:30,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204619281] [2024-10-12 19:39:30,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204619281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:30,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:30,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:39:30,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702158745] [2024-10-12 19:39:30,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:30,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:39:30,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:30,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:39:30,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:30,357 INFO L87 Difference]: Start difference. First operand 68 states and 91 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-12 19:39:30,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:30,406 INFO L93 Difference]: Finished difference Result 200 states and 270 transitions. [2024-10-12 19:39:30,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:39:30,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2024-10-12 19:39:30,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:30,408 INFO L225 Difference]: With dead ends: 200 [2024-10-12 19:39:30,409 INFO L226 Difference]: Without dead ends: 134 [2024-10-12 19:39:30,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:30,410 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 85 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:30,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 168 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:39:30,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-12 19:39:30,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2024-10-12 19:39:30,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 103 states have internal predecessors, (125), 26 states have call successors, (26), 16 states have call predecessors, (26), 16 states have return successors, (26), 19 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-12 19:39:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 177 transitions. [2024-10-12 19:39:30,425 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 177 transitions. Word has length 20 [2024-10-12 19:39:30,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:30,425 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 177 transitions. [2024-10-12 19:39:30,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-12 19:39:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 177 transitions. [2024-10-12 19:39:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 19:39:30,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:30,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:30,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:39:30,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:30,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:30,427 INFO L85 PathProgramCache]: Analyzing trace with hash -580841390, now seen corresponding path program 1 times [2024-10-12 19:39:30,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:30,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618828255] [2024-10-12 19:39:30,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:30,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:39:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,522 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-12 19:39:30,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:30,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618828255] [2024-10-12 19:39:30,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618828255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:30,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:30,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:39:30,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621052010] [2024-10-12 19:39:30,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:30,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:39:30,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:30,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:39:30,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:39:30,524 INFO L87 Difference]: Start difference. First operand 131 states and 177 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-12 19:39:30,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:30,605 INFO L93 Difference]: Finished difference Result 344 states and 471 transitions. [2024-10-12 19:39:30,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:39:30,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 23 [2024-10-12 19:39:30,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:30,608 INFO L225 Difference]: With dead ends: 344 [2024-10-12 19:39:30,608 INFO L226 Difference]: Without dead ends: 215 [2024-10-12 19:39:30,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:39:30,610 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 53 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:30,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 205 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:39:30,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-12 19:39:30,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2024-10-12 19:39:30,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 147 states have (on average 1.3537414965986394) internal successors, (199), 164 states have internal predecessors, (199), 36 states have call successors, (36), 30 states have call predecessors, (36), 30 states have return successors, (44), 33 states have call predecessors, (44), 36 states have call successors, (44) [2024-10-12 19:39:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 279 transitions. [2024-10-12 19:39:30,640 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 279 transitions. Word has length 23 [2024-10-12 19:39:30,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:30,640 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 279 transitions. [2024-10-12 19:39:30,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-12 19:39:30,641 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 279 transitions. [2024-10-12 19:39:30,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 19:39:30,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:30,642 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:30,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:39:30,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:30,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:30,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1711075594, now seen corresponding path program 1 times [2024-10-12 19:39:30,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:30,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429672694] [2024-10-12 19:39:30,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:30,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:39:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:39:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:39:30,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:30,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429672694] [2024-10-12 19:39:30,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429672694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:30,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:30,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:39:30,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184339992] [2024-10-12 19:39:30,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:30,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:39:30,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:30,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:39:30,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:39:30,733 INFO L87 Difference]: Start difference. First operand 214 states and 279 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:39:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:30,875 INFO L93 Difference]: Finished difference Result 468 states and 625 transitions. [2024-10-12 19:39:30,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:39:30,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-10-12 19:39:30,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:30,878 INFO L225 Difference]: With dead ends: 468 [2024-10-12 19:39:30,881 INFO L226 Difference]: Without dead ends: 256 [2024-10-12 19:39:30,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:39:30,883 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 49 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:30,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 186 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:39:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-12 19:39:30,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2024-10-12 19:39:30,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 177 states have (on average 1.3276836158192091) internal successors, (235), 194 states have internal predecessors, (235), 40 states have call successors, (40), 30 states have call predecessors, (40), 36 states have return successors, (54), 41 states have call predecessors, (54), 40 states have call successors, (54) [2024-10-12 19:39:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 329 transitions. [2024-10-12 19:39:30,925 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 329 transitions. Word has length 42 [2024-10-12 19:39:30,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:30,926 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 329 transitions. [2024-10-12 19:39:30,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:39:30,926 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 329 transitions. [2024-10-12 19:39:30,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 19:39:30,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:30,931 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:30,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:39:30,931 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:30,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:30,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1577062088, now seen corresponding path program 1 times [2024-10-12 19:39:30,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:30,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133995304] [2024-10-12 19:39:30,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:30,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:39:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:39:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:39:31,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:31,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133995304] [2024-10-12 19:39:31,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133995304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:31,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:31,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:39:31,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573382935] [2024-10-12 19:39:31,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:31,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:39:31,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:31,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:39:31,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:39:31,024 INFO L87 Difference]: Start difference. First operand 254 states and 329 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:39:31,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:31,169 INFO L93 Difference]: Finished difference Result 512 states and 679 transitions. [2024-10-12 19:39:31,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:39:31,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-10-12 19:39:31,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:31,171 INFO L225 Difference]: With dead ends: 512 [2024-10-12 19:39:31,171 INFO L226 Difference]: Without dead ends: 260 [2024-10-12 19:39:31,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:39:31,173 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 49 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:31,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 184 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:39:31,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-12 19:39:31,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2024-10-12 19:39:31,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 181 states have (on average 1.3204419889502763) internal successors, (239), 198 states have internal predecessors, (239), 40 states have call successors, (40), 30 states have call predecessors, (40), 36 states have return successors, (54), 41 states have call predecessors, (54), 40 states have call successors, (54) [2024-10-12 19:39:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 333 transitions. [2024-10-12 19:39:31,188 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 333 transitions. Word has length 42 [2024-10-12 19:39:31,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:31,188 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 333 transitions. [2024-10-12 19:39:31,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:39:31,188 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 333 transitions. [2024-10-12 19:39:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 19:39:31,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:31,189 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:31,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:39:31,189 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:31,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:31,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1639101702, now seen corresponding path program 1 times [2024-10-12 19:39:31,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:31,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938534248] [2024-10-12 19:39:31,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:31,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:39:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:39:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:39:31,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:31,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938534248] [2024-10-12 19:39:31,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938534248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:31,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:31,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:39:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420400163] [2024-10-12 19:39:31,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:31,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:39:31,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:31,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:39:31,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:39:31,259 INFO L87 Difference]: Start difference. First operand 258 states and 333 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 19:39:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:31,457 INFO L93 Difference]: Finished difference Result 734 states and 987 transitions. [2024-10-12 19:39:31,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:39:31,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 42 [2024-10-12 19:39:31,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:31,461 INFO L225 Difference]: With dead ends: 734 [2024-10-12 19:39:31,461 INFO L226 Difference]: Without dead ends: 478 [2024-10-12 19:39:31,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 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-12 19:39:31,463 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 194 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:31,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 200 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:39:31,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-12 19:39:31,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 472. [2024-10-12 19:39:31,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 335 states have (on average 1.2895522388059701) internal successors, (432), 361 states have internal predecessors, (432), 71 states have call successors, (71), 63 states have call predecessors, (71), 65 states have return successors, (109), 70 states have call predecessors, (109), 71 states have call successors, (109) [2024-10-12 19:39:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 612 transitions. [2024-10-12 19:39:31,494 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 612 transitions. Word has length 42 [2024-10-12 19:39:31,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:31,494 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 612 transitions. [2024-10-12 19:39:31,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 19:39:31,494 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 612 transitions. [2024-10-12 19:39:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 19:39:31,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:31,495 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:31,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:39:31,496 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:31,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:31,496 INFO L85 PathProgramCache]: Analyzing trace with hash 558773676, now seen corresponding path program 1 times [2024-10-12 19:39:31,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:31,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284459834] [2024-10-12 19:39:31,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:31,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:39:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:39:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:39:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:39:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 19:39:31,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:31,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284459834] [2024-10-12 19:39:31,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284459834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:31,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:31,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:39:31,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478596833] [2024-10-12 19:39:31,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:31,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:39:31,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:31,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:39:31,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:39:31,606 INFO L87 Difference]: Start difference. First operand 472 states and 612 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:39:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:32,091 INFO L93 Difference]: Finished difference Result 1598 states and 2158 transitions. [2024-10-12 19:39:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 19:39:32,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2024-10-12 19:39:32,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:32,097 INFO L225 Difference]: With dead ends: 1598 [2024-10-12 19:39:32,097 INFO L226 Difference]: Without dead ends: 1128 [2024-10-12 19:39:32,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-10-12 19:39:32,100 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 262 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:32,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 253 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:39:32,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2024-10-12 19:39:32,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1092. [2024-10-12 19:39:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 767 states have (on average 1.2477183833116037) internal successors, (957), 834 states have internal predecessors, (957), 174 states have call successors, (174), 126 states have call predecessors, (174), 150 states have return successors, (300), 176 states have call predecessors, (300), 174 states have call successors, (300) [2024-10-12 19:39:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1431 transitions. [2024-10-12 19:39:32,174 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1431 transitions. Word has length 46 [2024-10-12 19:39:32,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:32,175 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1431 transitions. [2024-10-12 19:39:32,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:39:32,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1431 transitions. [2024-10-12 19:39:32,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 19:39:32,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:32,176 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:32,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:39:32,177 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:32,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:32,177 INFO L85 PathProgramCache]: Analyzing trace with hash -716256976, now seen corresponding path program 1 times [2024-10-12 19:39:32,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:32,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112528119] [2024-10-12 19:39:32,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:32,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:39:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:39:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:39:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:39:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:39:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 19:39:32,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:32,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112528119] [2024-10-12 19:39:32,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112528119] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:39:32,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022297035] [2024-10-12 19:39:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:32,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:39:32,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:39:32,319 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-12 19:39:32,320 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-12 19:39:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 19:39:32,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:39:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:32,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:39:32,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022297035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:32,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:39:32,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20 [2024-10-12 19:39:32,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591969852] [2024-10-12 19:39:32,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:32,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:39:32,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:32,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:39:32,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-10-12 19:39:32,558 INFO L87 Difference]: Start difference. First operand 1092 states and 1431 transitions. Second operand has 8 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 19:39:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:32,771 INFO L93 Difference]: Finished difference Result 2130 states and 2800 transitions. [2024-10-12 19:39:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:39:32,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2024-10-12 19:39:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:32,776 INFO L225 Difference]: With dead ends: 2130 [2024-10-12 19:39:32,776 INFO L226 Difference]: Without dead ends: 1040 [2024-10-12 19:39:32,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-10-12 19:39:32,779 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 60 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:32,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 822 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:39:32,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2024-10-12 19:39:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1040. [2024-10-12 19:39:32,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 729 states have (on average 1.2304526748971194) internal successors, (897), 794 states have internal predecessors, (897), 168 states have call successors, (168), 122 states have call predecessors, (168), 142 states have return successors, (262), 166 states have call predecessors, (262), 168 states have call successors, (262) [2024-10-12 19:39:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1327 transitions. [2024-10-12 19:39:32,831 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1327 transitions. Word has length 50 [2024-10-12 19:39:32,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:32,832 INFO L471 AbstractCegarLoop]: Abstraction has 1040 states and 1327 transitions. [2024-10-12 19:39:32,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 19:39:32,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1327 transitions. [2024-10-12 19:39:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 19:39:32,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:32,834 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:32,848 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-12 19:39:33,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:39:33,036 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:33,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:33,036 INFO L85 PathProgramCache]: Analyzing trace with hash -802654806, now seen corresponding path program 1 times [2024-10-12 19:39:33,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:33,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286564319] [2024-10-12 19:39:33,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:33,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:39:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:39:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:39:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:39:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:39:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:39:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:39:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 19:39:33,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:33,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286564319] [2024-10-12 19:39:33,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286564319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:33,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:33,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:39:33,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562117144] [2024-10-12 19:39:33,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:33,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:39:33,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:33,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:39:33,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:39:33,098 INFO L87 Difference]: Start difference. First operand 1040 states and 1327 transitions. Second operand has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 4 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-12 19:39:33,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:33,442 INFO L93 Difference]: Finished difference Result 1764 states and 2241 transitions. [2024-10-12 19:39:33,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:39:33,443 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 4 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 74 [2024-10-12 19:39:33,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:33,446 INFO L225 Difference]: With dead ends: 1764 [2024-10-12 19:39:33,447 INFO L226 Difference]: Without dead ends: 726 [2024-10-12 19:39:33,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:39:33,449 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 359 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:33,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 128 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:39:33,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-10-12 19:39:33,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 697. [2024-10-12 19:39:33,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 491 states have (on average 1.2219959266802445) internal successors, (600), 537 states have internal predecessors, (600), 109 states have call successors, (109), 86 states have call predecessors, (109), 96 states have return successors, (158), 107 states have call predecessors, (158), 109 states have call successors, (158) [2024-10-12 19:39:33,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 867 transitions. [2024-10-12 19:39:33,487 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 867 transitions. Word has length 74 [2024-10-12 19:39:33,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:33,487 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 867 transitions. [2024-10-12 19:39:33,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 4 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-12 19:39:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 867 transitions. [2024-10-12 19:39:33,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 19:39:33,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:33,489 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:33,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:39:33,490 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:33,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:33,493 INFO L85 PathProgramCache]: Analyzing trace with hash 864897672, now seen corresponding path program 1 times [2024-10-12 19:39:33,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:33,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71670175] [2024-10-12 19:39:33,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:33,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:39:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:39:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:39:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:39:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:39:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:39:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:39:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:39:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:39:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 19:39:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,680 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-12 19:39:33,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:33,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71670175] [2024-10-12 19:39:33,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71670175] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:39:33,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137006174] [2024-10-12 19:39:33,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:33,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:39:33,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:39:33,682 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-12 19:39:33,685 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-12 19:39:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 19:39:33,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:39:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 19:39:33,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:39:33,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137006174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:33,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:39:33,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 19 [2024-10-12 19:39:33,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008057423] [2024-10-12 19:39:33,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:33,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:39:33,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:33,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:39:33,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:39:33,855 INFO L87 Difference]: Start difference. First operand 697 states and 867 transitions. Second operand has 8 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:39:34,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:34,040 INFO L93 Difference]: Finished difference Result 1200 states and 1515 transitions. [2024-10-12 19:39:34,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:39:34,041 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 89 [2024-10-12 19:39:34,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:34,043 INFO L225 Difference]: With dead ends: 1200 [2024-10-12 19:39:34,043 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 19:39:34,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:39:34,046 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 59 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:34,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 765 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:39:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 19:39:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 19:39:34,047 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-12 19:39:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 19:39:34,048 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2024-10-12 19:39:34,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:34,048 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 19:39:34,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:39:34,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 19:39:34,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 19:39:34,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:39:34,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 19:39:34,254 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-12 19:39:34,257 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:34,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 19:39:36,868 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:39:36,880 WARN L155 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse2 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse0 (<= 1 ~methaneLevelCritical~0)) (.cse3 (<= 2 ~waterLevel~0)) (.cse4 (not (= 0 ~systemActive~0)))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse2 .cse1) (and .cse0 .cse3 .cse4)))) Eliminated clause: (let ((.cse2 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse0 (<= 1 ~methaneLevelCritical~0)) (.cse3 (<= 2 ~waterLevel~0)) (.cse4 (not (= 0 ~systemActive~0)))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse2 .cse1) (and .cse0 .cse3 .cse4))) [2024-10-12 19:39:36,887 WARN L155 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (and (let ((.cse2 (= 0 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse1 (<= 1 |old(~methaneLevelCritical~0)|)) (.cse3 (= |old(~methaneLevelCritical~0)| 0)) (.cse4 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse0 .cse1 .cse4) (and .cse3 .cse4))) (= |old(~methaneLevelCritical~0)| ~methaneLevelCritical~0)) Eliminated clause: (let ((.cse1 (= ~methaneLevelCritical~0 0)) (.cse3 (= 1 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse4 (<= 1 ~methaneLevelCritical~0)) (.cse2 (= 0 ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3) (and .cse0 .cse4 .cse3) (and .cse0 .cse4 .cse2))) [2024-10-12 19:39:36,892 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse3 (= 0 ~systemActive~0))) (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse2 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse0 (<= 1 ~methaneLevelCritical~0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse2 .cse1) (and .cse0 .cse3))) (or (= ~pumpRunning~0 0) (not .cse3)) (= |old(~waterLevel~0)| ~waterLevel~0))) Eliminated clause: (let ((.cse3 (= 0 ~systemActive~0))) (and (let ((.cse2 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse0 (<= 1 ~methaneLevelCritical~0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse2 .cse1) (and .cse0 .cse3))) (or (= ~pumpRunning~0 0) (not .cse3)))) [2024-10-12 19:39:36,900 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse1 (= ~methaneLevelCritical~0 0)) (.cse3 (= 1 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse4 (<= 1 ~methaneLevelCritical~0)) (.cse2 (= 0 ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3) (and .cse0 .cse4 .cse3) (and .cse0 .cse4 .cse2)))) Eliminated clause: (let ((.cse1 (= ~methaneLevelCritical~0 0)) (.cse3 (= 1 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse4 (<= 1 ~methaneLevelCritical~0)) (.cse2 (= 0 ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3) (and .cse0 .cse4 .cse3) (and .cse0 .cse4 .cse2))) [2024-10-12 19:39:36,904 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__methaneQuery contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (or (= ~pumpRunning~0 0) (< ~methaneLevelCritical~0 1)) (let ((.cse0 (= 1 ~systemActive~0))) (or (and (<= 1 ~methaneLevelCritical~0) .cse0) (and (= ~methaneLevelCritical~0 0) .cse0)))) Eliminated clause: (and (or (= ~pumpRunning~0 0) (< ~methaneLevelCritical~0 1)) (let ((.cse0 (= 1 ~systemActive~0))) (or (and (<= 1 ~methaneLevelCritical~0) .cse0) (and (= ~methaneLevelCritical~0 0) .cse0)))) [2024-10-12 19:39:36,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:39:36 BoogieIcfgContainer [2024-10-12 19:39:36,908 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:39:36,909 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:39:36,909 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:39:36,909 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:39:36,909 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:39:29" (3/4) ... [2024-10-12 19:39:36,911 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 19:39:36,913 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-10-12 19:39:36,913 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-12 19:39:36,913 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-12 19:39:36,913 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-12 19:39:36,913 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-12 19:39:36,913 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-10-12 19:39:36,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-12 19:39:36,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__methaneQuery [2024-10-12 19:39:36,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneAlarm [2024-10-12 19:39:36,918 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2024-10-12 19:39:36,918 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-12 19:39:36,919 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-12 19:39:36,919 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:39:36,919 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:39:37,008 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:39:37,008 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 19:39:37,008 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:39:37,009 INFO L158 Benchmark]: Toolchain (without parser) took 8182.68ms. Allocated memory was 134.2MB in the beginning and 308.3MB in the end (delta: 174.1MB). Free memory was 63.1MB in the beginning and 123.8MB in the end (delta: -60.7MB). Peak memory consumption was 115.9MB. Max. memory is 16.1GB. [2024-10-12 19:39:37,009 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 134.2MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:39:37,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.41ms. Allocated memory was 134.2MB in the beginning and 203.4MB in the end (delta: 69.2MB). Free memory was 63.1MB in the beginning and 167.9MB in the end (delta: -104.8MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-10-12 19:39:37,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.33ms. Allocated memory is still 203.4MB. Free memory was 167.9MB in the beginning and 165.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:39:37,009 INFO L158 Benchmark]: Boogie Preprocessor took 42.54ms. Allocated memory is still 203.4MB. Free memory was 165.8MB in the beginning and 163.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:39:37,010 INFO L158 Benchmark]: RCFGBuilder took 369.30ms. Allocated memory is still 203.4MB. Free memory was 163.8MB in the beginning and 139.6MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 19:39:37,010 INFO L158 Benchmark]: TraceAbstraction took 7209.20ms. Allocated memory was 203.4MB in the beginning and 308.3MB in the end (delta: 104.9MB). Free memory was 138.6MB in the beginning and 131.1MB in the end (delta: 7.5MB). Peak memory consumption was 152.2MB. Max. memory is 16.1GB. [2024-10-12 19:39:37,010 INFO L158 Benchmark]: Witness Printer took 99.57ms. Allocated memory is still 308.3MB. Free memory was 131.1MB in the beginning and 123.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 19:39:37,012 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.12ms. Allocated memory is still 134.2MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.41ms. Allocated memory was 134.2MB in the beginning and 203.4MB in the end (delta: 69.2MB). Free memory was 63.1MB in the beginning and 167.9MB in the end (delta: -104.8MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.33ms. Allocated memory is still 203.4MB. Free memory was 167.9MB in the beginning and 165.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.54ms. Allocated memory is still 203.4MB. Free memory was 165.8MB in the beginning and 163.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 369.30ms. Allocated memory is still 203.4MB. Free memory was 163.8MB in the beginning and 139.6MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7209.20ms. Allocated memory was 203.4MB in the beginning and 308.3MB in the end (delta: 104.9MB). Free memory was 138.6MB in the beginning and 131.1MB in the end (delta: 7.5MB). Peak memory consumption was 152.2MB. Max. memory is 16.1GB. * Witness Printer took 99.57ms. Allocated memory is still 308.3MB. Free memory was 131.1MB in the beginning and 123.8MB 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,"Environment.i","") [49] - GenericResultAtLocation [Line: 150]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [150] - GenericResultAtLocation [Line: 252]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [252] - GenericResultAtLocation [Line: 618]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [618] - GenericResultAtLocation [Line: 646]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [646] - GenericResultAtLocation [Line: 868]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [868] - GenericResultAtLocation [Line: 877]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [877] - GenericResultAtLocation [Line: 946]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [946] * 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: 873]: 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 10 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1229 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1184 mSDsluCounter, 3146 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2226 mSDsCounter, 379 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1792 IncrementalHoareTripleChecker+Invalid, 2171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 379 mSolverCounterUnsat, 920 mSDtfsCounter, 1792 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1092occurred in iteration=8, InterpolantAutomatonStates: 76, 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, 11 MinimizatonAttempts, 79 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 600 NumberOfCodeBlocks, 600 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 587 ConstructedInterpolants, 0 QuantifiedInterpolants, 1029 SizeOfPredicates, 1 NumberOfNonLiveVariables, 509 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 101/105 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: 163]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 888]: Loop Invariant Derived loop invariant: (((((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (splverifierCounter == 0)) && (0 == systemActive)) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (splverifierCounter == 0)) && (0 == systemActive))) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 887]: Location Invariant Derived location invariant: 0 - ProcedureContractResult [Line: 762]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: (((((1 <= methaneLevelCritical) && (1 == systemActive)) || (((methaneLevelCritical == 0) && (2 <= waterLevel)) && (0 != systemActive))) || ((methaneLevelCritical == 0) && (1 == systemActive))) || (((1 <= methaneLevelCritical) && (2 <= waterLevel)) && (0 != systemActive))) Ensures: ((pumpRunning == 0) && (((((1 <= methaneLevelCritical) && (1 == systemActive)) || (((methaneLevelCritical == 0) && (2 <= waterLevel)) && (0 != systemActive))) || ((methaneLevelCritical == 0) && (1 == systemActive))) || (((1 <= methaneLevelCritical) && (2 <= waterLevel)) && (0 != systemActive)))) - ProcedureContractResult [Line: 678]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((methaneLevelCritical == 0) && (1 == systemActive)) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) Ensures: (((methaneLevelCritical == 0) && (1 == systemActive)) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) - ProcedureContractResult [Line: 83]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (0 == systemActive)) || ((methaneLevelCritical == 0) && (1 == systemActive))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (0 == systemActive))) Ensures: ((((((((pumpRunning == 0) && (1 <= \old(methaneLevelCritical))) && (0 == systemActive)) || (((pumpRunning == 0) && (\old(methaneLevelCritical) == 0)) && (0 == systemActive))) || (((pumpRunning == 0) && (1 <= \old(methaneLevelCritical))) && (1 == systemActive))) || ((\old(methaneLevelCritical) == 0) && (1 == systemActive))) && ((\old(methaneLevelCritical) != 0) || (0 < methaneLevelCritical))) && ((methaneLevelCritical == 0) || (\old(methaneLevelCritical) < 1))) - ProcedureContractResult [Line: 654]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: ((((((1 <= methaneLevelCritical) && (1 == systemActive)) || ((methaneLevelCritical == 0) && (0 == systemActive))) || ((methaneLevelCritical == 0) && (1 == systemActive))) || ((1 <= methaneLevelCritical) && (0 == systemActive))) && ((pumpRunning == 0) || (0 != systemActive))) Ensures: (((((((((1 <= methaneLevelCritical) && (1 == systemActive)) || ((methaneLevelCritical == 0) && (\old(pumpRunning) == 0))) || ((methaneLevelCritical == 0) && (1 == systemActive))) || ((1 <= methaneLevelCritical) && (\old(pumpRunning) == 0))) && (((pumpRunning == \old(pumpRunning)) || (pumpRunning == 0)) || (1 < waterLevel))) && ((pumpRunning == 0) || (methaneLevelCritical < 1))) && (((pumpRunning == 0) && (\old(waterLevel) == waterLevel)) || (0 != systemActive))) && (((\old(pumpRunning) != 0) || ((1 == systemActive) && (\old(waterLevel) == waterLevel))) || (0 == systemActive))) - ProcedureContractResult [Line: 153]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 95]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: (((((1 <= methaneLevelCritical) && (1 == systemActive)) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (0 == systemActive))) || ((methaneLevelCritical == 0) && (1 == systemActive))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (0 == systemActive))) Ensures: ((\result == methaneLevelCritical) && (((((1 <= methaneLevelCritical) && (1 == systemActive)) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (0 == systemActive))) || ((methaneLevelCritical == 0) && (1 == systemActive))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (0 == systemActive)))) - ProcedureContractResult [Line: 71]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (0 == systemActive)) || ((methaneLevelCritical == 0) && (1 == systemActive))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (0 == systemActive))) Ensures: (((((pumpRunning != 0) || (\old(waterLevel) != 1)) || (1 < waterLevel)) && ((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel))) && ((((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (0 == systemActive)) || ((methaneLevelCritical == 0) && (1 == systemActive))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (0 == systemActive)))) - ProcedureContractResult [Line: 686]: Procedure Contract for processEnvironment__wrappee__methaneQuery Derived contract for procedure processEnvironment__wrappee__methaneQuery. Requires: (((pumpRunning == 0) || (methaneLevelCritical < 1)) && (((1 <= methaneLevelCritical) && (1 == systemActive)) || ((methaneLevelCritical == 0) && (1 == systemActive)))) Ensures: (((((methaneLevelCritical == 0) && (1 == systemActive)) || (((1 <= methaneLevelCritical) && (1 == systemActive)) && (\old(pumpRunning) == 0))) && ((pumpRunning == 0) || (methaneLevelCritical < 1))) && ((pumpRunning == \old(pumpRunning)) || (1 < waterLevel))) - ProcedureContractResult [Line: 770]: Procedure Contract for isMethaneAlarm Derived contract for procedure isMethaneAlarm. Requires: (((1 <= methaneLevelCritical) && (1 == systemActive)) || ((methaneLevelCritical == 0) && (1 == systemActive))) Ensures: (((methaneLevelCritical < ((long long) \result + 1)) || (methaneLevelCritical < 1)) && (((1 <= methaneLevelCritical) && (1 == systemActive)) || ((methaneLevelCritical == 0) && (1 == systemActive)))) RESULT: Ultimate proved your program to be correct! [2024-10-12 19:39:37,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE