./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_product34.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_product34.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 2a152d19fa28b0169076b34a0513a75c542cc933ab1c694f300fdf3273b66e93 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:09:50,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:09:50,602 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,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:09:50,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:09:50,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:09:50,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:09:50,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:09:50,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:09:50,639 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:09:50,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:09:50,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:09:50,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:09:50,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:09:50,642 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:09:50,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:09:50,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:09:50,642 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:09:50,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:09:50,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:09:50,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:09:50,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:09:50,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:09:50,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:09:50,646 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:09:50,647 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:09:50,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:09:50,647 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:09:50,647 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:09:50,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:09:50,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:09:50,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:09:50,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:09:50,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:09:50,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:09:50,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:09:50,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:09:50,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:09:50,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:09:50,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:09:50,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:09:50,650 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:09:50,650 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 -> 2a152d19fa28b0169076b34a0513a75c542cc933ab1c694f300fdf3273b66e93 [2024-10-14 03:09:50,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:09:50,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:09:50,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:09:50,901 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:09:50,901 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:09:50,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product34.cil.c [2024-10-14 03:09:52,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:09:52,693 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:09:52,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product34.cil.c [2024-10-14 03:09:52,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/166dfab9a/45b8acfe201147de9c8b647ebb9ecc35/FLAG0b98c5470 [2024-10-14 03:09:53,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/166dfab9a/45b8acfe201147de9c8b647ebb9ecc35 [2024-10-14 03:09:53,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:09:53,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:09:53,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:09:53,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:09:53,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:09:53,020 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,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f9cadfa 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,022 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,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:09:53,244 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_product34.cil.c[8026,8039] [2024-10-14 03:09:53,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:09:53,321 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:09:53,328 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [49] [2024-10-14 03:09:53,330 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [78] [2024-10-14 03:09:53,330 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [182] [2024-10-14 03:09:53,330 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [217] [2024-10-14 03:09:53,331 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [285] [2024-10-14 03:09:53,331 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [451] [2024-10-14 03:09:53,331 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [545] [2024-10-14 03:09:53,331 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [554] [2024-10-14 03:09:53,353 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_product34.cil.c[8026,8039] [2024-10-14 03:09:53,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:09:53,407 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:09:53,411 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,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:09:53,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:09:53,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:09:53,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:09:53,417 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,427 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,453 INFO L138 Inliner]: procedures = 53, calls = 94, calls flagged for inlining = 22, calls inlined = 18, statements flattened = 173 [2024-10-14 03:09:53,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:09:53,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:09:53,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:09:53,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:09:53,468 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,493 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,498 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,526 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,533 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,533 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,557 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,567 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,568 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,572 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,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:09:53,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:09:53,580 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:09:53,580 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:09:53,581 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,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:09:53,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:09:53,630 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,641 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,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:09:53,677 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-14 03:09:53,677 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-14 03:09:53,678 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 03:09:53,678 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 03:09:53,678 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 03:09:53,678 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 03:09:53,678 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-14 03:09:53,678 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-14 03:09:53,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:09:53,678 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-14 03:09:53,678 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-14 03:09:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:09:53,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:09:53,739 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:09:53,740 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:09:53,934 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-14 03:09:53,934 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:09:53,981 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:09:53,982 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 03:09:53,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:09:53 BoogieIcfgContainer [2024-10-14 03:09:53,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:09:53,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:09:53,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:09:53,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:09:53,991 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:53,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97fbd40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:09:53, skipping insertion in model container [2024-10-14 03:09:53,991 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:53,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97fbd40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:09:53, skipping insertion in model container [2024-10-14 03:09:53,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:09:53" (3/3) ... [2024-10-14 03:09:53,993 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product34.cil.c [2024-10-14 03:09:54,017 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:09:54,020 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:09:54,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:09:54,082 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;@48486e07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:09:54,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:09:54,086 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,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 03:09:54,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:54,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:54,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:54,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash -146980214, now seen corresponding path program 1 times [2024-10-14 03:09:54,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:54,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91165833] [2024-10-14 03:09:54,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:54,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:54,229 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,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:54,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91165833] [2024-10-14 03:09:54,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91165833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:54,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:54,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:09:54,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502434221] [2024-10-14 03:09:54,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:54,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:09:54,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:54,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:09:54,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:09:54,255 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,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:54,311 INFO L93 Difference]: Finished difference Result 106 states and 157 transitions. [2024-10-14 03:09:54,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:09:54,315 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,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:54,323 INFO L225 Difference]: With dead ends: 106 [2024-10-14 03:09:54,324 INFO L226 Difference]: Without dead ends: 49 [2024-10-14 03:09:54,326 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,329 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:54,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-14 03:09:54,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-14 03:09:54,360 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,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2024-10-14 03:09:54,364 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 12 [2024-10-14 03:09:54,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:54,365 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2024-10-14 03:09:54,365 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,366 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2024-10-14 03:09:54,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 03:09:54,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:54,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:54,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:09:54,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:54,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:54,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1978035827, now seen corresponding path program 1 times [2024-10-14 03:09:54,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:54,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923990348] [2024-10-14 03:09:54,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:54,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:54,487 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,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:54,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923990348] [2024-10-14 03:09:54,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923990348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:54,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:54,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:09:54,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951668390] [2024-10-14 03:09:54,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:54,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:09:54,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:54,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:09:54,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:54,495 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,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:54,534 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2024-10-14 03:09:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:09:54,534 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,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:54,535 INFO L225 Difference]: With dead ends: 71 [2024-10-14 03:09:54,535 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 03:09:54,536 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,537 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:54,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 81 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:54,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 03:09:54,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-14 03:09:54,544 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,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2024-10-14 03:09:54,545 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 13 [2024-10-14 03:09:54,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:54,545 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2024-10-14 03:09:54,545 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,549 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2024-10-14 03:09:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 03:09:54,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:54,550 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,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:09:54,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:54,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:54,551 INFO L85 PathProgramCache]: Analyzing trace with hash 258404128, now seen corresponding path program 1 times [2024-10-14 03:09:54,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:54,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595342237] [2024-10-14 03:09:54,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:54,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:54,611 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,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:54,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595342237] [2024-10-14 03:09:54,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595342237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:54,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:54,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:09:54,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904848085] [2024-10-14 03:09:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:54,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:09:54,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:54,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:09:54,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:54,617 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), 3 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:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:54,643 INFO L93 Difference]: Finished difference Result 80 states and 111 transitions. [2024-10-14 03:09:54,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:09:54,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:54,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:54,645 INFO L225 Difference]: With dead ends: 80 [2024-10-14 03:09:54,645 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 03:09:54,646 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,647 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:54,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:54,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 03:09:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-14 03:09:54,651 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:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2024-10-14 03:09:54,652 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 16 [2024-10-14 03:09:54,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:54,652 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2024-10-14 03:09:54,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2024-10-14 03:09:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 03:09:54,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:54,653 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:54,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:09:54,653 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:54,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:54,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2127089555, now seen corresponding path program 1 times [2024-10-14 03:09:54,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:54,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106757228] [2024-10-14 03:09:54,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:54,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:54,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:54,699 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,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:54,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106757228] [2024-10-14 03:09:54,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106757228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:54,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:54,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:09:54,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203363418] [2024-10-14 03:09:54,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:54,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:09:54,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:54,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:09:54,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:54,702 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:54,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:54,735 INFO L93 Difference]: Finished difference Result 110 states and 150 transitions. [2024-10-14 03:09:54,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:09:54,736 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:54,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:54,737 INFO L225 Difference]: With dead ends: 110 [2024-10-14 03:09:54,737 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 03:09:54,738 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:54,739 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 45 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:54,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 84 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 03:09:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-10-14 03:09:54,748 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:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2024-10-14 03:09:54,749 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 21 [2024-10-14 03:09:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:54,749 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2024-10-14 03:09:54,750 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:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2024-10-14 03:09:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 03:09:54,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:54,751 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:54,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:09:54,751 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:54,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:54,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1744594724, now seen corresponding path program 1 times [2024-10-14 03:09:54,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:54,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926221099] [2024-10-14 03:09:54,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:54,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:54,866 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,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:54,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926221099] [2024-10-14 03:09:54,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926221099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:54,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:54,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:09:54,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465692859] [2024-10-14 03:09:54,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:54,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:09:54,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:54,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:09:54,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:54,870 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:54,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:54,922 INFO L93 Difference]: Finished difference Result 199 states and 282 transitions. [2024-10-14 03:09:54,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:09:54,923 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:54,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:54,924 INFO L225 Difference]: With dead ends: 199 [2024-10-14 03:09:54,924 INFO L226 Difference]: Without dead ends: 132 [2024-10-14 03:09:54,925 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,926 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 37 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:54,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 82 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-14 03:09:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2024-10-14 03:09:54,939 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:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 180 transitions. [2024-10-14 03:09:54,941 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 180 transitions. Word has length 23 [2024-10-14 03:09:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:54,941 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 180 transitions. [2024-10-14 03:09:54,941 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:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 180 transitions. [2024-10-14 03:09:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 03:09:54,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:54,943 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:54,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:09:54,943 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:54,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:54,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2137621734, now seen corresponding path program 1 times [2024-10-14 03:09:54,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:54,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822648596] [2024-10-14 03:09:54,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:54,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,014 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,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:55,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822648596] [2024-10-14 03:09:55,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822648596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:55,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:55,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:09:55,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120390208] [2024-10-14 03:09:55,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:55,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:09:55,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:55,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:09:55,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:09:55,016 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,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:55,057 INFO L93 Difference]: Finished difference Result 262 states and 370 transitions. [2024-10-14 03:09:55,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:09:55,059 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,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:55,060 INFO L225 Difference]: With dead ends: 262 [2024-10-14 03:09:55,060 INFO L226 Difference]: Without dead ends: 134 [2024-10-14 03:09:55,084 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,085 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:55,085 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.0s Time] [2024-10-14 03:09:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-14 03:09:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-14 03:09:55,106 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,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 184 transitions. [2024-10-14 03:09:55,110 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 184 transitions. Word has length 23 [2024-10-14 03:09:55,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:55,110 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 184 transitions. [2024-10-14 03:09:55,110 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,110 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 184 transitions. [2024-10-14 03:09:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 03:09:55,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:55,111 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,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:09:55,111 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:55,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:55,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1328275108, now seen corresponding path program 1 times [2024-10-14 03:09:55,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:55,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332615988] [2024-10-14 03:09:55,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:55,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,177 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,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:55,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332615988] [2024-10-14 03:09:55,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332615988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:55,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:55,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:09:55,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110862621] [2024-10-14 03:09:55,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:55,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:09:55,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:55,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:09:55,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:09:55,179 INFO L87 Difference]: Start difference. First operand 134 states and 184 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:55,233 INFO L93 Difference]: Finished difference Result 264 states and 369 transitions. [2024-10-14 03:09:55,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:09:55,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:55,235 INFO L225 Difference]: With dead ends: 264 [2024-10-14 03:09:55,235 INFO L226 Difference]: Without dead ends: 132 [2024-10-14 03:09:55,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:09:55,238 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 53 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:55,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 124 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:55,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-14 03:09:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-14 03:09:55,254 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,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 178 transitions. [2024-10-14 03:09:55,256 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 178 transitions. Word has length 23 [2024-10-14 03:09:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:55,256 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 178 transitions. [2024-10-14 03:09:55,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 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,256 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 178 transitions. [2024-10-14 03:09:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 03:09:55,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:55,257 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,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:09:55,257 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:55,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:55,258 INFO L85 PathProgramCache]: Analyzing trace with hash -172457587, now seen corresponding path program 1 times [2024-10-14 03:09:55,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:55,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567815637] [2024-10-14 03:09:55,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:55,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:09:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,290 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,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:55,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567815637] [2024-10-14 03:09:55,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567815637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:55,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:55,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:09:55,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044910833] [2024-10-14 03:09:55,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:55,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:09:55,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:55,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:09:55,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:09:55,292 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,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:55,328 INFO L93 Difference]: Finished difference Result 134 states and 179 transitions. [2024-10-14 03:09:55,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:09:55,329 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,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:55,331 INFO L225 Difference]: With dead ends: 134 [2024-10-14 03:09:55,332 INFO L226 Difference]: Without dead ends: 132 [2024-10-14 03:09:55,332 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,332 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 34 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:55,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 121 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-14 03:09:55,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-14 03:09:55,352 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,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 176 transitions. [2024-10-14 03:09:55,353 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 176 transitions. Word has length 26 [2024-10-14 03:09:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:55,353 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 176 transitions. [2024-10-14 03:09:55,353 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,353 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 176 transitions. [2024-10-14 03:09:55,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 03:09:55,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:55,354 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,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:09:55,355 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:55,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:55,356 INFO L85 PathProgramCache]: Analyzing trace with hash -320689412, now seen corresponding path program 1 times [2024-10-14 03:09:55,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:55,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741951634] [2024-10-14 03:09:55,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:55,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:09:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,412 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,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:55,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741951634] [2024-10-14 03:09:55,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741951634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:55,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:55,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:09:55,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961442344] [2024-10-14 03:09:55,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:55,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:09:55,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:55,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:09:55,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:09:55,414 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:55,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:55,550 INFO L93 Difference]: Finished difference Result 402 states and 563 transitions. [2024-10-14 03:09:55,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:09:55,550 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:55,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:55,552 INFO L225 Difference]: With dead ends: 402 [2024-10-14 03:09:55,552 INFO L226 Difference]: Without dead ends: 272 [2024-10-14 03:09:55,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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:55,553 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 93 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:55,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 136 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:09:55,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-14 03:09:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 264. [2024-10-14 03:09:55,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 205 states have (on average 1.3317073170731708) internal successors, (273), 221 states have internal predecessors, (273), 29 states have call successors, (29), 26 states have call predecessors, (29), 29 states have return successors, (55), 28 states have call predecessors, (55), 29 states have call successors, (55) [2024-10-14 03:09:55,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 357 transitions. [2024-10-14 03:09:55,583 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 357 transitions. Word has length 27 [2024-10-14 03:09:55,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:55,583 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 357 transitions. [2024-10-14 03:09:55,583 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:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 357 transitions. [2024-10-14 03:09:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 03:09:55,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:55,588 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:55,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:09:55,588 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:55,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:55,588 INFO L85 PathProgramCache]: Analyzing trace with hash -217282756, now seen corresponding path program 1 times [2024-10-14 03:09:55,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:55,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187860885] [2024-10-14 03:09:55,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:55,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:09:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 03:09:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,714 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:55,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:55,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187860885] [2024-10-14 03:09:55,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187860885] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:09:55,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968809869] [2024-10-14 03:09:55,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:55,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:09:55,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:09:55,722 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:55,724 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:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:55,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 03:09:55,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:09:55,890 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:55,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:09:55,977 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:55,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968809869] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:09:55,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:09:55,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2024-10-14 03:09:55,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915084116] [2024-10-14 03:09:55,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:09:55,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:09:55,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:55,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:09:55,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:09:55,983 INFO L87 Difference]: Start difference. First operand 264 states and 357 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:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:56,271 INFO L93 Difference]: Finished difference Result 607 states and 839 transitions. [2024-10-14 03:09:56,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:09:56,272 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:56,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:56,275 INFO L225 Difference]: With dead ends: 607 [2024-10-14 03:09:56,277 INFO L226 Difference]: Without dead ends: 345 [2024-10-14 03:09:56,278 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:56,278 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 118 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:56,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 236 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:09:56,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-14 03:09:56,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 317. [2024-10-14 03:09:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 245 states have (on average 1.2938775510204081) internal successors, (317), 265 states have internal predecessors, (317), 36 states have call successors, (36), 32 states have call predecessors, (36), 35 states have return successors, (62), 32 states have call predecessors, (62), 36 states have call successors, (62) [2024-10-14 03:09:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 415 transitions. [2024-10-14 03:09:56,312 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 415 transitions. Word has length 48 [2024-10-14 03:09:56,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:56,313 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 415 transitions. [2024-10-14 03:09:56,314 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:56,314 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 415 transitions. [2024-10-14 03:09:56,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 03:09:56,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:56,317 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:56,332 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:56,518 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:56,519 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:56,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:56,520 INFO L85 PathProgramCache]: Analyzing trace with hash 508744444, now seen corresponding path program 2 times [2024-10-14 03:09:56,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:56,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943246910] [2024-10-14 03:09:56,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:56,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:09:56,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 03:09:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:09:56,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 03:09:56,576 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 03:09:56,577 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:09:56,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:09:56,581 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:56,640 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:09:56,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:09:56 BoogieIcfgContainer [2024-10-14 03:09:56,642 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:09:56,643 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:09:56,643 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:09:56,643 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:09:56,643 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:53" (3/4) ... [2024-10-14 03:09:56,644 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 03:09:56,712 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:09:56,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:09:56,712 INFO L158 Benchmark]: Toolchain (without parser) took 3704.13ms. Allocated memory was 205.5MB in the beginning and 306.2MB in the end (delta: 100.7MB). Free memory was 132.2MB in the beginning and 199.8MB in the end (delta: -67.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2024-10-14 03:09:56,713 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 205.5MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:09:56,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.14ms. Allocated memory is still 205.5MB. Free memory was 131.9MB in the beginning and 111.9MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 03:09:56,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.71ms. Allocated memory is still 205.5MB. Free memory was 111.9MB in the beginning and 109.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:09:56,713 INFO L158 Benchmark]: Boogie Preprocessor took 119.80ms. Allocated memory is still 205.5MB. Free memory was 109.8MB in the beginning and 173.8MB in the end (delta: -64.0MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-10-14 03:09:56,714 INFO L158 Benchmark]: RCFGBuilder took 406.88ms. Allocated memory is still 205.5MB. Free memory was 173.8MB in the beginning and 151.7MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 03:09:56,714 INFO L158 Benchmark]: TraceAbstraction took 2658.39ms. Allocated memory was 205.5MB in the beginning and 306.2MB in the end (delta: 100.7MB). Free memory was 150.7MB in the beginning and 206.1MB in the end (delta: -55.4MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2024-10-14 03:09:56,714 INFO L158 Benchmark]: Witness Printer took 69.20ms. Allocated memory is still 306.2MB. Free memory was 206.1MB in the beginning and 199.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 03:09:56,719 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.14ms. Allocated memory is still 205.5MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.14ms. Allocated memory is still 205.5MB. Free memory was 131.9MB in the beginning and 111.9MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.71ms. Allocated memory is still 205.5MB. Free memory was 111.9MB in the beginning and 109.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.80ms. Allocated memory is still 205.5MB. Free memory was 109.8MB in the beginning and 173.8MB in the end (delta: -64.0MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * RCFGBuilder took 406.88ms. Allocated memory is still 205.5MB. Free memory was 173.8MB in the beginning and 151.7MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2658.39ms. Allocated memory was 205.5MB in the beginning and 306.2MB in the end (delta: 100.7MB). Free memory was 150.7MB in the beginning and 206.1MB in the end (delta: -55.4MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * Witness Printer took 69.20ms. Allocated memory is still 306.2MB. Free memory was 206.1MB in the beginning and 199.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [49] - GenericResultAtLocation [Line: 78]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [78] - GenericResultAtLocation [Line: 182]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [182] - GenericResultAtLocation [Line: 217]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [217] - GenericResultAtLocation [Line: 285]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [285] - GenericResultAtLocation [Line: 451]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [451] - GenericResultAtLocation [Line: 545]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [545] - GenericResultAtLocation [Line: 554]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [554] * 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: 550]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L79] int cleanupTimeShifts = 4; [L292] int pumpRunning = 0; [L293] int systemActive = 1; [L452] int waterLevel = 1; [L453] int methaneLevelCritical = 0; [L724] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L160] int retValue_acc ; [L161] int tmp ; [L165] FCALL select_helpers() [L166] FCALL select_features() [L167] CALL, EXPR valid_product() [L209] int retValue_acc ; [L212] retValue_acc = 1 [L213] return (retValue_acc); [L167] RET, EXPR valid_product() [L167] tmp = valid_product() [L169] COND TRUE \read(tmp) [L171] FCALL setup() [L172] CALL runTest() [L151] CALL test() [L220] int splverifierCounter ; [L221] int tmp ; [L222] int tmp___0 ; [L223] int tmp___1 ; [L224] int tmp___2 ; [L227] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L229] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L231] COND TRUE splverifierCounter < 4 [L237] tmp = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L241] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L470] COND TRUE waterLevel < 2 [L471] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L241] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L247] tmp___0 = __VERIFIER_nondet_int() [L249] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L257] tmp___2 = __VERIFIER_nondet_int() [L259] COND TRUE \read(tmp___2) [L261] CALL startSystem() [L447] systemActive = 1 [L261] RET startSystem() [L274] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L299] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L306] COND TRUE \read(systemActive) [L308] CALL processEnvironment() [L328] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L331] COND TRUE ! pumpRunning [L333] CALL, EXPR isHighWaterLevel() [L425] int retValue_acc ; [L426] int tmp ; [L427] int tmp___0 ; [L431] CALL, EXPR isHighWaterSensorDry() [L532] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L535] COND FALSE !(waterLevel < 2) [L539] retValue_acc = 0 [L540] 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] [L431] RET, EXPR isHighWaterSensorDry() [L431] tmp = isHighWaterSensorDry() [L433] COND FALSE !(\read(tmp)) [L436] 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] [L438] retValue_acc = tmp___0 [L439] return (retValue_acc); [L333] RET, EXPR isHighWaterLevel() [L333] tmp = isHighWaterLevel() [L335] COND TRUE \read(tmp) [L337] CALL activatePump() [L356] pumpRunning = 1 [L337] RET activatePump() [L308] RET processEnvironment() [L314] CALL __utac_acc__Specification4_spec__1() [L54] int tmp ; [L55] int tmp___0 ; [L59] CALL, EXPR getWaterLevel() [L523] int retValue_acc ; [L526] retValue_acc = waterLevel [L527] return (retValue_acc); [L59] RET, EXPR getWaterLevel() [L59] tmp = getWaterLevel() [L61] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L314] RET __utac_acc__Specification4_spec__1() [L274] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L229] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L231] COND TRUE splverifierCounter < 4 [L237] tmp = __VERIFIER_nondet_int() [L239] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L247] tmp___0 = __VERIFIER_nondet_int() [L249] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L257] tmp___2 = __VERIFIER_nondet_int() [L259] COND TRUE \read(tmp___2) [L261] CALL startSystem() [L447] systemActive = 1 [L261] RET startSystem() [L274] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L299] COND TRUE \read(pumpRunning) [L301] CALL lowerWaterLevel() [L458] COND TRUE waterLevel > 0 [L459] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L301] RET lowerWaterLevel() [L306] COND TRUE \read(systemActive) [L308] CALL processEnvironment() [L328] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L331] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L346] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L308] RET processEnvironment() [L314] CALL __utac_acc__Specification4_spec__1() [L54] int tmp ; [L55] int tmp___0 ; [L59] CALL, EXPR getWaterLevel() [L523] int retValue_acc ; [L526] retValue_acc = waterLevel [L527] return (retValue_acc); [L59] RET, EXPR getWaterLevel() [L59] tmp = getWaterLevel() [L61] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L314] RET __utac_acc__Specification4_spec__1() [L274] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L229] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L231] COND TRUE splverifierCounter < 4 [L237] tmp = __VERIFIER_nondet_int() [L239] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L247] tmp___0 = __VERIFIER_nondet_int() [L249] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L257] tmp___2 = __VERIFIER_nondet_int() [L259] COND TRUE \read(tmp___2) [L261] CALL startSystem() [L447] systemActive = 1 [L261] RET startSystem() [L274] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L299] COND TRUE \read(pumpRunning) [L301] CALL lowerWaterLevel() [L458] COND TRUE waterLevel > 0 [L459] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L301] RET lowerWaterLevel() [L306] COND TRUE \read(systemActive) [L308] CALL processEnvironment() [L328] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L331] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L346] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L308] RET processEnvironment() [L314] CALL __utac_acc__Specification4_spec__1() [L54] int tmp ; [L55] int tmp___0 ; [L59] CALL, EXPR getWaterLevel() [L523] int retValue_acc ; [L526] retValue_acc = waterLevel [L527] return (retValue_acc); [L59] RET, EXPR getWaterLevel() [L59] tmp = getWaterLevel() [L61] COND TRUE tmp == 0 [L63] CALL, EXPR isPumpRunning() [L380] int retValue_acc ; [L383] retValue_acc = pumpRunning [L384] return (retValue_acc); [L63] RET, EXPR isPumpRunning() [L63] tmp___0 = isPumpRunning() [L65] COND TRUE \read(tmp___0) [L67] CALL __automaton_fail() [L550] 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: 2.5s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 455 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 442 mSDsluCounter, 1100 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 632 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 509 IncrementalHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 468 mSDtfsCounter, 509 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 125 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=317occurred in iteration=10, InterpolantAutomatonStates: 47, 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, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 349 NumberOfCodeBlocks, 349 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 587 SizeOfPredicates, 2 NumberOfNonLiveVariables, 205 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:56,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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