./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product33.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 5399744cbc243992ccbbf21bf0e09dd5dced55fce1050770392b2964c31c4145 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:09:50,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:09:50,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:09:50,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:09:50,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:09:50,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:09:50,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:09:50,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:09:50,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:09:50,736 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:09:50,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:09:50,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:09:50,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:09:50,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:09:50,737 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:09:50,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:09:50,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:09:50,738 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:09:50,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:09:50,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:09:50,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:09:50,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:09:50,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:09:50,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:09:50,745 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:09:50,745 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:09:50,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:09:50,745 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:09:50,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:09:50,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:09:50,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:09:50,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:09:50,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:09:50,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:09:50,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:09:50,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:09:50,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:09:50,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:09:50,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:09:50,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:09:50,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:09:50,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:09:50,751 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 -> 5399744cbc243992ccbbf21bf0e09dd5dced55fce1050770392b2964c31c4145 [2024-10-14 03:09:51,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:09:51,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:09:51,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:09:51,031 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:09:51,032 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:09:51,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c [2024-10-14 03:09:52,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:09:52,723 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:09:52,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c [2024-10-14 03:09:52,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c0892dd/33c9678cf29949a19a2d70b3b352da5f/FLAG1c228312c [2024-10-14 03:09:53,049 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c0892dd/33c9678cf29949a19a2d70b3b352da5f [2024-10-14 03:09:53,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:09:53,055 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:09:53,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:09:53,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:09:53,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:09:53,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:09:53" (1/1) ... [2024-10-14 03:09:53,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b869bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:53, skipping insertion in model container [2024-10-14 03:09:53,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:09:53" (1/1) ... [2024-10-14 03:09:53,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:09:53,388 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c[17260,17273] [2024-10-14 03:09:53,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:09:53,406 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:09:53,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-10-14 03:09:53,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [415] [2024-10-14 03:09:53,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [519] [2024-10-14 03:09:53,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [554] [2024-10-14 03:09:53,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [619] [2024-10-14 03:09:53,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [718] [2024-10-14 03:09:53,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [874] [2024-10-14 03:09:53,420 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [883] [2024-10-14 03:09:53,508 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c[17260,17273] [2024-10-14 03:09:53,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:09:53,538 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:09:53,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:53 WrapperNode [2024-10-14 03:09:53,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:09:53,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:09:53,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:09:53,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:09:53,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:53" (1/1) ... [2024-10-14 03:09:53,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:53" (1/1) ... [2024-10-14 03:09:53,605 INFO L138 Inliner]: procedures = 52, calls = 93, calls flagged for inlining = 21, calls inlined = 17, statements flattened = 170 [2024-10-14 03:09:53,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:09:53,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:09:53,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:09:53,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:09:53,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:53" (1/1) ... [2024-10-14 03:09:53,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:53" (1/1) ... [2024-10-14 03:09:53,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:53" (1/1) ... [2024-10-14 03:09:53,649 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:09:53,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:53" (1/1) ... [2024-10-14 03:09:53,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:53" (1/1) ... [2024-10-14 03:09:53,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:53" (1/1) ... [2024-10-14 03:09:53,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:53" (1/1) ... [2024-10-14 03:09:53,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:53" (1/1) ... [2024-10-14 03:09:53,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:53" (1/1) ... [2024-10-14 03:09:53,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:09:53,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:09:53,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:09:53,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:09:53,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:53" (1/1) ... [2024-10-14 03:09:53,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:09:53,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:09:53,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:09:53,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:09:53,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:09:53,774 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-14 03:09:53,774 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-14 03:09:53,774 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 03:09:53,774 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 03:09:53,774 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 03:09:53,775 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 03:09:53,775 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-14 03:09:53,775 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-14 03:09:53,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:09:53,776 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-14 03:09:53,776 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-14 03:09:53,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:09:53,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:09:53,860 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:09:53,863 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:09:54,172 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-14 03:09:54,173 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:09:54,242 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:09:54,242 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 03:09:54,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:09:54 BoogieIcfgContainer [2024-10-14 03:09:54,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:09:54,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:09:54,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:09:54,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:09:54,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:09:53" (1/3) ... [2024-10-14 03:09:54,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653d7034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:09:54, skipping insertion in model container [2024-10-14 03:09:54,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:53" (2/3) ... [2024-10-14 03:09:54,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653d7034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:09:54, skipping insertion in model container [2024-10-14 03:09:54,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:09:54" (3/3) ... [2024-10-14 03:09:54,255 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product33.cil.c [2024-10-14 03:09:54,272 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:09:54,273 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:09:54,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:09:54,360 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;@4ad61221, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:09:54,360 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:09:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 45 states have internal predecessors, (62), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 03:09:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 03:09:54,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:54,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:54,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:54,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:54,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1893468826, now seen corresponding path program 1 times [2024-10-14 03:09:54,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:54,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250844593] [2024-10-14 03:09:54,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:54,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:54,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:54,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250844593] [2024-10-14 03:09:54,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250844593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:54,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:54,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:09:54,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794001008] [2024-10-14 03:09:54,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:54,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:09:54,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:54,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:09:54,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:09:54,618 INFO L87 Difference]: Start difference. First operand has 54 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 45 states have internal predecessors, (62), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:54,674 INFO L93 Difference]: Finished difference Result 106 states and 157 transitions. [2024-10-14 03:09:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:09:54,677 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 03:09:54,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:54,687 INFO L225 Difference]: With dead ends: 106 [2024-10-14 03:09:54,687 INFO L226 Difference]: Without dead ends: 49 [2024-10-14 03:09:54,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:09:54,695 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:54,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:54,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-14 03:09:54,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-14 03:09:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 41 states have internal predecessors, (52), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 03:09:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2024-10-14 03:09:54,760 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 12 [2024-10-14 03:09:54,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:54,761 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2024-10-14 03:09:54,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:54,761 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2024-10-14 03:09:54,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 03:09:54,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:54,768 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:54,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:09:54,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:54,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:54,769 INFO L85 PathProgramCache]: Analyzing trace with hash 354765097, now seen corresponding path program 1 times [2024-10-14 03:09:54,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:54,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334068589] [2024-10-14 03:09:54,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:54,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:54,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:54,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:54,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334068589] [2024-10-14 03:09:54,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334068589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:54,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:54,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:09:54,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657134414] [2024-10-14 03:09:54,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:54,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:09:54,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:54,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:09:54,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:54,924 INFO L87 Difference]: Start difference. First operand 49 states and 67 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:54,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:54,954 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2024-10-14 03:09:54,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:09:54,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 03:09:54,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:54,956 INFO L225 Difference]: With dead ends: 71 [2024-10-14 03:09:54,956 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 03:09:54,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:54,958 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 11 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 82 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-10-14 03:09:54,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 82 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 03:09:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-14 03:09:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 36 states have internal predecessors, (46), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 03:09:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2024-10-14 03:09:54,965 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 13 [2024-10-14 03:09:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:54,965 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2024-10-14 03:09:54,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2024-10-14 03:09:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 03:09:54,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:54,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:54,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:09:54,967 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:54,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:54,967 INFO L85 PathProgramCache]: Analyzing trace with hash -181885611, now seen corresponding path program 1 times [2024-10-14 03:09:54,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:54,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138312777] [2024-10-14 03:09:54,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:55,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:55,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138312777] [2024-10-14 03:09:55,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138312777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:55,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:55,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:09:55,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560278481] [2024-10-14 03:09:55,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:55,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:09:55,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:55,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:09:55,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:55,060 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:55,090 INFO L93 Difference]: Finished difference Result 80 states and 111 transitions. [2024-10-14 03:09:55,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:09:55,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 03:09:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:55,094 INFO L225 Difference]: With dead ends: 80 [2024-10-14 03:09:55,094 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 03:09:55,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:55,099 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:55,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 46 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 03:09:55,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-14 03:09:55,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 36 states have internal predecessors, (45), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 03:09:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2024-10-14 03:09:55,112 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 16 [2024-10-14 03:09:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:55,112 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2024-10-14 03:09:55,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:55,113 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2024-10-14 03:09:55,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 03:09:55,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:55,116 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:55,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:09:55,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:55,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:55,117 INFO L85 PathProgramCache]: Analyzing trace with hash 456650498, now seen corresponding path program 1 times [2024-10-14 03:09:55,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:55,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441009304] [2024-10-14 03:09:55,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:55,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:55,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:55,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441009304] [2024-10-14 03:09:55,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441009304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:55,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:55,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:09:55,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621465409] [2024-10-14 03:09:55,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:55,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:09:55,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:55,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:09:55,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:55,168 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:09:55,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:55,229 INFO L93 Difference]: Finished difference Result 110 states and 150 transitions. [2024-10-14 03:09:55,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:09:55,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-14 03:09:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:55,233 INFO L225 Difference]: With dead ends: 110 [2024-10-14 03:09:55,233 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 03:09:55,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:55,235 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 45 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:55,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 86 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:55,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 03:09:55,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-10-14 03:09:55,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 58 states have internal predecessors, (74), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-14 03:09:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2024-10-14 03:09:55,263 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 21 [2024-10-14 03:09:55,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:55,263 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2024-10-14 03:09:55,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:09:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2024-10-14 03:09:55,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 03:09:55,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:55,264 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:55,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:09:55,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:55,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:55,265 INFO L85 PathProgramCache]: Analyzing trace with hash -205165809, now seen corresponding path program 1 times [2024-10-14 03:09:55,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:55,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525349696] [2024-10-14 03:09:55,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:55,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:55,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:55,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525349696] [2024-10-14 03:09:55,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525349696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:55,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:55,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:09:55,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651894465] [2024-10-14 03:09:55,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:55,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:09:55,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:55,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:09:55,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:55,377 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:55,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:55,442 INFO L93 Difference]: Finished difference Result 199 states and 282 transitions. [2024-10-14 03:09:55,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:09:55,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-14 03:09:55,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:55,446 INFO L225 Difference]: With dead ends: 199 [2024-10-14 03:09:55,447 INFO L226 Difference]: Without dead ends: 132 [2024-10-14 03:09:55,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:55,449 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 37 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:55,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:55,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-14 03:09:55,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2024-10-14 03:09:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 108 states have internal predecessors, (140), 16 states have call successors, (16), 16 states have call predecessors, (16), 14 states have return successors, (24), 14 states have call predecessors, (24), 16 states have call successors, (24) [2024-10-14 03:09:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 180 transitions. [2024-10-14 03:09:55,487 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 180 transitions. Word has length 23 [2024-10-14 03:09:55,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:55,489 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 180 transitions. [2024-10-14 03:09:55,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:55,489 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 180 transitions. [2024-10-14 03:09:55,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 03:09:55,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:55,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:55,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:09:55,491 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:55,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:55,491 INFO L85 PathProgramCache]: Analyzing trace with hash 187861201, now seen corresponding path program 1 times [2024-10-14 03:09:55,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:55,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185663380] [2024-10-14 03:09:55,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:55,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:55,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:55,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185663380] [2024-10-14 03:09:55,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185663380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:55,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:55,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:09:55,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990319271] [2024-10-14 03:09:55,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:55,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:09:55,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:55,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:09:55,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:09:55,558 INFO L87 Difference]: Start difference. First operand 130 states and 180 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:55,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:55,603 INFO L93 Difference]: Finished difference Result 262 states and 370 transitions. [2024-10-14 03:09:55,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:09:55,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-14 03:09:55,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:55,605 INFO L225 Difference]: With dead ends: 262 [2024-10-14 03:09:55,605 INFO L226 Difference]: Without dead ends: 134 [2024-10-14 03:09:55,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:09:55,608 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:55,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:55,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-14 03:09:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-14 03:09:55,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 16 states have call predecessors, (16), 14 states have return successors, (24), 14 states have call predecessors, (24), 16 states have call successors, (24) [2024-10-14 03:09:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 184 transitions. [2024-10-14 03:09:55,625 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 184 transitions. Word has length 23 [2024-10-14 03:09:55,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:55,625 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 184 transitions. [2024-10-14 03:09:55,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 184 transitions. [2024-10-14 03:09:55,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 03:09:55,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:55,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:55,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:09:55,627 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:55,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:55,628 INFO L85 PathProgramCache]: Analyzing trace with hash -621485425, now seen corresponding path program 1 times [2024-10-14 03:09:55,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:55,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864578457] [2024-10-14 03:09:55,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:55,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:55,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:55,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864578457] [2024-10-14 03:09:55,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864578457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:55,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:55,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:09:55,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537447663] [2024-10-14 03:09:55,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:55,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:09:55,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:55,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:09:55,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:09:55,718 INFO L87 Difference]: Start difference. First operand 134 states and 184 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:55,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:55,792 INFO L93 Difference]: Finished difference Result 264 states and 369 transitions. [2024-10-14 03:09:55,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:09:55,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-14 03:09:55,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:55,797 INFO L225 Difference]: With dead ends: 264 [2024-10-14 03:09:55,797 INFO L226 Difference]: Without dead ends: 132 [2024-10-14 03:09:55,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:09:55,802 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:55,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:09:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-14 03:09:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-14 03:09:55,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 101 states have (on average 1.386138613861386) internal successors, (140), 109 states have internal predecessors, (140), 16 states have call successors, (16), 16 states have call predecessors, (16), 14 states have return successors, (22), 14 states have call predecessors, (22), 16 states have call successors, (22) [2024-10-14 03:09:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 178 transitions. [2024-10-14 03:09:55,819 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 178 transitions. Word has length 23 [2024-10-14 03:09:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:55,820 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 178 transitions. [2024-10-14 03:09:55,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 178 transitions. [2024-10-14 03:09:55,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 03:09:55,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:55,821 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] [2024-10-14 03:09:55,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:09:55,822 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:55,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:55,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1381401528, now seen corresponding path program 1 times [2024-10-14 03:09:55,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:55,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193896367] [2024-10-14 03:09:55,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:55,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:09:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:55,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:55,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193896367] [2024-10-14 03:09:55,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193896367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:55,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:55,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:09:55,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125136026] [2024-10-14 03:09:55,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:55,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:09:55,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:55,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:09:55,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:09:55,887 INFO L87 Difference]: Start difference. First operand 132 states and 178 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:09:55,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:55,961 INFO L93 Difference]: Finished difference Result 134 states and 179 transitions. [2024-10-14 03:09:55,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:09:55,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-14 03:09:55,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:55,963 INFO L225 Difference]: With dead ends: 134 [2024-10-14 03:09:55,963 INFO L226 Difference]: Without dead ends: 132 [2024-10-14 03:09:55,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:09:55,966 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 34 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:55,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 124 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:55,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-14 03:09:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-14 03:09:55,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 109 states have internal predecessors, (138), 16 states have call successors, (16), 16 states have call predecessors, (16), 14 states have return successors, (22), 14 states have call predecessors, (22), 16 states have call successors, (22) [2024-10-14 03:09:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 176 transitions. [2024-10-14 03:09:55,989 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 176 transitions. Word has length 26 [2024-10-14 03:09:55,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:55,990 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 176 transitions. [2024-10-14 03:09:55,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:09:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 176 transitions. [2024-10-14 03:09:55,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 03:09:55,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:55,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:55,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:09:55,997 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:55,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:55,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2143108455, now seen corresponding path program 1 times [2024-10-14 03:09:55,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:55,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508849417] [2024-10-14 03:09:55,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:55,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:56,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:09:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:56,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:56,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508849417] [2024-10-14 03:09:56,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508849417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:56,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:56,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:09:56,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690733934] [2024-10-14 03:09:56,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:56,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:09:56,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:56,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:09:56,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:09:56,075 INFO L87 Difference]: Start difference. First operand 132 states and 176 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:09:56,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:56,274 INFO L93 Difference]: Finished difference Result 343 states and 478 transitions. [2024-10-14 03:09:56,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:09:56,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-10-14 03:09:56,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:56,277 INFO L225 Difference]: With dead ends: 343 [2024-10-14 03:09:56,277 INFO L226 Difference]: Without dead ends: 213 [2024-10-14 03:09:56,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:09:56,280 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 69 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:56,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 206 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:09:56,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-14 03:09:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2024-10-14 03:09:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 163 states have (on average 1.3190184049079754) internal successors, (215), 177 states have internal predecessors, (215), 24 states have call successors, (24), 21 states have call predecessors, (24), 23 states have return successors, (43), 22 states have call predecessors, (43), 24 states have call successors, (43) [2024-10-14 03:09:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 282 transitions. [2024-10-14 03:09:56,311 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 282 transitions. Word has length 27 [2024-10-14 03:09:56,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:56,311 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 282 transitions. [2024-10-14 03:09:56,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:09:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 282 transitions. [2024-10-14 03:09:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 03:09:56,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:56,313 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:09:56,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:09:56,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:56,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:56,314 INFO L85 PathProgramCache]: Analyzing trace with hash -111949826, now seen corresponding path program 1 times [2024-10-14 03:09:56,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:56,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374269117] [2024-10-14 03:09:56,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:56,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:56,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:09:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:56,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:56,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 03:09:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:56,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:56,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374269117] [2024-10-14 03:09:56,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374269117] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:09:56,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693496812] [2024-10-14 03:09:56,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:56,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:09:56,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:09:56,478 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:09:56,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:09:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:56,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 03:09:56,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:09:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:56,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:09:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:56,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693496812] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:09:56,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:09:56,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2024-10-14 03:09:56,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238753646] [2024-10-14 03:09:56,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:09:56,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:09:56,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:56,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:09:56,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:09:56,798 INFO L87 Difference]: Start difference. First operand 211 states and 282 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 03:09:57,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:57,142 INFO L93 Difference]: Finished difference Result 525 states and 721 transitions. [2024-10-14 03:09:57,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:09:57,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2024-10-14 03:09:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:57,147 INFO L225 Difference]: With dead ends: 525 [2024-10-14 03:09:57,147 INFO L226 Difference]: Without dead ends: 316 [2024-10-14 03:09:57,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:09:57,152 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 123 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:57,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 237 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:09:57,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-14 03:09:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 288. [2024-10-14 03:09:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 222 states have (on average 1.3018018018018018) internal successors, (289), 241 states have internal predecessors, (289), 33 states have call successors, (33), 29 states have call predecessors, (33), 32 states have return successors, (59), 29 states have call predecessors, (59), 33 states have call successors, (59) [2024-10-14 03:09:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 381 transitions. [2024-10-14 03:09:57,191 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 381 transitions. Word has length 48 [2024-10-14 03:09:57,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:57,191 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 381 transitions. [2024-10-14 03:09:57,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 03:09:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 381 transitions. [2024-10-14 03:09:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 03:09:57,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:57,193 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:57,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:09:57,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 03:09:57,398 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:57,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:57,398 INFO L85 PathProgramCache]: Analyzing trace with hash -386362937, now seen corresponding path program 2 times [2024-10-14 03:09:57,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:57,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476912126] [2024-10-14 03:09:57,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:57,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:09:57,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 03:09:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:09:57,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 03:09:57,454 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 03:09:57,455 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:09:57,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:09:57,459 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:57,526 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:09:57,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:09:57 BoogieIcfgContainer [2024-10-14 03:09:57,533 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:09:57,534 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:09:57,537 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:09:57,537 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:09:57,537 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:09:54" (3/4) ... [2024-10-14 03:09:57,538 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 03:09:57,608 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:09:57,608 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:09:57,608 INFO L158 Benchmark]: Toolchain (without parser) took 4553.84ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 135.4MB in the beginning and 98.8MB in the end (delta: 36.6MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. [2024-10-14 03:09:57,608 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 121.6MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:09:57,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.35ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 114.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 03:09:57,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.74ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 112.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:09:57,609 INFO L158 Benchmark]: Boogie Preprocessor took 62.29ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 110.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:09:57,609 INFO L158 Benchmark]: RCFGBuilder took 573.26ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 89.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 03:09:57,610 INFO L158 Benchmark]: TraceAbstraction took 3285.96ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 88.5MB in the beginning and 104.0MB in the end (delta: -15.6MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-10-14 03:09:57,610 INFO L158 Benchmark]: Witness Printer took 73.90ms. Allocated memory is still 201.3MB. Free memory was 104.0MB in the beginning and 98.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 03:09:57,611 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.22ms. Allocated memory is still 121.6MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.35ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 114.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.74ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 112.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.29ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 110.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 573.26ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 89.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3285.96ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 88.5MB in the beginning and 104.0MB in the end (delta: -15.6MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Witness Printer took 73.90ms. Allocated memory is still 201.3MB. Free memory was 104.0MB in the beginning and 98.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [415] - GenericResultAtLocation [Line: 519]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [519] - GenericResultAtLocation [Line: 554]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [554] - GenericResultAtLocation [Line: 619]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [619] - GenericResultAtLocation [Line: 718]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [718] - GenericResultAtLocation [Line: 874]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [874] - GenericResultAtLocation [Line: 883]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [883] * 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: 879]: 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; [L416] int cleanupTimeShifts = 4; [L625] int waterLevel = 1; [L626] int methaneLevelCritical = 0; [L722] int pumpRunning = 0; [L723] int systemActive = 1; [L497] int retValue_acc ; [L498] int tmp ; [L502] FCALL select_helpers() [L503] FCALL select_features() [L504] CALL, EXPR valid_product() [L546] int retValue_acc ; [L549] retValue_acc = 1 [L550] return (retValue_acc); [L504] RET, EXPR valid_product() [L504] tmp = valid_product() [L506] COND TRUE \read(tmp) [L508] FCALL setup() [L509] CALL runTest() [L488] CALL test() [L556] int splverifierCounter ; [L557] int tmp ; [L558] int tmp___0 ; [L559] int tmp___1 ; [L560] int tmp___2 ; [L563] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L565] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L567] COND TRUE splverifierCounter < 4 [L573] tmp = __VERIFIER_nondet_int() [L575] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L577] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L643] COND TRUE waterLevel < 2 [L644] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L577] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L583] tmp___0 = __VERIFIER_nondet_int() [L585] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L593] tmp___2 = __VERIFIER_nondet_int() [L595] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L608] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L730] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L737] COND TRUE \read(systemActive) [L739] CALL processEnvironment() [L759] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L762] COND TRUE ! pumpRunning [L764] CALL, EXPR isHighWaterLevel() [L856] int retValue_acc ; [L857] int tmp ; [L858] int tmp___0 ; [L862] CALL, EXPR isHighWaterSensorDry() [L705] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L708] COND FALSE !(waterLevel < 2) [L712] retValue_acc = 0 [L713] 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] [L862] RET, EXPR isHighWaterSensorDry() [L862] tmp = isHighWaterSensorDry() [L864] COND FALSE !(\read(tmp)) [L867] 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] [L869] retValue_acc = tmp___0 [L870] return (retValue_acc); [L764] RET, EXPR isHighWaterLevel() [L764] tmp = isHighWaterLevel() [L766] COND TRUE \read(tmp) [L768] CALL activatePump() [L787] pumpRunning = 1 [L768] RET activatePump() [L739] RET processEnvironment() [L745] CALL __utac_acc__Specification4_spec__1() [L885] int tmp ; [L886] int tmp___0 ; [L890] CALL, EXPR getWaterLevel() [L696] int retValue_acc ; [L699] retValue_acc = waterLevel [L700] return (retValue_acc); [L890] RET, EXPR getWaterLevel() [L890] tmp = getWaterLevel() [L892] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L745] RET __utac_acc__Specification4_spec__1() [L608] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L565] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L567] COND TRUE splverifierCounter < 4 [L573] tmp = __VERIFIER_nondet_int() [L575] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L583] tmp___0 = __VERIFIER_nondet_int() [L585] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L593] tmp___2 = __VERIFIER_nondet_int() [L595] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L608] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L730] COND TRUE \read(pumpRunning) [L732] CALL lowerWaterLevel() [L631] COND TRUE waterLevel > 0 [L632] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L732] RET lowerWaterLevel() [L737] COND TRUE \read(systemActive) [L739] CALL processEnvironment() [L759] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L762] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L777] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L739] RET processEnvironment() [L745] CALL __utac_acc__Specification4_spec__1() [L885] int tmp ; [L886] int tmp___0 ; [L890] CALL, EXPR getWaterLevel() [L696] int retValue_acc ; [L699] retValue_acc = waterLevel [L700] return (retValue_acc); [L890] RET, EXPR getWaterLevel() [L890] tmp = getWaterLevel() [L892] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L745] RET __utac_acc__Specification4_spec__1() [L608] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L565] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L567] COND TRUE splverifierCounter < 4 [L573] tmp = __VERIFIER_nondet_int() [L575] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L583] tmp___0 = __VERIFIER_nondet_int() [L585] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L593] tmp___2 = __VERIFIER_nondet_int() [L595] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L608] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L730] COND TRUE \read(pumpRunning) [L732] CALL lowerWaterLevel() [L631] COND TRUE waterLevel > 0 [L632] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L732] RET lowerWaterLevel() [L737] COND TRUE \read(systemActive) [L739] CALL processEnvironment() [L759] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L762] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L777] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L739] RET processEnvironment() [L745] CALL __utac_acc__Specification4_spec__1() [L885] int tmp ; [L886] int tmp___0 ; [L890] CALL, EXPR getWaterLevel() [L696] int retValue_acc ; [L699] retValue_acc = waterLevel [L700] return (retValue_acc); [L890] RET, EXPR getWaterLevel() [L890] tmp = getWaterLevel() [L892] COND TRUE tmp == 0 [L894] CALL, EXPR isPumpRunning() [L811] int retValue_acc ; [L814] retValue_acc = pumpRunning [L815] return (retValue_acc); [L894] RET, EXPR isPumpRunning() [L894] tmp___0 = isPumpRunning() [L896] COND TRUE \read(tmp___0) [L898] CALL __automaton_fail() [L879] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 376 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363 mSDsluCounter, 1190 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 682 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 495 IncrementalHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 508 mSDtfsCounter, 495 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 122 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=10, InterpolantAutomatonStates: 46, 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, 34 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 349 NumberOfCodeBlocks, 349 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 588 SizeOfPredicates, 2 NumberOfNonLiveVariables, 201 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 32/42 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-10-14 03:09:57,643 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