./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product41.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_product41.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 7e401b19fa73801dafa3ee94892588c53fc375d864d82edcc9ff671172238c8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 14:18:13,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 14:18:13,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 14:18:13,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 14:18:13,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 14:18:13,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 14:18:13,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 14:18:13,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 14:18:13,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 14:18:13,083 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 14:18:13,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 14:18:13,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 14:18:13,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 14:18:13,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 14:18:13,085 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 14:18:13,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 14:18:13,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 14:18:13,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 14:18:13,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 14:18:13,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 14:18:13,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 14:18:13,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 14:18:13,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 14:18:13,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 14:18:13,088 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 14:18:13,088 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 14:18:13,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 14:18:13,089 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 14:18:13,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 14:18:13,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 14:18:13,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 14:18:13,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 14:18:13,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:18:13,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 14:18:13,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 14:18:13,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 14:18:13,091 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 14:18:13,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 14:18:13,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 14:18:13,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 14:18:13,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 14:18:13,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 14:18:13,092 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 -> 7e401b19fa73801dafa3ee94892588c53fc375d864d82edcc9ff671172238c8c [2024-11-18 14:18:13,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 14:18:13,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 14:18:13,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 14:18:13,312 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 14:18:13,312 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 14:18:13,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product41.cil.c [2024-11-18 14:18:14,715 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 14:18:14,963 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 14:18:14,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product41.cil.c [2024-11-18 14:18:14,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b983c308e/48eee9b782a840ffa92d6f3d78deb316/FLAG79a310ccd [2024-11-18 14:18:14,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b983c308e/48eee9b782a840ffa92d6f3d78deb316 [2024-11-18 14:18:14,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 14:18:14,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 14:18:14,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 14:18:14,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 14:18:14,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 14:18:14,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:18:14" (1/1) ... [2024-11-18 14:18:14,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ecb3ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:14, skipping insertion in model container [2024-11-18 14:18:14,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:18:14" (1/1) ... [2024-11-18 14:18:15,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 14:18:15,421 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_product41.cil.c[17493,17506] [2024-11-18 14:18:15,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:18:15,444 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 14:18:15,451 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-11-18 14:18:15,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [415] [2024-11-18 14:18:15,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [484] [2024-11-18 14:18:15,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [583] [2024-11-18 14:18:15,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [758] [2024-11-18 14:18:15,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [857] [2024-11-18 14:18:15,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [892] [2024-11-18 14:18:15,454 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [901] [2024-11-18 14:18:15,527 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_product41.cil.c[17493,17506] [2024-11-18 14:18:15,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:18:15,552 INFO L204 MainTranslator]: Completed translation [2024-11-18 14:18:15,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:15 WrapperNode [2024-11-18 14:18:15,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 14:18:15,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 14:18:15,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 14:18:15,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 14:18:15,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:15" (1/1) ... [2024-11-18 14:18:15,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:15" (1/1) ... [2024-11-18 14:18:15,595 INFO L138 Inliner]: procedures = 53, calls = 95, calls flagged for inlining = 21, calls inlined = 18, statements flattened = 181 [2024-11-18 14:18:15,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 14:18:15,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 14:18:15,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 14:18:15,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 14:18:15,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:15" (1/1) ... [2024-11-18 14:18:15,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:15" (1/1) ... [2024-11-18 14:18:15,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:15" (1/1) ... [2024-11-18 14:18:15,620 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-18 14:18:15,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:15" (1/1) ... [2024-11-18 14:18:15,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:15" (1/1) ... [2024-11-18 14:18:15,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:15" (1/1) ... [2024-11-18 14:18:15,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:15" (1/1) ... [2024-11-18 14:18:15,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:15" (1/1) ... [2024-11-18 14:18:15,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:15" (1/1) ... [2024-11-18 14:18:15,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 14:18:15,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 14:18:15,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 14:18:15,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 14:18:15,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:15" (1/1) ... [2024-11-18 14:18:15,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:18:15,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:18:15,683 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-18 14:18:15,685 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-18 14:18:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 14:18:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-18 14:18:15,744 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-18 14:18:15,744 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-18 14:18:15,744 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-18 14:18:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-18 14:18:15,745 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-18 14:18:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-18 14:18:15,745 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-18 14:18:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-18 14:18:15,745 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-18 14:18:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 14:18:15,745 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-18 14:18:15,746 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-18 14:18:15,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 14:18:15,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 14:18:15,898 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 14:18:15,900 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 14:18:16,096 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-18 14:18:16,097 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 14:18:16,110 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 14:18:16,111 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 14:18:16,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:18:16 BoogieIcfgContainer [2024-11-18 14:18:16,112 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 14:18:16,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 14:18:16,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 14:18:16,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 14:18:16,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:18:14" (1/3) ... [2024-11-18 14:18:16,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a41fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:18:16, skipping insertion in model container [2024-11-18 14:18:16,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:15" (2/3) ... [2024-11-18 14:18:16,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a41fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:18:16, skipping insertion in model container [2024-11-18 14:18:16,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:18:16" (3/3) ... [2024-11-18 14:18:16,120 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product41.cil.c [2024-11-18 14:18:16,133 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 14:18:16,133 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 14:18:16,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 14:18:16,182 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;@23cd74ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 14:18:16,183 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 14:18:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 67 states have internal predecessors, (85), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-18 14:18:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-18 14:18:16,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:16,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:16,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:16,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:16,200 INFO L85 PathProgramCache]: Analyzing trace with hash 641919507, now seen corresponding path program 1 times [2024-11-18 14:18:16,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:16,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917320816] [2024-11-18 14:18:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:16,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:16,326 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-18 14:18:16,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:16,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917320816] [2024-11-18 14:18:16,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917320816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:16,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:16,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 14:18:16,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146883069] [2024-11-18 14:18:16,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:16,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 14:18:16,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:16,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 14:18:16,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 14:18:16,350 INFO L87 Difference]: Start difference. First operand has 79 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 67 states have internal predecessors, (85), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:18:16,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:16,376 INFO L93 Difference]: Finished difference Result 150 states and 205 transitions. [2024-11-18 14:18:16,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 14:18:16,381 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-18 14:18:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:16,388 INFO L225 Difference]: With dead ends: 150 [2024-11-18 14:18:16,389 INFO L226 Difference]: Without dead ends: 70 [2024-11-18 14:18:16,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 14:18:16,394 INFO L432 NwaCegarLoop]: 99 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, 99 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-18 14:18:16,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:18:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-18 14:18:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-18 14:18:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 59 states have internal predecessors, (71), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-18 14:18:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2024-11-18 14:18:16,424 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 23 [2024-11-18 14:18:16,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:16,425 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2024-11-18 14:18:16,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:18:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2024-11-18 14:18:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 14:18:16,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:16,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:16,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 14:18:16,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:16,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:16,428 INFO L85 PathProgramCache]: Analyzing trace with hash 298217176, now seen corresponding path program 1 times [2024-11-18 14:18:16,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:16,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590265279] [2024-11-18 14:18:16,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:16,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:16,596 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-18 14:18:16,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:16,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590265279] [2024-11-18 14:18:16,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590265279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:16,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:16,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:18:16,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298147173] [2024-11-18 14:18:16,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:16,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:18:16,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:16,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:18:16,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:18:16,598 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:18:16,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:16,614 INFO L93 Difference]: Finished difference Result 106 states and 136 transitions. [2024-11-18 14:18:16,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:18:16,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-18 14:18:16,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:16,615 INFO L225 Difference]: With dead ends: 106 [2024-11-18 14:18:16,615 INFO L226 Difference]: Without dead ends: 61 [2024-11-18 14:18:16,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:18:16,617 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 138 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-18 14:18:16,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 138 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:18:16,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-18 14:18:16,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-18 14:18:16,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 53 states have internal predecessors, (64), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 14:18:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2024-11-18 14:18:16,628 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 24 [2024-11-18 14:18:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:16,628 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2024-11-18 14:18:16,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:18:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2024-11-18 14:18:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-18 14:18:16,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:16,629 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] [2024-11-18 14:18:16,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 14:18:16,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:16,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:16,630 INFO L85 PathProgramCache]: Analyzing trace with hash -851512189, now seen corresponding path program 1 times [2024-11-18 14:18:16,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:16,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790601299] [2024-11-18 14:18:16,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:16,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:16,688 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-18 14:18:16,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:16,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790601299] [2024-11-18 14:18:16,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790601299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:16,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:16,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:18:16,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48388702] [2024-11-18 14:18:16,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:16,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:18:16,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:16,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:18:16,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:18:16,691 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-18 14:18:16,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:16,709 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2024-11-18 14:18:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:18:16,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2024-11-18 14:18:16,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:16,711 INFO L225 Difference]: With dead ends: 115 [2024-11-18 14:18:16,711 INFO L226 Difference]: Without dead ends: 61 [2024-11-18 14:18:16,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:18:16,712 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 76 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-18 14:18:16,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 76 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:18:16,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-18 14:18:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-18 14:18:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3125) internal successors, (63), 53 states have internal predecessors, (63), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 14:18:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2024-11-18 14:18:16,729 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 28 [2024-11-18 14:18:16,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:16,731 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2024-11-18 14:18:16,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-18 14:18:16,731 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2024-11-18 14:18:16,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-18 14:18:16,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:16,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:16,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 14:18:16,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:16,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:16,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1802696392, now seen corresponding path program 1 times [2024-11-18 14:18:16,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:16,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883975369] [2024-11-18 14:18:16,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:16,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:16,768 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-18 14:18:16,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:16,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883975369] [2024-11-18 14:18:16,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883975369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:16,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:16,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:18:16,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854771617] [2024-11-18 14:18:16,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:16,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:18:16,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:16,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:18:16,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:18:16,771 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:16,798 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2024-11-18 14:18:16,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:18:16,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-18 14:18:16,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:16,802 INFO L225 Difference]: With dead ends: 154 [2024-11-18 14:18:16,802 INFO L226 Difference]: Without dead ends: 100 [2024-11-18 14:18:16,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:18:16,804 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 66 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:18:16,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 133 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:18:16,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-18 14:18:16,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-11-18 14:18:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 83 states have internal predecessors, (99), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-18 14:18:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 123 transitions. [2024-11-18 14:18:16,817 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 123 transitions. Word has length 33 [2024-11-18 14:18:16,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:16,817 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 123 transitions. [2024-11-18 14:18:16,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 123 transitions. [2024-11-18 14:18:16,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-18 14:18:16,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:16,818 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] [2024-11-18 14:18:16,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 14:18:16,818 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:16,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:16,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1480574080, now seen corresponding path program 1 times [2024-11-18 14:18:16,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:16,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030066055] [2024-11-18 14:18:16,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:16,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:16,922 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-18 14:18:16,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:16,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030066055] [2024-11-18 14:18:16,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030066055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:16,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:16,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:18:16,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204620242] [2024-11-18 14:18:16,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:16,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:18:16,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:16,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:18:16,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:18:16,924 INFO L87 Difference]: Start difference. First operand 98 states and 123 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:16,984 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2024-11-18 14:18:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:18:16,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2024-11-18 14:18:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:16,988 INFO L225 Difference]: With dead ends: 100 [2024-11-18 14:18:16,988 INFO L226 Difference]: Without dead ends: 98 [2024-11-18 14:18:16,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-18 14:18:16,989 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 52 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:18:16,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 283 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:18:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-18 14:18:16,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-18 14:18:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 83 states have internal predecessors, (98), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-18 14:18:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 122 transitions. [2024-11-18 14:18:17,001 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 122 transitions. Word has length 39 [2024-11-18 14:18:17,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:17,002 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 122 transitions. [2024-11-18 14:18:17,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2024-11-18 14:18:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-18 14:18:17,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:17,003 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:17,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 14:18:17,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:17,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:17,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1339383127, now seen corresponding path program 1 times [2024-11-18 14:18:17,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:17,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610330091] [2024-11-18 14:18:17,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:17,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 14:18:17,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:17,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610330091] [2024-11-18 14:18:17,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610330091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:17,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:17,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:18:17,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057796632] [2024-11-18 14:18:17,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:17,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:18:17,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:17,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:18:17,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:18:17,108 INFO L87 Difference]: Start difference. First operand 98 states and 122 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:17,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:17,169 INFO L93 Difference]: Finished difference Result 192 states and 245 transitions. [2024-11-18 14:18:17,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:18:17,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-18 14:18:17,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:17,170 INFO L225 Difference]: With dead ends: 192 [2024-11-18 14:18:17,170 INFO L226 Difference]: Without dead ends: 101 [2024-11-18 14:18:17,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:18:17,172 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:18:17,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:18:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-18 14:18:17,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-18 14:18:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 86 states have internal predecessors, (101), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-18 14:18:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2024-11-18 14:18:17,192 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 45 [2024-11-18 14:18:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:17,193 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2024-11-18 14:18:17,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2024-11-18 14:18:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-18 14:18:17,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:17,194 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:17,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 14:18:17,194 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:17,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:17,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1473396633, now seen corresponding path program 1 times [2024-11-18 14:18:17,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:17,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955091430] [2024-11-18 14:18:17,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:17,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 14:18:17,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:17,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955091430] [2024-11-18 14:18:17,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955091430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:17,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:17,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:18:17,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131798761] [2024-11-18 14:18:17,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:17,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:18:17,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:17,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:18:17,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:18:17,302 INFO L87 Difference]: Start difference. First operand 101 states and 125 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:17,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:17,356 INFO L93 Difference]: Finished difference Result 197 states and 250 transitions. [2024-11-18 14:18:17,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:18:17,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-18 14:18:17,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:17,358 INFO L225 Difference]: With dead ends: 197 [2024-11-18 14:18:17,358 INFO L226 Difference]: Without dead ends: 103 [2024-11-18 14:18:17,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:18:17,360 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 62 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:18:17,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 216 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:18:17,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-18 14:18:17,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-18 14:18:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.271604938271605) internal successors, (103), 88 states have internal predecessors, (103), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-18 14:18:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2024-11-18 14:18:17,372 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 45 [2024-11-18 14:18:17,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:17,372 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2024-11-18 14:18:17,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:17,373 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2024-11-18 14:18:17,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-18 14:18:17,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:17,374 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:17,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 14:18:17,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:17,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:17,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1411357019, now seen corresponding path program 1 times [2024-11-18 14:18:17,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:17,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41214920] [2024-11-18 14:18:17,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:17,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:17,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 14:18:17,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:17,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41214920] [2024-11-18 14:18:17,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41214920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:17,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:17,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:18:17,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559025900] [2024-11-18 14:18:17,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:17,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:18:17,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:17,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:18:17,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:18:17,439 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:17,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:17,459 INFO L93 Difference]: Finished difference Result 240 states and 300 transitions. [2024-11-18 14:18:17,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:18:17,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-18 14:18:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:17,461 INFO L225 Difference]: With dead ends: 240 [2024-11-18 14:18:17,461 INFO L226 Difference]: Without dead ends: 144 [2024-11-18 14:18:17,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:18:17,462 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 34 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:18:17,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 141 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:18:17,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-18 14:18:17,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-18 14:18:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 113 states have (on average 1.247787610619469) internal successors, (141), 121 states have internal predecessors, (141), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-18 14:18:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 175 transitions. [2024-11-18 14:18:17,481 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 175 transitions. Word has length 45 [2024-11-18 14:18:17,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:17,482 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 175 transitions. [2024-11-18 14:18:17,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:17,482 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2024-11-18 14:18:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-18 14:18:17,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:17,486 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:17,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 14:18:17,486 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:17,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:17,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1522141247, now seen corresponding path program 1 times [2024-11-18 14:18:17,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:17,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108055930] [2024-11-18 14:18:17,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:17,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-18 14:18:17,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:17,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108055930] [2024-11-18 14:18:17,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108055930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:17,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:17,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 14:18:17,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45204694] [2024-11-18 14:18:17,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:17,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 14:18:17,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:17,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 14:18:17,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-18 14:18:17,642 INFO L87 Difference]: Start difference. First operand 144 states and 175 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 14:18:17,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:17,813 INFO L93 Difference]: Finished difference Result 407 states and 514 transitions. [2024-11-18 14:18:17,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 14:18:17,814 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2024-11-18 14:18:17,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:17,817 INFO L225 Difference]: With dead ends: 407 [2024-11-18 14:18:17,818 INFO L226 Difference]: Without dead ends: 270 [2024-11-18 14:18:17,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-18 14:18:17,820 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 62 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:18:17,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 482 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:18:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-18 14:18:17,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2024-11-18 14:18:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 209 states have (on average 1.229665071770335) internal successors, (257), 222 states have internal predecessors, (257), 32 states have call successors, (32), 30 states have call predecessors, (32), 28 states have return successors, (40), 30 states have call predecessors, (40), 32 states have call successors, (40) [2024-11-18 14:18:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 329 transitions. [2024-11-18 14:18:17,851 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 329 transitions. Word has length 49 [2024-11-18 14:18:17,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:17,851 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 329 transitions. [2024-11-18 14:18:17,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 14:18:17,852 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 329 transitions. [2024-11-18 14:18:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-18 14:18:17,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:17,855 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:17,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 14:18:17,855 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:17,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:17,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1913790136, now seen corresponding path program 1 times [2024-11-18 14:18:17,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:17,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507421412] [2024-11-18 14:18:17,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-18 14:18:18,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:18,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507421412] [2024-11-18 14:18:18,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507421412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:18:18,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018441258] [2024-11-18 14:18:18,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:18,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:18:18,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:18:18,050 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:18:18,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 14:18:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:18,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 14:18:18,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:18:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 14:18:18,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 14:18:18,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018441258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:18,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 14:18:18,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2024-11-18 14:18:18,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996437744] [2024-11-18 14:18:18,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:18,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 14:18:18,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:18,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 14:18:18,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-18 14:18:18,307 INFO L87 Difference]: Start difference. First operand 270 states and 329 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 14:18:18,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:18,407 INFO L93 Difference]: Finished difference Result 533 states and 651 transitions. [2024-11-18 14:18:18,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 14:18:18,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 85 [2024-11-18 14:18:18,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:18,410 INFO L225 Difference]: With dead ends: 533 [2024-11-18 14:18:18,410 INFO L226 Difference]: Without dead ends: 270 [2024-11-18 14:18:18,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-18 14:18:18,412 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 45 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:18:18,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 447 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:18:18,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-18 14:18:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2024-11-18 14:18:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 209 states have (on average 1.2105263157894737) internal successors, (253), 222 states have internal predecessors, (253), 32 states have call successors, (32), 30 states have call predecessors, (32), 28 states have return successors, (35), 30 states have call predecessors, (35), 32 states have call successors, (35) [2024-11-18 14:18:18,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 320 transitions. [2024-11-18 14:18:18,438 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 320 transitions. Word has length 85 [2024-11-18 14:18:18,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:18,438 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 320 transitions. [2024-11-18 14:18:18,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 14:18:18,439 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 320 transitions. [2024-11-18 14:18:18,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-18 14:18:18,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:18,440 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:18,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 14:18:18,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-18 14:18:18,642 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:18,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:18,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1462219428, now seen corresponding path program 1 times [2024-11-18 14:18:18,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:18,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677314723] [2024-11-18 14:18:18,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:18,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 14:18:18,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 14:18:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 14:18:18,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 14:18:18,744 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 14:18:18,745 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 14:18:18,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 14:18:18,748 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:18,818 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 14:18:18,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:18:18 BoogieIcfgContainer [2024-11-18 14:18:18,822 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 14:18:18,823 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 14:18:18,823 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 14:18:18,823 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 14:18:18,824 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:18:16" (3/4) ... [2024-11-18 14:18:18,824 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 14:18:18,884 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 14:18:18,884 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 14:18:18,885 INFO L158 Benchmark]: Toolchain (without parser) took 3892.57ms. Allocated memory was 184.5MB in the beginning and 289.4MB in the end (delta: 104.9MB). Free memory was 113.8MB in the beginning and 146.0MB in the end (delta: -32.3MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. [2024-11-18 14:18:18,885 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 14:18:18,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.99ms. Allocated memory is still 184.5MB. Free memory was 113.4MB in the beginning and 92.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-18 14:18:18,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.81ms. Allocated memory is still 184.5MB. Free memory was 92.5MB in the beginning and 90.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:18:18,885 INFO L158 Benchmark]: Boogie Preprocessor took 33.14ms. Allocated memory is still 184.5MB. Free memory was 90.1MB in the beginning and 88.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:18:18,886 INFO L158 Benchmark]: RCFGBuilder took 481.88ms. Allocated memory is still 184.5MB. Free memory was 88.0MB in the beginning and 143.1MB in the end (delta: -55.1MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-11-18 14:18:18,886 INFO L158 Benchmark]: TraceAbstraction took 2707.77ms. Allocated memory was 184.5MB in the beginning and 289.4MB in the end (delta: 104.9MB). Free memory was 142.2MB in the beginning and 152.3MB in the end (delta: -10.2MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. [2024-11-18 14:18:18,886 INFO L158 Benchmark]: Witness Printer took 61.37ms. Allocated memory is still 289.4MB. Free memory was 152.3MB in the beginning and 146.0MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 14:18:18,887 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.15ms. Allocated memory is still 184.5MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 559.99ms. Allocated memory is still 184.5MB. Free memory was 113.4MB in the beginning and 92.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.81ms. Allocated memory is still 184.5MB. Free memory was 92.5MB in the beginning and 90.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.14ms. Allocated memory is still 184.5MB. Free memory was 90.1MB in the beginning and 88.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 481.88ms. Allocated memory is still 184.5MB. Free memory was 88.0MB in the beginning and 143.1MB in the end (delta: -55.1MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2707.77ms. Allocated memory was 184.5MB in the beginning and 289.4MB in the end (delta: 104.9MB). Free memory was 142.2MB in the beginning and 152.3MB in the end (delta: -10.2MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. * Witness Printer took 61.37ms. Allocated memory is still 289.4MB. Free memory was 152.3MB in the beginning and 146.0MB in the end (delta: 6.3MB). 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,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [415] - GenericResultAtLocation [Line: 484]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [484] - GenericResultAtLocation [Line: 583]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [583] - GenericResultAtLocation [Line: 758]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [758] - GenericResultAtLocation [Line: 857]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [857] - GenericResultAtLocation [Line: 892]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [892] - GenericResultAtLocation [Line: 901]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [901] * 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: 897]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L219] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L490] int waterLevel = 1; [L491] int methaneLevelCritical = 0; [L588] int pumpRunning = 0; [L589] int systemActive = 1; [L759] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L835] int retValue_acc ; [L836] int tmp ; [L840] FCALL select_helpers() [L841] FCALL select_features() [L842] CALL, EXPR valid_product() [L884] int retValue_acc ; [L887] retValue_acc = 1 [L888] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L842] RET, EXPR valid_product() [L842] tmp = valid_product() [L844] COND TRUE \read(tmp) [L846] FCALL setup() [L847] CALL runTest() [L826] CALL test() [L421] int splverifierCounter ; [L422] int tmp ; [L423] int tmp___0 ; [L424] int tmp___1 ; [L425] int tmp___2 ; [L428] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L430] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L432] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L438] tmp = __VERIFIER_nondet_int() [L440] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L442] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L508] COND TRUE waterLevel < 2 [L509] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L442] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L448] tmp___0 = __VERIFIER_nondet_int() [L450] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L458] tmp___2 = __VERIFIER_nondet_int() [L460] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L473] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L596] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L603] COND TRUE \read(systemActive) [L605] CALL processEnvironment() [L625] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L628] COND TRUE ! pumpRunning [L630] CALL, EXPR isHighWaterLevel() [L740] int retValue_acc ; [L741] int tmp ; [L742] int tmp___0 ; [L746] CALL, EXPR isHighWaterSensorDry() [L570] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L573] COND FALSE !(waterLevel < 2) [L577] retValue_acc = 0 [L578] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L746] RET, EXPR isHighWaterSensorDry() [L746] tmp = isHighWaterSensorDry() [L748] COND FALSE !(\read(tmp)) [L751] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L753] retValue_acc = tmp___0 [L754] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L630] RET, EXPR isHighWaterLevel() [L630] tmp = isHighWaterLevel() [L632] COND TRUE \read(tmp) [L634] CALL activatePump() [L659] int tmp ; [L663] CALL, EXPR isMethaneAlarm() [L684] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L688] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L529] int retValue_acc ; [L532] retValue_acc = methaneLevelCritical [L533] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L688] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L688] retValue_acc = isMethaneLevelCritical() [L690] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L663] RET, EXPR isMethaneAlarm() [L663] tmp = isMethaneAlarm() [L665] COND FALSE !(\read(tmp)) [L669] CALL activatePump__wrappee__highWaterSensor() [L653] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L669] RET activatePump__wrappee__highWaterSensor() [L634] RET activatePump() [L605] RET processEnvironment() [L611] CALL __utac_acc__Specification1_spec__1() [L903] int tmp ; [L904] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L908] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L529] int retValue_acc ; [L532] retValue_acc = methaneLevelCritical [L533] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L908] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L908] tmp = isMethaneLevelCritical() [L910] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L611] RET __utac_acc__Specification1_spec__1() [L473] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L430] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L432] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L438] tmp = __VERIFIER_nondet_int() [L440] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L448] tmp___0 = __VERIFIER_nondet_int() [L450] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L452] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L520] COND FALSE !(\read(methaneLevelCritical)) [L523] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L452] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L458] tmp___2 = __VERIFIER_nondet_int() [L460] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L473] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L596] COND TRUE \read(pumpRunning) [L598] CALL lowerWaterLevel() [L496] COND TRUE waterLevel > 0 [L497] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L598] RET lowerWaterLevel() [L603] COND TRUE \read(systemActive) [L605] CALL processEnvironment() [L625] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L628] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L643] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L605] RET processEnvironment() [L611] CALL __utac_acc__Specification1_spec__1() [L903] int tmp ; [L904] int tmp___0 ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L908] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L529] int retValue_acc ; [L532] retValue_acc = methaneLevelCritical [L533] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L908] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L908] tmp = isMethaneLevelCritical() [L910] COND TRUE \read(tmp) [L912] CALL, EXPR isPumpRunning() [L695] int retValue_acc ; [L698] retValue_acc = pumpRunning [L699] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L912] RET, EXPR isPumpRunning() [L912] tmp___0 = isPumpRunning() [L914] COND TRUE \read(tmp___0) [L916] CALL __automaton_fail() [L897] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 399 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 2304 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1459 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 298 IncrementalHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 845 mSDtfsCounter, 298 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270occurred in iteration=9, InterpolantAutomatonStates: 49, 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, 10 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 582 NumberOfCodeBlocks, 582 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 490 ConstructedInterpolants, 0 QuantifiedInterpolants, 855 SizeOfPredicates, 0 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 66/72 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-18 14:18:18,910 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