./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product44.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 cb53e49317620dbde25b1d7f6fa7078b4950e13e4d138c624b27be1c4ee0f3ad --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:15:22,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:15:22,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:15:22,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:15:22,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:15:22,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:15:22,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:15:22,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:15:22,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:15:22,392 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:15:22,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:15:22,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:15:22,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:15:22,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:15:22,393 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:15:22,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:15:22,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:15:22,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:15:22,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:15:22,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:15:22,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:15:22,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:15:22,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:15:22,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:15:22,396 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:15:22,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:15:22,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:15:22,397 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:15:22,397 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:15:22,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:15:22,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:15:22,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:15:22,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:15:22,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:15:22,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:15:22,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:15:22,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:15:22,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:15:22,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:15:22,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:15:22,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:15:22,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:15:22,401 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 -> cb53e49317620dbde25b1d7f6fa7078b4950e13e4d138c624b27be1c4ee0f3ad [2024-11-09 23:15:22,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:15:22,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:15:22,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:15:22,666 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:15:22,666 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:15:22,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c [2024-11-09 23:15:24,019 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:15:24,258 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:15:24,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c [2024-11-09 23:15:24,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a425a3ec8/10d528fc4fde4b7fa9470c09e1fb97dc/FLAG12cac9e8b [2024-11-09 23:15:24,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a425a3ec8/10d528fc4fde4b7fa9470c09e1fb97dc [2024-11-09 23:15:24,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:15:24,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:15:24,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:15:24,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:15:24,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:15:24,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:15:24" (1/1) ... [2024-11-09 23:15:24,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a43331e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:24, skipping insertion in model container [2024-11-09 23:15:24,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:15:24" (1/1) ... [2024-11-09 23:15:24,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:15:24,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c[1605,1618] [2024-11-09 23:15:24,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:15:24,922 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:15:24,931 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2024-11-09 23:15:24,933 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [58] [2024-11-09 23:15:24,933 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [424] [2024-11-09 23:15:24,933 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [499] [2024-11-09 23:15:24,934 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [701] [2024-11-09 23:15:24,934 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [796] [2024-11-09 23:15:24,934 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [822] [2024-11-09 23:15:24,934 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [860] [2024-11-09 23:15:24,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product44.cil.c[1605,1618] [2024-11-09 23:15:25,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:15:25,041 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:15:25,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:25 WrapperNode [2024-11-09 23:15:25,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:15:25,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:15:25,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:15:25,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:15:25,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:25" (1/1) ... [2024-11-09 23:15:25,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:25" (1/1) ... [2024-11-09 23:15:25,107 INFO L138 Inliner]: procedures = 55, calls = 98, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 190 [2024-11-09 23:15:25,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:15:25,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:15:25,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:15:25,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:15:25,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:25" (1/1) ... [2024-11-09 23:15:25,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:25" (1/1) ... [2024-11-09 23:15:25,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:25" (1/1) ... [2024-11-09 23:15:25,146 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 23:15:25,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:25" (1/1) ... [2024-11-09 23:15:25,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:25" (1/1) ... [2024-11-09 23:15:25,151 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:25" (1/1) ... [2024-11-09 23:15:25,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:25" (1/1) ... [2024-11-09 23:15:25,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:25" (1/1) ... [2024-11-09 23:15:25,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:25" (1/1) ... [2024-11-09 23:15:25,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:15:25,160 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:15:25,160 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:15:25,160 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:15:25,161 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:25" (1/1) ... [2024-11-09 23:15:25,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:15:25,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:15:25,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 23:15:25,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 23:15:25,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:15:25,261 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-09 23:15:25,261 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-09 23:15:25,262 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-09 23:15:25,263 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-09 23:15:25,263 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-09 23:15:25,265 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-09 23:15:25,265 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-09 23:15:25,265 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-09 23:15:25,265 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-09 23:15:25,265 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-09 23:15:25,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:15:25,265 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-09 23:15:25,266 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-09 23:15:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:15:25,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:15:25,352 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:15:25,354 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:15:25,396 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L747: #res := ~retValue_acc~6; [2024-11-09 23:15:25,522 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L611-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~3#1; [2024-11-09 23:15:25,522 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L793-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~8#1; [2024-11-09 23:15:25,522 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L620-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~4#1; [2024-11-09 23:15:25,523 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L675-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~5#1; [2024-11-09 23:15:25,604 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L857-1: valid_product_#res#1 := valid_product_~retValue_acc~10#1; [2024-11-09 23:15:25,605 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: main_#res#1 := main_~retValue_acc~11#1; [2024-11-09 23:15:25,630 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-09 23:15:25,630 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:15:25,643 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:15:25,645 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:15:25,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:15:25 BoogieIcfgContainer [2024-11-09 23:15:25,646 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:15:25,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:15:25,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:15:25,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:15:25,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:15:24" (1/3) ... [2024-11-09 23:15:25,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6664c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:15:25, skipping insertion in model container [2024-11-09 23:15:25,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:25" (2/3) ... [2024-11-09 23:15:25,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6664c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:15:25, skipping insertion in model container [2024-11-09 23:15:25,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:15:25" (3/3) ... [2024-11-09 23:15:25,659 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product44.cil.c [2024-11-09 23:15:25,673 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:15:25,673 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:15:25,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:15:25,732 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;@2f010b58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:15:25,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:15:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 76 states have internal predecessors, (95), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 23:15:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 23:15:25,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:25,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:25,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:25,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:25,751 INFO L85 PathProgramCache]: Analyzing trace with hash -610395729, now seen corresponding path program 1 times [2024-11-09 23:15:25,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:25,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914554752] [2024-11-09 23:15:25,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:25,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 23:15:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:15:25,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:25,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914554752] [2024-11-09 23:15:25,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914554752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:25,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:25,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:15:25,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872655938] [2024-11-09 23:15:25,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:25,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:15:25,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:25,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:15:25,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:15:25,984 INFO L87 Difference]: Start difference. First operand has 88 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 76 states have internal predecessors, (95), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:15:26,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:26,007 INFO L93 Difference]: Finished difference Result 167 states and 224 transitions. [2024-11-09 23:15:26,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:15:26,012 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-09 23:15:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:26,018 INFO L225 Difference]: With dead ends: 167 [2024-11-09 23:15:26,018 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 23:15:26,021 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-11-09 23:15:26,026 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:26,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:26,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 23:15:26,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 23:15:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 66 states have internal predecessors, (79), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 23:15:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2024-11-09 23:15:26,064 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 25 [2024-11-09 23:15:26,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:26,064 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2024-11-09 23:15:26,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:15:26,065 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2024-11-09 23:15:26,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 23:15:26,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:26,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:26,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:15:26,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:26,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:26,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1619704907, now seen corresponding path program 1 times [2024-11-09 23:15:26,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:26,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221409342] [2024-11-09 23:15:26,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:26,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 23:15:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:15:26,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:26,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221409342] [2024-11-09 23:15:26,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221409342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:26,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:26,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:15:26,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728373670] [2024-11-09 23:15:26,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:26,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:15:26,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:26,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:15:26,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:15:26,200 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:15:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:26,221 INFO L93 Difference]: Finished difference Result 114 states and 145 transitions. [2024-11-09 23:15:26,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:15:26,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 27 [2024-11-09 23:15:26,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:26,223 INFO L225 Difference]: With dead ends: 114 [2024-11-09 23:15:26,223 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 23:15:26,224 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-11-09 23:15:26,225 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:26,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:26,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 23:15:26,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-09 23:15:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 59 states have internal predecessors, (71), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 23:15:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2024-11-09 23:15:26,236 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 27 [2024-11-09 23:15:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:26,236 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2024-11-09 23:15:26,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:15:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2024-11-09 23:15:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 23:15:26,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:26,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:26,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:15:26,238 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:26,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:26,239 INFO L85 PathProgramCache]: Analyzing trace with hash 190795351, now seen corresponding path program 1 times [2024-11-09 23:15:26,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:26,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173075172] [2024-11-09 23:15:26,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:26,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 23:15:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:15:26,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:26,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173075172] [2024-11-09 23:15:26,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173075172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:26,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:26,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:15:26,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711142761] [2024-11-09 23:15:26,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:26,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:15:26,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:26,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:15:26,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:15:26,355 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:15:26,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:26,391 INFO L93 Difference]: Finished difference Result 185 states and 240 transitions. [2024-11-09 23:15:26,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:15:26,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-09 23:15:26,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:26,395 INFO L225 Difference]: With dead ends: 185 [2024-11-09 23:15:26,395 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 23:15:26,396 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-11-09 23:15:26,397 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 77 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:26,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 173 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 23:15:26,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2024-11-09 23:15:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 103 states have internal predecessors, (126), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 23:15:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 154 transitions. [2024-11-09 23:15:26,416 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 154 transitions. Word has length 30 [2024-11-09 23:15:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:26,417 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 154 transitions. [2024-11-09 23:15:26,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:15:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2024-11-09 23:15:26,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 23:15:26,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:26,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:26,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:15:26,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:26,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:26,420 INFO L85 PathProgramCache]: Analyzing trace with hash 269734307, now seen corresponding path program 1 times [2024-11-09 23:15:26,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:26,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57417464] [2024-11-09 23:15:26,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:26,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:15:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:15:26,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:26,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57417464] [2024-11-09 23:15:26,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57417464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:26,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:26,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:15:26,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631509955] [2024-11-09 23:15:26,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:26,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:15:26,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:26,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:15:26,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:15:26,576 INFO L87 Difference]: Start difference. First operand 119 states and 154 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:15:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:26,663 INFO L93 Difference]: Finished difference Result 307 states and 405 transitions. [2024-11-09 23:15:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:15:26,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-11-09 23:15:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:26,666 INFO L225 Difference]: With dead ends: 307 [2024-11-09 23:15:26,666 INFO L226 Difference]: Without dead ends: 195 [2024-11-09 23:15:26,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:15:26,668 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 67 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:26,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 285 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-09 23:15:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-09 23:15:26,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 152 states have (on average 1.3092105263157894) internal successors, (199), 165 states have internal predecessors, (199), 22 states have call successors, (22), 20 states have call predecessors, (22), 20 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2024-11-09 23:15:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 247 transitions. [2024-11-09 23:15:26,709 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 247 transitions. Word has length 33 [2024-11-09 23:15:26,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:26,710 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 247 transitions. [2024-11-09 23:15:26,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:15:26,710 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 247 transitions. [2024-11-09 23:15:26,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 23:15:26,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:26,712 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:26,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:15:26,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:26,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:26,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1517671881, now seen corresponding path program 1 times [2024-11-09 23:15:26,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:26,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532387615] [2024-11-09 23:15:26,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:26,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 23:15:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:15:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:15:26,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:26,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532387615] [2024-11-09 23:15:26,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532387615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:26,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:26,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:15:26,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97575733] [2024-11-09 23:15:26,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:26,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:15:26,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:26,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:15:26,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:15:26,838 INFO L87 Difference]: Start difference. First operand 195 states and 247 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 23:15:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:26,870 INFO L93 Difference]: Finished difference Result 389 states and 503 transitions. [2024-11-09 23:15:26,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:15:26,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2024-11-09 23:15:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:26,873 INFO L225 Difference]: With dead ends: 389 [2024-11-09 23:15:26,876 INFO L226 Difference]: Without dead ends: 201 [2024-11-09 23:15:26,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:15:26,879 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:26,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:26,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-09 23:15:26,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-09 23:15:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 158 states have (on average 1.2974683544303798) internal successors, (205), 171 states have internal predecessors, (205), 22 states have call successors, (22), 20 states have call predecessors, (22), 20 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2024-11-09 23:15:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 253 transitions. [2024-11-09 23:15:26,915 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 253 transitions. Word has length 47 [2024-11-09 23:15:26,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:26,916 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 253 transitions. [2024-11-09 23:15:26,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 23:15:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 253 transitions. [2024-11-09 23:15:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 23:15:26,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:26,919 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:26,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:15:26,919 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:26,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:26,920 INFO L85 PathProgramCache]: Analyzing trace with hash 700086072, now seen corresponding path program 1 times [2024-11-09 23:15:26,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:26,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709120450] [2024-11-09 23:15:26,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:26,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:27,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 23:15:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:27,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:15:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:15:27,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:27,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709120450] [2024-11-09 23:15:27,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709120450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:27,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:27,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:15:27,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923198347] [2024-11-09 23:15:27,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:27,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:15:27,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:27,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:15:27,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:15:27,025 INFO L87 Difference]: Start difference. First operand 201 states and 253 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 23:15:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:27,056 INFO L93 Difference]: Finished difference Result 399 states and 513 transitions. [2024-11-09 23:15:27,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:15:27,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2024-11-09 23:15:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:27,061 INFO L225 Difference]: With dead ends: 399 [2024-11-09 23:15:27,061 INFO L226 Difference]: Without dead ends: 205 [2024-11-09 23:15:27,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:15:27,064 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:27,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:27,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-09 23:15:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-09 23:15:27,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 162 states have (on average 1.2901234567901234) internal successors, (209), 175 states have internal predecessors, (209), 22 states have call successors, (22), 20 states have call predecessors, (22), 20 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2024-11-09 23:15:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 257 transitions. [2024-11-09 23:15:27,085 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 257 transitions. Word has length 47 [2024-11-09 23:15:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:27,085 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 257 transitions. [2024-11-09 23:15:27,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 23:15:27,086 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 257 transitions. [2024-11-09 23:15:27,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 23:15:27,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:27,088 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:27,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:15:27,088 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:27,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:27,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1671653190, now seen corresponding path program 1 times [2024-11-09 23:15:27,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:27,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473022576] [2024-11-09 23:15:27,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:27,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:27,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 23:15:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:27,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:15:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:15:27,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:27,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473022576] [2024-11-09 23:15:27,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473022576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:27,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:27,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:15:27,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387986649] [2024-11-09 23:15:27,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:27,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:15:27,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:27,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:15:27,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:15:27,207 INFO L87 Difference]: Start difference. First operand 205 states and 257 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 23:15:27,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:27,235 INFO L93 Difference]: Finished difference Result 489 states and 618 transitions. [2024-11-09 23:15:27,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:15:27,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2024-11-09 23:15:27,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:27,238 INFO L225 Difference]: With dead ends: 489 [2024-11-09 23:15:27,240 INFO L226 Difference]: Without dead ends: 291 [2024-11-09 23:15:27,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:15:27,242 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 38 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:27,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 155 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:27,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-09 23:15:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-11-09 23:15:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 230 states have (on average 1.2608695652173914) internal successors, (290), 245 states have internal predecessors, (290), 32 states have call successors, (32), 30 states have call predecessors, (32), 28 states have return successors, (36), 30 states have call predecessors, (36), 32 states have call successors, (36) [2024-11-09 23:15:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 358 transitions. [2024-11-09 23:15:27,267 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 358 transitions. Word has length 47 [2024-11-09 23:15:27,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:27,268 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 358 transitions. [2024-11-09 23:15:27,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 23:15:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 358 transitions. [2024-11-09 23:15:27,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 23:15:27,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:27,269 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:27,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:15:27,270 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:27,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:27,271 INFO L85 PathProgramCache]: Analyzing trace with hash 261649112, now seen corresponding path program 1 times [2024-11-09 23:15:27,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:27,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072809724] [2024-11-09 23:15:27,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:27,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:27,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 23:15:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:27,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:15:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:27,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 23:15:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:15:27,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:27,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072809724] [2024-11-09 23:15:27,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072809724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:27,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:27,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:15:27,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843731980] [2024-11-09 23:15:27,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:27,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:15:27,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:27,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:15:27,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:15:27,446 INFO L87 Difference]: Start difference. First operand 291 states and 358 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 23:15:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:27,710 INFO L93 Difference]: Finished difference Result 1027 states and 1300 transitions. [2024-11-09 23:15:27,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:15:27,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2024-11-09 23:15:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:27,716 INFO L225 Difference]: With dead ends: 1027 [2024-11-09 23:15:27,717 INFO L226 Difference]: Without dead ends: 743 [2024-11-09 23:15:27,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:15:27,720 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 125 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:27,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 394 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:15:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2024-11-09 23:15:27,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 732. [2024-11-09 23:15:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 579 states have (on average 1.231433506044905) internal successors, (713), 628 states have internal predecessors, (713), 84 states have call successors, (84), 60 states have call predecessors, (84), 68 states have return successors, (110), 80 states have call predecessors, (110), 84 states have call successors, (110) [2024-11-09 23:15:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 907 transitions. [2024-11-09 23:15:27,795 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 907 transitions. Word has length 51 [2024-11-09 23:15:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:27,795 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 907 transitions. [2024-11-09 23:15:27,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 23:15:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 907 transitions. [2024-11-09 23:15:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 23:15:27,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:27,798 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:27,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:15:27,799 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:27,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:27,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1967521431, now seen corresponding path program 1 times [2024-11-09 23:15:27,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:27,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483951648] [2024-11-09 23:15:27,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:27,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:27,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 23:15:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:27,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 23:15:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 23:15:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:27,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 23:15:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:27,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:15:27,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:27,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483951648] [2024-11-09 23:15:27,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483951648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:15:27,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210954489] [2024-11-09 23:15:27,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:27,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:15:27,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:15:27,991 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:15:27,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:15:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:28,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:15:28,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:15:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:15:28,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:15:28,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210954489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:28,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:15:28,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2024-11-09 23:15:28,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639204217] [2024-11-09 23:15:28,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:28,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:15:28,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:28,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:15:28,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-09 23:15:28,243 INFO L87 Difference]: Start difference. First operand 732 states and 907 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 23:15:28,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:28,377 INFO L93 Difference]: Finished difference Result 1449 states and 1803 transitions. [2024-11-09 23:15:28,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:15:28,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2024-11-09 23:15:28,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:28,381 INFO L225 Difference]: With dead ends: 1449 [2024-11-09 23:15:28,381 INFO L226 Difference]: Without dead ends: 724 [2024-11-09 23:15:28,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:15:28,385 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 54 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:28,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 702 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:15:28,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-09 23:15:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 702. [2024-11-09 23:15:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 555 states have (on average 1.2162162162162162) internal successors, (675), 598 states have internal predecessors, (675), 80 states have call successors, (80), 60 states have call predecessors, (80), 66 states have return successors, (96), 76 states have call predecessors, (96), 80 states have call successors, (96) [2024-11-09 23:15:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 851 transitions. [2024-11-09 23:15:28,433 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 851 transitions. Word has length 55 [2024-11-09 23:15:28,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:28,435 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 851 transitions. [2024-11-09 23:15:28,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 23:15:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 851 transitions. [2024-11-09 23:15:28,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 23:15:28,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:28,438 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:28,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 23:15:28,639 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-11-09 23:15:28,640 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:28,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:28,640 INFO L85 PathProgramCache]: Analyzing trace with hash -104885366, now seen corresponding path program 1 times [2024-11-09 23:15:28,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:28,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864615080] [2024-11-09 23:15:28,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:28,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:28,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 23:15:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:28,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 23:15:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:28,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 23:15:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:28,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 23:15:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:28,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 23:15:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:28,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 23:15:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 23:15:28,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:28,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864615080] [2024-11-09 23:15:28,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864615080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:28,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:28,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:15:28,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379246578] [2024-11-09 23:15:28,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:28,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:15:28,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:28,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:15:28,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:15:28,761 INFO L87 Difference]: Start difference. First operand 702 states and 851 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 23:15:29,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:29,148 INFO L93 Difference]: Finished difference Result 1220 states and 1475 transitions. [2024-11-09 23:15:29,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:15:29,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 82 [2024-11-09 23:15:29,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:29,152 INFO L225 Difference]: With dead ends: 1220 [2024-11-09 23:15:29,153 INFO L226 Difference]: Without dead ends: 525 [2024-11-09 23:15:29,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:15:29,156 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 309 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:29,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 171 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:15:29,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-09 23:15:29,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 490. [2024-11-09 23:15:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 385 states have (on average 1.2) internal successors, (462), 414 states have internal predecessors, (462), 55 states have call successors, (55), 46 states have call predecessors, (55), 49 states have return successors, (65), 51 states have call predecessors, (65), 55 states have call successors, (65) [2024-11-09 23:15:29,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 582 transitions. [2024-11-09 23:15:29,198 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 582 transitions. Word has length 82 [2024-11-09 23:15:29,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:29,199 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 582 transitions. [2024-11-09 23:15:29,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 23:15:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 582 transitions. [2024-11-09 23:15:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 23:15:29,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:29,201 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:29,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:15:29,201 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:29,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:29,202 INFO L85 PathProgramCache]: Analyzing trace with hash 551025916, now seen corresponding path program 1 times [2024-11-09 23:15:29,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:29,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766047144] [2024-11-09 23:15:29,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:29,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:15:29,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 23:15:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:15:29,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 23:15:29,259 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 23:15:29,260 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:15:29,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:15:29,264 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:29,332 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:15:29,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:15:29 BoogieIcfgContainer [2024-11-09 23:15:29,334 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 23:15:29,334 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 23:15:29,334 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 23:15:29,335 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 23:15:29,335 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:15:25" (3/4) ... [2024-11-09 23:15:29,335 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 23:15:29,407 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 23:15:29,410 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 23:15:29,410 INFO L158 Benchmark]: Toolchain (without parser) took 4815.17ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 84.8MB in the beginning and 69.3MB in the end (delta: 15.5MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2024-11-09 23:15:29,410 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 121.6MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:15:29,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.22ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 63.3MB in the end (delta: 21.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 23:15:29,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.30ms. Allocated memory is still 155.2MB. Free memory was 63.3MB in the beginning and 60.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:15:29,411 INFO L158 Benchmark]: Boogie Preprocessor took 46.43ms. Allocated memory is still 155.2MB. Free memory was 60.8MB in the beginning and 59.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:15:29,411 INFO L158 Benchmark]: IcfgBuilder took 485.88ms. Allocated memory is still 155.2MB. Free memory was 58.7MB in the beginning and 110.4MB in the end (delta: -51.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 23:15:29,412 INFO L158 Benchmark]: TraceAbstraction took 3685.40ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 109.8MB in the beginning and 75.6MB in the end (delta: 34.2MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2024-11-09 23:15:29,412 INFO L158 Benchmark]: Witness Printer took 75.33ms. Allocated memory is still 186.6MB. Free memory was 75.6MB in the beginning and 69.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 23:15:29,414 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.58ms. Allocated memory is still 121.6MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.22ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 63.3MB in the end (delta: 21.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.30ms. Allocated memory is still 155.2MB. Free memory was 63.3MB in the beginning and 60.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.43ms. Allocated memory is still 155.2MB. Free memory was 60.8MB in the beginning and 59.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 485.88ms. Allocated memory is still 155.2MB. Free memory was 58.7MB in the beginning and 110.4MB in the end (delta: -51.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3685.40ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 109.8MB in the beginning and 75.6MB in the end (delta: 34.2MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * Witness Printer took 75.33ms. Allocated memory is still 186.6MB. Free memory was 75.6MB in the beginning and 69.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] - GenericResultAtLocation [Line: 58]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [58] - GenericResultAtLocation [Line: 424]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [424] - GenericResultAtLocation [Line: 499]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [499] - GenericResultAtLocation [Line: 701]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [701] - GenericResultAtLocation [Line: 796]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [796] - GenericResultAtLocation [Line: 822]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [822] - GenericResultAtLocation [Line: 860]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [860] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 54]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L228] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L508] int pumpRunning = 0; [L509] int systemActive = 1; [L703] int waterLevel = 1; [L704] int methaneLevelCritical = 0; [L861] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L934] int retValue_acc ; [L935] int tmp ; [L939] FCALL select_helpers() [L940] FCALL select_features() [L941] CALL, EXPR valid_product() [L852] int retValue_acc ; [L855] retValue_acc = 1 [L856] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L941] RET, EXPR valid_product() [L941] tmp = valid_product() [L943] COND TRUE \read(tmp) [L945] FCALL setup() [L946] CALL runTest() [L928] CALL test() [L432] int splverifierCounter ; [L433] int tmp ; [L434] int tmp___0 ; [L435] int tmp___1 ; [L436] int tmp___2 ; [L439] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L441] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L443] COND TRUE splverifierCounter < 4 [L449] tmp = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L453] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L721] COND TRUE waterLevel < 2 [L722] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L453] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L459] tmp___0 = __VERIFIER_nondet_int() [L461] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L469] tmp___2 = __VERIFIER_nondet_int() [L471] COND TRUE \read(tmp___2) [L473] CALL startSystem() [L697] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L473] RET startSystem() [L488] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L516] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L523] COND TRUE \read(systemActive) [L525] CALL processEnvironment() [L545] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L548] COND TRUE ! pumpRunning [L550] CALL, EXPR isHighWaterLevel() [L660] int retValue_acc ; [L661] int tmp ; [L662] int tmp___0 ; [L666] CALL, EXPR isHighWaterSensorDry() [L783] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L786] COND FALSE !(waterLevel < 2) [L790] retValue_acc = 0 [L791] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L666] RET, EXPR isHighWaterSensorDry() [L666] tmp = isHighWaterSensorDry() [L668] COND FALSE !(\read(tmp)) [L671] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L673] retValue_acc = tmp___0 [L674] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L550] RET, EXPR isHighWaterLevel() [L550] tmp = isHighWaterLevel() [L552] COND TRUE \read(tmp) [L554] CALL activatePump() [L579] int tmp ; [L583] CALL, EXPR isMethaneAlarm() [L604] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L608] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L742] int retValue_acc ; [L745] retValue_acc = methaneLevelCritical [L746] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L608] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L608] retValue_acc = isMethaneLevelCritical() [L610] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L583] RET, EXPR isMethaneAlarm() [L583] tmp = isMethaneAlarm() [L585] COND FALSE !(\read(tmp)) [L589] CALL activatePump__wrappee__highWaterSensor() [L573] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L589] RET activatePump__wrappee__highWaterSensor() [L554] RET activatePump() [L525] RET processEnvironment() [L531] CALL __utac_acc__Specification1_spec__1() [L798] int tmp ; [L799] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L803] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L742] int retValue_acc ; [L745] retValue_acc = methaneLevelCritical [L746] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L803] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L803] tmp = isMethaneLevelCritical() [L805] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L531] RET __utac_acc__Specification1_spec__1() [L488] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L441] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L443] COND TRUE splverifierCounter < 4 [L449] tmp = __VERIFIER_nondet_int() [L451] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L459] tmp___0 = __VERIFIER_nondet_int() [L461] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L463] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L733] COND FALSE !(\read(methaneLevelCritical)) [L736] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L463] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L469] tmp___2 = __VERIFIER_nondet_int() [L471] COND TRUE \read(tmp___2) [L473] CALL startSystem() [L697] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L473] RET startSystem() [L488] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L516] COND TRUE \read(pumpRunning) [L518] CALL lowerWaterLevel() [L709] COND TRUE waterLevel > 0 [L710] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L518] RET lowerWaterLevel() [L523] COND TRUE \read(systemActive) [L525] CALL processEnvironment() [L545] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L548] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L563] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L525] RET processEnvironment() [L531] CALL __utac_acc__Specification1_spec__1() [L798] int tmp ; [L799] int tmp___0 ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L803] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L742] int retValue_acc ; [L745] retValue_acc = methaneLevelCritical [L746] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L803] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L803] tmp = isMethaneLevelCritical() [L805] COND TRUE \read(tmp) [L807] CALL, EXPR isPumpRunning() [L615] int retValue_acc ; [L618] retValue_acc = pumpRunning [L619] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L807] RET, EXPR isPumpRunning() [L807] tmp___0 = isPumpRunning() [L809] COND TRUE \read(tmp___0) [L811] CALL __automaton_fail() [L54] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 708 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 687 mSDsluCounter, 2698 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1804 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 500 IncrementalHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 894 mSDtfsCounter, 500 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=732occurred in iteration=8, InterpolantAutomatonStates: 54, 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, 10 MinimizatonAttempts, 74 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 583 NumberOfCodeBlocks, 583 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 488 ConstructedInterpolants, 0 QuantifiedInterpolants, 832 SizeOfPredicates, 1 NumberOfNonLiveVariables, 222 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 41/43 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 23:15:29,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE