./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product50.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_product50.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 7291fd5b9449f17989061ec30bdd7b74e8732c40c8095270267a47672f4a66be --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:15:27,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:15:27,376 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:27,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:15:27,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:15:27,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:15:27,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:15:27,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:15:27,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:15:27,410 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:15:27,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:15:27,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:15:27,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:15:27,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:15:27,411 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:15:27,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:15:27,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:15:27,412 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:15:27,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:15:27,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:15:27,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:15:27,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:15:27,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:15:27,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:15:27,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:15:27,416 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:15:27,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:15:27,416 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:15:27,416 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:15:27,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:15:27,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:15:27,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:15:27,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:15:27,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:15:27,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:15:27,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:15:27,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:15:27,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:15:27,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:15:27,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:15:27,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:15:27,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:15:27,423 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 -> 7291fd5b9449f17989061ec30bdd7b74e8732c40c8095270267a47672f4a66be [2024-11-09 23:15:27,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:15:27,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:15:27,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:15:27,671 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:15:27,671 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:15:27,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c [2024-11-09 23:15:28,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:15:29,000 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:15:29,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c [2024-11-09 23:15:29,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7079f203/49a2b8dc0a854b779f6ea3fcc6ab99b3/FLAG354f86076 [2024-11-09 23:15:29,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7079f203/49a2b8dc0a854b779f6ea3fcc6ab99b3 [2024-11-09 23:15:29,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:15:29,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:15:29,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:15:29,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:15:29,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:15:29,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:15:29" (1/1) ... [2024-11-09 23:15:29,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673a09b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:29, skipping insertion in model container [2024-11-09 23:15:29,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:15:29" (1/1) ... [2024-11-09 23:15:29,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:15:29,280 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_product50.cil.c[6254,6267] [2024-11-09 23:15:29,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:15:29,358 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:15:29,365 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [49] [2024-11-09 23:15:29,366 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [78] [2024-11-09 23:15:29,366 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [188] [2024-11-09 23:15:29,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [290] [2024-11-09 23:15:29,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [325] [2024-11-09 23:15:29,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [393] [2024-11-09 23:15:29,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [402] [2024-11-09 23:15:29,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [609] [2024-11-09 23:15:29,389 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_product50.cil.c[6254,6267] [2024-11-09 23:15:29,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:15:29,453 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:15:29,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:29 WrapperNode [2024-11-09 23:15:29,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:15:29,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:15:29,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:15:29,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:15:29,460 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:29" (1/1) ... [2024-11-09 23:15:29,473 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:29" (1/1) ... [2024-11-09 23:15:29,500 INFO L138 Inliner]: procedures = 56, calls = 99, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 200 [2024-11-09 23:15:29,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:15:29,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:15:29,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:15:29,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:15:29,510 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:29" (1/1) ... [2024-11-09 23:15:29,511 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:29" (1/1) ... [2024-11-09 23:15:29,513 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:29" (1/1) ... [2024-11-09 23:15:29,536 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:29,539 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:29" (1/1) ... [2024-11-09 23:15:29,539 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:29" (1/1) ... [2024-11-09 23:15:29,542 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:29" (1/1) ... [2024-11-09 23:15:29,546 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:29" (1/1) ... [2024-11-09 23:15:29,547 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:29" (1/1) ... [2024-11-09 23:15:29,547 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:29" (1/1) ... [2024-11-09 23:15:29,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:15:29,549 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:15:29,550 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:15:29,550 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:15:29,550 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:29" (1/1) ... [2024-11-09 23:15:29,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:15:29,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:15:29,581 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:29,585 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:29,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:15:29,623 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-09 23:15:29,624 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-09 23:15:29,624 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-09 23:15:29,624 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-09 23:15:29,624 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-09 23:15:29,624 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-09 23:15:29,624 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-09 23:15:29,624 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-09 23:15:29,624 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-09 23:15:29,625 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-09 23:15:29,625 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-09 23:15:29,625 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-09 23:15:29,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:15:29,626 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-09 23:15:29,626 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-09 23:15:29,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:15:29,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:15:29,697 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:15:29,698 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:15:29,805 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L185-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~3#1; [2024-11-09 23:15:29,805 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L598-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~10#1; [2024-11-09 23:15:29,805 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L524-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~8#1; [2024-11-09 23:15:29,816 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: #res := ~retValue_acc~0; [2024-11-09 23:15:29,873 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L322-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2024-11-09 23:15:29,873 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L287-1: main_#res#1 := main_~retValue_acc~4#1; [2024-11-09 23:15:29,900 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L176-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~2#1; [2024-11-09 23:15:29,900 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L579-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~9#1; [2024-11-09 23:15:29,915 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-09 23:15:29,915 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:15:29,927 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:15:29,927 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:15:29,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:15:29 BoogieIcfgContainer [2024-11-09 23:15:29,927 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:15:29,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:15:29,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:15:29,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:15:29,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:15:29" (1/3) ... [2024-11-09 23:15:29,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d0cfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:15:29, skipping insertion in model container [2024-11-09 23:15:29,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:29" (2/3) ... [2024-11-09 23:15:29,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d0cfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:15:29, skipping insertion in model container [2024-11-09 23:15:29,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:15:29" (3/3) ... [2024-11-09 23:15:29,933 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product50.cil.c [2024-11-09 23:15:29,944 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:15:29,945 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:15:29,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:15:29,995 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;@486cebff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:15:29,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:15:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 79 states have internal predecessors, (97), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 23:15:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 23:15:30,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:30,009 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:30,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:30,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:30,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1154439759, now seen corresponding path program 1 times [2024-11-09 23:15:30,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:30,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682320853] [2024-11-09 23:15:30,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:30,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:30,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 23:15:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:30,202 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:30,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:30,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682320853] [2024-11-09 23:15:30,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682320853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:30,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:30,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:15:30,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330582771] [2024-11-09 23:15:30,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:30,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:15:30,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:30,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:15:30,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:15:30,235 INFO L87 Difference]: Start difference. First operand has 91 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 79 states have internal predecessors, (97), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) 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:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:30,265 INFO L93 Difference]: Finished difference Result 173 states and 232 transitions. [2024-11-09 23:15:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:15:30,267 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:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:30,275 INFO L225 Difference]: With dead ends: 173 [2024-11-09 23:15:30,275 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 23:15:30,279 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:30,282 INFO L432 NwaCegarLoop]: 112 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, 112 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:30,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 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:30,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 23:15:30,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-09 23:15:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 69 states have internal predecessors, (81), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 23:15:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2024-11-09 23:15:30,384 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 25 [2024-11-09 23:15:30,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:30,384 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2024-11-09 23:15:30,384 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:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2024-11-09 23:15:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 23:15:30,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:30,395 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:30,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:15:30,395 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:30,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:30,398 INFO L85 PathProgramCache]: Analyzing trace with hash -541588937, now seen corresponding path program 1 times [2024-11-09 23:15:30,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:30,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332414839] [2024-11-09 23:15:30,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:30,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:30,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 23:15:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:30,488 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:30,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:30,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332414839] [2024-11-09 23:15:30,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332414839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:30,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:30,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:15:30,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810933236] [2024-11-09 23:15:30,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:30,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:15:30,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:30,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:15:30,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:15:30,493 INFO L87 Difference]: Start difference. First operand 80 states and 102 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:30,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:30,505 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2024-11-09 23:15:30,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:15:30,505 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:30,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:30,506 INFO L225 Difference]: With dead ends: 124 [2024-11-09 23:15:30,506 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 23:15:30,507 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:30,508 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 12 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 159 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:30,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 159 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:30,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 23:15:30,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-09 23:15:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 62 states have internal predecessors, (73), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 23:15:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2024-11-09 23:15:30,516 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 27 [2024-11-09 23:15:30,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:30,516 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2024-11-09 23:15:30,517 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:30,517 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2024-11-09 23:15:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 23:15:30,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:30,517 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:30,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:15:30,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:30,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:30,519 INFO L85 PathProgramCache]: Analyzing trace with hash 48323298, now seen corresponding path program 1 times [2024-11-09 23:15:30,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:30,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968926304] [2024-11-09 23:15:30,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:30,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:30,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 23:15:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:30,620 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:30,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:30,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968926304] [2024-11-09 23:15:30,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968926304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:30,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:30,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:15:30,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709126805] [2024-11-09 23:15:30,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:30,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:15:30,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:30,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:15:30,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:15:30,624 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:15:30,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:30,662 INFO L93 Difference]: Finished difference Result 133 states and 172 transitions. [2024-11-09 23:15:30,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:15:30,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-09 23:15:30,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:30,663 INFO L225 Difference]: With dead ends: 133 [2024-11-09 23:15:30,663 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 23:15:30,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:15:30,664 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 83 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:30,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 253 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:30,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 23:15:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-09 23:15:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.309090909090909) internal successors, (72), 62 states have internal predecessors, (72), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 23:15:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2024-11-09 23:15:30,670 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 30 [2024-11-09 23:15:30,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:30,671 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2024-11-09 23:15:30,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:15:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2024-11-09 23:15:30,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 23:15:30,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:30,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:30,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:15:30,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:30,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:30,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1624383789, now seen corresponding path program 1 times [2024-11-09 23:15:30,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:30,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061822553] [2024-11-09 23:15:30,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:30,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 23:15:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:30,720 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:30,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:30,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061822553] [2024-11-09 23:15:30,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061822553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:30,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:30,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:15:30,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661146147] [2024-11-09 23:15:30,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:30,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:15:30,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:30,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:15:30,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:15:30,722 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (2), 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:30,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:30,751 INFO L93 Difference]: Finished difference Result 177 states and 228 transitions. [2024-11-09 23:15:30,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:15:30,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2024-11-09 23:15:30,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:30,753 INFO L225 Difference]: With dead ends: 177 [2024-11-09 23:15:30,755 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 23:15:30,755 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:30,756 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 68 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:30,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 164 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 23:15:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2024-11-09 23:15:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 93 states have internal predecessors, (111), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-09 23:15:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 139 transitions. [2024-11-09 23:15:30,777 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 139 transitions. Word has length 38 [2024-11-09 23:15:30,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:30,779 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 139 transitions. [2024-11-09 23:15:30,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (2), 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:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 139 transitions. [2024-11-09 23:15:30,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 23:15:30,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:30,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:30,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:15:30,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:30,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:30,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1478942612, now seen corresponding path program 1 times [2024-11-09 23:15:30,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:30,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571208652] [2024-11-09 23:15:30,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:30,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:30,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 23:15:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:30,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 23:15:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:30,896 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:30,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:30,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571208652] [2024-11-09 23:15:30,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571208652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:30,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:30,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:15:30,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522763900] [2024-11-09 23:15:30,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:30,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:15:30,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:30,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:15:30,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:15:30,899 INFO L87 Difference]: Start difference. First operand 111 states and 139 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 23:15:31,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:31,016 INFO L93 Difference]: Finished difference Result 243 states and 309 transitions. [2024-11-09 23:15:31,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:15:31,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-09 23:15:31,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:31,018 INFO L225 Difference]: With dead ends: 243 [2024-11-09 23:15:31,018 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 23:15:31,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:15:31,020 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 50 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:31,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 346 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:15:31,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 23:15:31,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2024-11-09 23:15:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 113 states have internal predecessors, (135), 14 states have call successors, (14), 12 states have call predecessors, (14), 15 states have return successors, (21), 15 states have call predecessors, (21), 14 states have call successors, (21) [2024-11-09 23:15:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 170 transitions. [2024-11-09 23:15:31,031 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 170 transitions. Word has length 44 [2024-11-09 23:15:31,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:31,031 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 170 transitions. [2024-11-09 23:15:31,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 23:15:31,032 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 170 transitions. [2024-11-09 23:15:31,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 23:15:31,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:31,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:31,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:15:31,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:31,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:31,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1971552813, now seen corresponding path program 1 times [2024-11-09 23:15:31,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:31,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361378728] [2024-11-09 23:15:31,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:31,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:31,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 23:15:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:31,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 23:15:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:15:31,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:31,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361378728] [2024-11-09 23:15:31,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361378728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:31,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:31,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:15:31,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588475083] [2024-11-09 23:15:31,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:31,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:15:31,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:31,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:15:31,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:15:31,113 INFO L87 Difference]: Start difference. First operand 136 states and 170 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 23:15:31,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:31,199 INFO L93 Difference]: Finished difference Result 270 states and 346 transitions. [2024-11-09 23:15:31,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:15:31,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-09 23:15:31,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:31,201 INFO L225 Difference]: With dead ends: 270 [2024-11-09 23:15:31,202 INFO L226 Difference]: Without dead ends: 141 [2024-11-09 23:15:31,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:15:31,204 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 49 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:31,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 271 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:15:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-09 23:15:31,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-11-09 23:15:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 108 states have (on average 1.2685185185185186) internal successors, (137), 115 states have internal predecessors, (137), 14 states have call successors, (14), 12 states have call predecessors, (14), 15 states have return successors, (21), 15 states have call predecessors, (21), 14 states have call successors, (21) [2024-11-09 23:15:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 172 transitions. [2024-11-09 23:15:31,216 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 172 transitions. Word has length 44 [2024-11-09 23:15:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:31,217 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 172 transitions. [2024-11-09 23:15:31,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 23:15:31,217 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 172 transitions. [2024-11-09 23:15:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 23:15:31,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:31,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:31,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:15:31,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:31,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:31,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1900712657, now seen corresponding path program 1 times [2024-11-09 23:15:31,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:31,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710210935] [2024-11-09 23:15:31,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:31,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:31,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 23:15:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:31,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 23:15:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:31,327 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:31,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:31,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710210935] [2024-11-09 23:15:31,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710210935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:31,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:31,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:15:31,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280906778] [2024-11-09 23:15:31,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:31,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:15:31,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:31,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:15:31,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:15:31,330 INFO L87 Difference]: Start difference. First operand 138 states and 172 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 23:15:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:31,483 INFO L93 Difference]: Finished difference Result 399 states and 515 transitions. [2024-11-09 23:15:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:15:31,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-09 23:15:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:31,486 INFO L225 Difference]: With dead ends: 399 [2024-11-09 23:15:31,487 INFO L226 Difference]: Without dead ends: 268 [2024-11-09 23:15:31,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:15:31,488 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 197 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:31,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 283 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:15:31,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-09 23:15:31,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 256. [2024-11-09 23:15:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 197 states have (on average 1.248730964467005) internal successors, (246), 208 states have internal predecessors, (246), 29 states have call successors, (29), 28 states have call predecessors, (29), 29 states have return successors, (48), 29 states have call predecessors, (48), 29 states have call successors, (48) [2024-11-09 23:15:31,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 323 transitions. [2024-11-09 23:15:31,519 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 323 transitions. Word has length 44 [2024-11-09 23:15:31,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:31,519 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 323 transitions. [2024-11-09 23:15:31,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 23:15:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 323 transitions. [2024-11-09 23:15:31,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 23:15:31,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:31,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:31,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:15:31,521 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:31,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:31,521 INFO L85 PathProgramCache]: Analyzing trace with hash -224883775, now seen corresponding path program 1 times [2024-11-09 23:15:31,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:31,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612860140] [2024-11-09 23:15:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:31,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:31,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 23:15:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:31,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:15:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:31,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:15:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:31,587 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:31,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:31,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612860140] [2024-11-09 23:15:31,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612860140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:31,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:31,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:15:31,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575745368] [2024-11-09 23:15:31,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:31,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:15:31,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:31,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:15:31,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:15:31,588 INFO L87 Difference]: Start difference. First operand 256 states and 323 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 23:15:31,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:31,722 INFO L93 Difference]: Finished difference Result 262 states and 327 transitions. [2024-11-09 23:15:31,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:15:31,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-09 23:15:31,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:31,724 INFO L225 Difference]: With dead ends: 262 [2024-11-09 23:15:31,724 INFO L226 Difference]: Without dead ends: 259 [2024-11-09 23:15:31,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:15:31,725 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 120 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:31,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 287 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:15:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-09 23:15:31,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2024-11-09 23:15:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 197 states have (on average 1.2284263959390862) internal successors, (242), 208 states have internal predecessors, (242), 29 states have call successors, (29), 28 states have call predecessors, (29), 29 states have return successors, (48), 29 states have call predecessors, (48), 29 states have call successors, (48) [2024-11-09 23:15:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 319 transitions. [2024-11-09 23:15:31,742 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 319 transitions. Word has length 46 [2024-11-09 23:15:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:31,742 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 319 transitions. [2024-11-09 23:15:31,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 23:15:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 319 transitions. [2024-11-09 23:15:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 23:15:31,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:31,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:31,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:15:31,743 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:31,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:31,744 INFO L85 PathProgramCache]: Analyzing trace with hash -704684655, now seen corresponding path program 1 times [2024-11-09 23:15:31,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:31,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524303282] [2024-11-09 23:15:31,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:31,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:31,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 23:15:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:31,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:15:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:31,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:15:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:31,835 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:31,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:31,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524303282] [2024-11-09 23:15:31,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524303282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:31,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:31,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:15:31,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93682949] [2024-11-09 23:15:31,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:31,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:15:31,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:31,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:15:31,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:15:31,836 INFO L87 Difference]: Start difference. First operand 256 states and 319 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (4), 4 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:32,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:32,232 INFO L93 Difference]: Finished difference Result 864 states and 1119 transitions. [2024-11-09 23:15:32,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 23:15:32,233 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (4), 4 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 48 [2024-11-09 23:15:32,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:32,236 INFO L225 Difference]: With dead ends: 864 [2024-11-09 23:15:32,238 INFO L226 Difference]: Without dead ends: 615 [2024-11-09 23:15:32,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-11-09 23:15:32,240 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 268 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:32,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 378 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:15:32,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-09 23:15:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 588. [2024-11-09 23:15:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 449 states have (on average 1.1982182628062361) internal successors, (538), 478 states have internal predecessors, (538), 70 states have call successors, (70), 56 states have call predecessors, (70), 68 states have return successors, (133), 74 states have call predecessors, (133), 70 states have call successors, (133) [2024-11-09 23:15:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 741 transitions. [2024-11-09 23:15:32,307 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 741 transitions. Word has length 48 [2024-11-09 23:15:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:32,307 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 741 transitions. [2024-11-09 23:15:32,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (4), 4 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:32,307 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 741 transitions. [2024-11-09 23:15:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 23:15:32,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:32,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:32,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:15:32,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:32,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:32,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1661319026, now seen corresponding path program 1 times [2024-11-09 23:15:32,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:32,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253353170] [2024-11-09 23:15:32,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:32,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:15:32,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 23:15:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:15:32,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 23:15:32,348 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 23:15:32,349 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:15:32,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:15:32,352 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:32,390 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:15:32,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:15:32 BoogieIcfgContainer [2024-11-09 23:15:32,394 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 23:15:32,394 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 23:15:32,394 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 23:15:32,394 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 23:15:32,395 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:29" (3/4) ... [2024-11-09 23:15:32,395 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 23:15:32,448 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 23:15:32,448 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 23:15:32,449 INFO L158 Benchmark]: Toolchain (without parser) took 3420.32ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 71.8MB in the beginning and 164.9MB in the end (delta: -93.1MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2024-11-09 23:15:32,449 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 142.6MB. Free memory is still 111.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:15:32,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.01ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 71.3MB in the beginning and 168.7MB in the end (delta: -97.4MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-11-09 23:15:32,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.06ms. Allocated memory is still 207.6MB. Free memory was 168.7MB in the beginning and 166.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:15:32,450 INFO L158 Benchmark]: Boogie Preprocessor took 46.66ms. Allocated memory is still 207.6MB. Free memory was 166.6MB in the beginning and 164.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:15:32,450 INFO L158 Benchmark]: IcfgBuilder took 377.93ms. Allocated memory is still 207.6MB. Free memory was 164.5MB in the beginning and 145.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 23:15:32,450 INFO L158 Benchmark]: TraceAbstraction took 2464.93ms. Allocated memory was 207.6MB in the beginning and 268.4MB in the end (delta: 60.8MB). Free memory was 144.6MB in the beginning and 169.1MB in the end (delta: -24.5MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2024-11-09 23:15:32,450 INFO L158 Benchmark]: Witness Printer took 54.23ms. Allocated memory is still 268.4MB. Free memory was 169.1MB in the beginning and 164.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 23:15:32,451 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.13ms. Allocated memory is still 142.6MB. Free memory is still 111.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.01ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 71.3MB in the beginning and 168.7MB in the end (delta: -97.4MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.06ms. Allocated memory is still 207.6MB. Free memory was 168.7MB in the beginning and 166.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.66ms. Allocated memory is still 207.6MB. Free memory was 166.6MB in the beginning and 164.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 377.93ms. Allocated memory is still 207.6MB. Free memory was 164.5MB in the beginning and 145.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2464.93ms. Allocated memory was 207.6MB in the beginning and 268.4MB in the end (delta: 60.8MB). Free memory was 144.6MB in the beginning and 169.1MB in the end (delta: -24.5MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. * Witness Printer took 54.23ms. Allocated memory is still 268.4MB. Free memory was 169.1MB in the beginning and 164.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [49] - GenericResultAtLocation [Line: 78]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [78] - GenericResultAtLocation [Line: 188]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [188] - GenericResultAtLocation [Line: 290]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [290] - GenericResultAtLocation [Line: 325]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [325] - GenericResultAtLocation [Line: 393]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [393] - GenericResultAtLocation [Line: 402]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [402] - GenericResultAtLocation [Line: 609]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [609] * 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: 398]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L86] int waterLevel = 1; [L87] int methaneLevelCritical = 0; [L189] int cleanupTimeShifts = 4; [L405] int pumpRunning = 0; [L406] int systemActive = 1; [L779] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L268] int retValue_acc ; [L269] int tmp ; [L273] FCALL select_helpers() [L274] FCALL select_features() [L275] CALL, EXPR valid_product() [L317] int retValue_acc ; [L320] retValue_acc = 1 [L321] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L275] RET, EXPR valid_product() [L275] tmp = valid_product() [L277] COND TRUE \read(tmp) [L279] FCALL setup() [L280] CALL runTest() [L259] CALL test() [L328] int splverifierCounter ; [L329] int tmp ; [L330] int tmp___0 ; [L331] int tmp___1 ; [L332] int tmp___2 ; [L335] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L337] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L339] COND TRUE splverifierCounter < 4 [L345] tmp = __VERIFIER_nondet_int() [L347] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L349] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L104] COND TRUE waterLevel < 2 [L105] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L349] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L355] tmp___0 = __VERIFIER_nondet_int() [L357] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L359] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L116] COND FALSE !(\read(methaneLevelCritical)) [L119] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L359] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L365] tmp___2 = __VERIFIER_nondet_int() [L367] COND TRUE \read(tmp___2) [L369] CALL startSystem() [L605] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L369] RET startSystem() [L382] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L412] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L419] COND TRUE \read(systemActive) [L421] CALL processEnvironment() [L467] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L470] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L485] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L441] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L444] COND TRUE ! pumpRunning [L446] CALL, EXPR isHighWaterLevel() [L564] int retValue_acc ; [L565] int tmp ; [L566] int tmp___0 ; [L570] CALL, EXPR isHighWaterSensorDry() [L166] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L169] COND FALSE !(waterLevel < 2) [L173] retValue_acc = 0 [L174] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L570] RET, EXPR isHighWaterSensorDry() [L570] tmp = isHighWaterSensorDry() [L572] COND FALSE !(\read(tmp)) [L575] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L577] retValue_acc = tmp___0 [L578] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L446] RET, EXPR isHighWaterLevel() [L446] tmp = isHighWaterLevel() [L448] COND TRUE \read(tmp) [L450] CALL activatePump() [L495] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L450] RET activatePump() [L485] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L421] RET processEnvironment() [L427] CALL __utac_acc__Specification1_spec__1() [L54] int tmp ; [L55] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L59] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L125] int retValue_acc ; [L128] retValue_acc = methaneLevelCritical [L129] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L59] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L59] tmp = isMethaneLevelCritical() [L61] COND TRUE \read(tmp) [L63] CALL, EXPR isPumpRunning() [L519] int retValue_acc ; [L522] retValue_acc = pumpRunning [L523] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L63] RET, EXPR isPumpRunning() [L63] tmp___0 = isPumpRunning() [L65] COND TRUE \read(tmp___0) [L67] CALL __automaton_fail() [L398] reach_error() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 871 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 847 mSDsluCounter, 2253 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1447 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 754 IncrementalHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 806 mSDtfsCounter, 754 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=588occurred in iteration=9, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 51 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 398 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 337 ConstructedInterpolants, 0 QuantifiedInterpolants, 535 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 23:15:32,472 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