./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_product55.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_product55.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 1741a5d4e19b6faba6ff51056891b76c8b4c0acd4f550f71706571820842dcfa --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:42:05,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:42:05,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:42:05,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:42:05,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:42:05,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:42:05,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:42:05,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:42:05,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:42:05,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:42:05,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:42:05,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:42:05,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:42:05,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:42:05,869 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:42:05,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:42:05,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:42:05,870 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:42:05,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:42:05,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:42:05,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:42:05,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:42:05,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:42:05,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:42:05,876 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:42:05,876 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:42:05,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:42:05,876 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:42:05,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:42:05,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:42:05,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:42:05,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:42:05,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:42:05,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:42:05,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:42:05,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:42:05,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:42:05,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:42:05,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:42:05,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:42:05,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:42:05,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:42:05,881 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 -> 1741a5d4e19b6faba6ff51056891b76c8b4c0acd4f550f71706571820842dcfa [2024-10-12 19:42:06,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:42:06,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:42:06,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:42:06,175 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:42:06,176 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:42:06,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product55.cil.c [2024-10-12 19:42:07,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:42:07,931 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:42:07,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product55.cil.c [2024-10-12 19:42:07,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00938fa2f/b40d95d135334ae99022d500401465fc/FLAGf34ec0332 [2024-10-12 19:42:08,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00938fa2f/b40d95d135334ae99022d500401465fc [2024-10-12 19:42:08,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:42:08,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:42:08,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:42:08,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:42:08,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:42:08,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:42:08" (1/1) ... [2024-10-12 19:42:08,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35fe65c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:08, skipping insertion in model container [2024-10-12 19:42:08,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:42:08" (1/1) ... [2024-10-12 19:42:08,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:42:08,564 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_product55.cil.c[6887,6900] [2024-10-12 19:42:08,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:42:08,737 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:42:08,769 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2024-10-12 19:42:08,774 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] [2024-10-12 19:42:08,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [369] [2024-10-12 19:42:08,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [397] [2024-10-12 19:42:08,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [435] [2024-10-12 19:42:08,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [444] [2024-10-12 19:42:08,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [540] [2024-10-12 19:42:08,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [906] [2024-10-12 19:42:08,798 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_product55.cil.c[6887,6900] [2024-10-12 19:42:08,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:42:08,858 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:42:08,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:08 WrapperNode [2024-10-12 19:42:08,858 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:42:08,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:42:08,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:42:08,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:42:08,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:08" (1/1) ... [2024-10-12 19:42:08,879 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:08" (1/1) ... [2024-10-12 19:42:08,904 INFO L138 Inliner]: procedures = 57, calls = 104, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 233 [2024-10-12 19:42:08,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:42:08,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:42:08,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:42:08,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:42:08,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:08" (1/1) ... [2024-10-12 19:42:08,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:08" (1/1) ... [2024-10-12 19:42:08,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:08" (1/1) ... [2024-10-12 19:42:08,942 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-12 19:42:08,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:08" (1/1) ... [2024-10-12 19:42:08,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:08" (1/1) ... [2024-10-12 19:42:08,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:08" (1/1) ... [2024-10-12 19:42:08,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:08" (1/1) ... [2024-10-12 19:42:08,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:08" (1/1) ... [2024-10-12 19:42:08,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:08" (1/1) ... [2024-10-12 19:42:08,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:42:08,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:42:08,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:42:08,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:42:08,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:08" (1/1) ... [2024-10-12 19:42:08,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:42:08,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:42:08,997 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-12 19:42:09,000 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-12 19:42:09,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:42:09,049 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-12 19:42:09,049 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-12 19:42:09,049 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:42:09,049 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:42:09,049 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:42:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:42:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:42:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:42:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-12 19:42:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-12 19:42:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__lowWaterSensor [2024-10-12 19:42:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__lowWaterSensor [2024-10-12 19:42:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-10-12 19:42:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-10-12 19:42:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:42:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-12 19:42:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-12 19:42:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:42:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:42:09,123 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:42:09,125 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:42:09,411 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-10-12 19:42:09,411 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:42:09,475 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:42:09,475 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 19:42:09,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:42:09 BoogieIcfgContainer [2024-10-12 19:42:09,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:42:09,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:42:09,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:42:09,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:42:09,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:42:08" (1/3) ... [2024-10-12 19:42:09,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1150d9f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:42:09, skipping insertion in model container [2024-10-12 19:42:09,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:08" (2/3) ... [2024-10-12 19:42:09,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1150d9f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:42:09, skipping insertion in model container [2024-10-12 19:42:09,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:42:09" (3/3) ... [2024-10-12 19:42:09,488 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product55.cil.c [2024-10-12 19:42:09,503 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:42:09,503 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:42:09,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:42:09,566 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;@52393407, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:42:09,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:42:09,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 63 states have internal predecessors, (81), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-12 19:42:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 19:42:09,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:09,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:09,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:09,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:09,586 INFO L85 PathProgramCache]: Analyzing trace with hash -218628342, now seen corresponding path program 1 times [2024-10-12 19:42:09,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:09,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397275157] [2024-10-12 19:42:09,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:09,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:09,759 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-12 19:42:09,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:09,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397275157] [2024-10-12 19:42:09,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397275157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:09,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:09,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:42:09,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503808810] [2024-10-12 19:42:09,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:09,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:42:09,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:09,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:42:09,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:42:09,793 INFO L87 Difference]: Start difference. First operand has 77 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 63 states have internal predecessors, (81), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) 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-12 19:42:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:09,868 INFO L93 Difference]: Finished difference Result 152 states and 223 transitions. [2024-10-12 19:42:09,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:42:09,871 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-12 19:42:09,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:09,881 INFO L225 Difference]: With dead ends: 152 [2024-10-12 19:42:09,882 INFO L226 Difference]: Without dead ends: 72 [2024-10-12 19:42:09,886 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-12 19:42:09,889 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:09,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:42:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-12 19:42:09,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-12 19:42:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 59 states have internal predecessors, (71), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-12 19:42:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2024-10-12 19:42:09,926 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 12 [2024-10-12 19:42:09,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:09,926 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2024-10-12 19:42:09,927 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-12 19:42:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2024-10-12 19:42:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 19:42:09,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:09,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:09,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:42:09,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:09,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:09,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1795693916, now seen corresponding path program 1 times [2024-10-12 19:42:09,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:09,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103092654] [2024-10-12 19:42:09,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:09,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:10,027 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-12 19:42:10,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:10,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103092654] [2024-10-12 19:42:10,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103092654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:10,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:10,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:42:10,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395793447] [2024-10-12 19:42:10,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:10,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:42:10,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:10,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:42:10,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:42:10,033 INFO L87 Difference]: Start difference. First operand 72 states and 100 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-12 19:42:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:10,078 INFO L93 Difference]: Finished difference Result 114 states and 158 transitions. [2024-10-12 19:42:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:42:10,079 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-12 19:42:10,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:10,080 INFO L225 Difference]: With dead ends: 114 [2024-10-12 19:42:10,080 INFO L226 Difference]: Without dead ends: 64 [2024-10-12 19:42:10,081 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-12 19:42:10,082 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:10,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 135 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:42:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-12 19:42:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-12 19:42:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 54 states have internal predecessors, (65), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 7 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-12 19:42:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2024-10-12 19:42:10,095 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 13 [2024-10-12 19:42:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:10,096 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2024-10-12 19:42:10,096 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-12 19:42:10,096 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2024-10-12 19:42:10,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 19:42:10,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:10,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:10,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:42:10,099 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:10,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:10,100 INFO L85 PathProgramCache]: Analyzing trace with hash 629348810, now seen corresponding path program 1 times [2024-10-12 19:42:10,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:10,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314371468] [2024-10-12 19:42:10,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:10,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:10,211 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-12 19:42:10,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:10,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314371468] [2024-10-12 19:42:10,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314371468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:10,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:10,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:42:10,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032816816] [2024-10-12 19:42:10,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:10,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:42:10,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:10,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:42:10,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:42:10,217 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:42:10,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:10,290 INFO L93 Difference]: Finished difference Result 188 states and 264 transitions. [2024-10-12 19:42:10,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:42:10,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-12 19:42:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:10,293 INFO L225 Difference]: With dead ends: 188 [2024-10-12 19:42:10,295 INFO L226 Difference]: Without dead ends: 126 [2024-10-12 19:42:10,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:42:10,297 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 76 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:10,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 156 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:42:10,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-12 19:42:10,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2024-10-12 19:42:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 103 states have internal predecessors, (125), 24 states have call successors, (24), 14 states have call predecessors, (24), 14 states have return successors, (24), 13 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 19:42:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 173 transitions. [2024-10-12 19:42:10,326 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 173 transitions. Word has length 16 [2024-10-12 19:42:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:10,327 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 173 transitions. [2024-10-12 19:42:10,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:42:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 173 transitions. [2024-10-12 19:42:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 19:42:10,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:10,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:10,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:42:10,329 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:10,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:10,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1467089361, now seen corresponding path program 1 times [2024-10-12 19:42:10,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:10,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524603795] [2024-10-12 19:42:10,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:10,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:10,489 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-12 19:42:10,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:10,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524603795] [2024-10-12 19:42:10,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524603795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:10,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:10,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:42:10,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745194450] [2024-10-12 19:42:10,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:10,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:42:10,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:10,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:42:10,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:42:10,492 INFO L87 Difference]: Start difference. First operand 123 states and 173 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-12 19:42:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:10,613 INFO L93 Difference]: Finished difference Result 355 states and 520 transitions. [2024-10-12 19:42:10,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:42:10,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 19 [2024-10-12 19:42:10,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:10,617 INFO L225 Difference]: With dead ends: 355 [2024-10-12 19:42:10,617 INFO L226 Difference]: Without dead ends: 234 [2024-10-12 19:42:10,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12 19:42:10,623 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 62 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:10,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 214 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:42:10,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-12 19:42:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-10-12 19:42:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 159 states have (on average 1.4528301886792452) internal successors, (231), 194 states have internal predecessors, (231), 48 states have call successors, (48), 28 states have call predecessors, (48), 26 states have return successors, (50), 24 states have call predecessors, (50), 48 states have call successors, (50) [2024-10-12 19:42:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 329 transitions. [2024-10-12 19:42:10,656 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 329 transitions. Word has length 19 [2024-10-12 19:42:10,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:10,657 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 329 transitions. [2024-10-12 19:42:10,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-12 19:42:10,657 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 329 transitions. [2024-10-12 19:42:10,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 19:42:10,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:10,660 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-12 19:42:10,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:42:10,660 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:10,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:10,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2062490858, now seen corresponding path program 1 times [2024-10-12 19:42:10,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:10,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042454533] [2024-10-12 19:42:10,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:10,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:10,736 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-12 19:42:10,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:10,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042454533] [2024-10-12 19:42:10,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042454533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:10,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:10,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:42:10,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80921656] [2024-10-12 19:42:10,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:10,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:42:10,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:10,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:42:10,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:42:10,738 INFO L87 Difference]: Start difference. First operand 234 states and 329 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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-12 19:42:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:10,810 INFO L93 Difference]: Finished difference Result 576 states and 826 transitions. [2024-10-12 19:42:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:42:10,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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 21 [2024-10-12 19:42:10,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:10,814 INFO L225 Difference]: With dead ends: 576 [2024-10-12 19:42:10,814 INFO L226 Difference]: Without dead ends: 344 [2024-10-12 19:42:10,819 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-12 19:42:10,821 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 53 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:10,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 133 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:42:10,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-12 19:42:10,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 336. [2024-10-12 19:42:10,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 241 states have (on average 1.3568464730290457) internal successors, (327), 263 states have internal predecessors, (327), 49 states have call successors, (49), 45 states have call predecessors, (49), 45 states have return successors, (73), 44 states have call predecessors, (73), 49 states have call successors, (73) [2024-10-12 19:42:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 449 transitions. [2024-10-12 19:42:10,889 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 449 transitions. Word has length 21 [2024-10-12 19:42:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:10,889 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 449 transitions. [2024-10-12 19:42:10,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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-12 19:42:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 449 transitions. [2024-10-12 19:42:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 19:42:10,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:10,894 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-12 19:42:10,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:42:10,895 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:10,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:10,895 INFO L85 PathProgramCache]: Analyzing trace with hash 794555243, now seen corresponding path program 1 times [2024-10-12 19:42:10,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:10,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55606584] [2024-10-12 19:42:10,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:10,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:10,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:10,989 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-12 19:42:10,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:10,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55606584] [2024-10-12 19:42:10,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55606584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:10,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:10,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:42:10,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314702509] [2024-10-12 19:42:10,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:10,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:42:10,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:10,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:42:10,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:42:10,999 INFO L87 Difference]: Start difference. First operand 336 states and 449 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-12 19:42:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:11,270 INFO L93 Difference]: Finished difference Result 386 states and 520 transitions. [2024-10-12 19:42:11,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:42:11,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 23 [2024-10-12 19:42:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:11,274 INFO L225 Difference]: With dead ends: 386 [2024-10-12 19:42:11,277 INFO L226 Difference]: Without dead ends: 384 [2024-10-12 19:42:11,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:42:11,279 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 108 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:11,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 148 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:42:11,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-12 19:42:11,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382. [2024-10-12 19:42:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 273 states have (on average 1.347985347985348) internal successors, (368), 305 states have internal predecessors, (368), 55 states have call successors, (55), 45 states have call predecessors, (55), 53 states have return successors, (91), 48 states have call predecessors, (91), 55 states have call successors, (91) [2024-10-12 19:42:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 514 transitions. [2024-10-12 19:42:11,327 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 514 transitions. Word has length 23 [2024-10-12 19:42:11,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:11,327 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 514 transitions. [2024-10-12 19:42:11,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-12 19:42:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 514 transitions. [2024-10-12 19:42:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 19:42:11,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:11,331 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:11,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:42:11,331 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:11,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:11,332 INFO L85 PathProgramCache]: Analyzing trace with hash -430120813, now seen corresponding path program 1 times [2024-10-12 19:42:11,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:11,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513471428] [2024-10-12 19:42:11,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:11,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:11,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:11,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:42:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:11,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:42:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:11,444 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-12 19:42:11,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:11,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513471428] [2024-10-12 19:42:11,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513471428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:11,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:11,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:42:11,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141866263] [2024-10-12 19:42:11,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:11,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:42:11,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:11,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:42:11,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:42:11,448 INFO L87 Difference]: Start difference. First operand 382 states and 514 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 19:42:11,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:11,731 INFO L93 Difference]: Finished difference Result 836 states and 1149 transitions. [2024-10-12 19:42:11,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:42:11,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-10-12 19:42:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:11,737 INFO L225 Difference]: With dead ends: 836 [2024-10-12 19:42:11,737 INFO L226 Difference]: Without dead ends: 456 [2024-10-12 19:42:11,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:42:11,740 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 110 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:11,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 167 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:42:11,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-12 19:42:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 426. [2024-10-12 19:42:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 307 states have (on average 1.3289902280130292) internal successors, (408), 339 states have internal predecessors, (408), 55 states have call successors, (55), 45 states have call predecessors, (55), 63 states have return successors, (105), 56 states have call predecessors, (105), 55 states have call successors, (105) [2024-10-12 19:42:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 568 transitions. [2024-10-12 19:42:11,779 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 568 transitions. Word has length 37 [2024-10-12 19:42:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:11,779 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 568 transitions. [2024-10-12 19:42:11,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 19:42:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 568 transitions. [2024-10-12 19:42:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 19:42:11,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:11,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:11,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:42:11,783 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:11,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:11,783 INFO L85 PathProgramCache]: Analyzing trace with hash -171955375, now seen corresponding path program 1 times [2024-10-12 19:42:11,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:11,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187680563] [2024-10-12 19:42:11,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:11,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:11,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:11,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:42:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:11,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:42:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:11,921 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-12 19:42:11,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:11,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187680563] [2024-10-12 19:42:11,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187680563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:11,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:11,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:42:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31923595] [2024-10-12 19:42:11,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:11,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:42:11,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:11,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:42:11,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:42:11,924 INFO L87 Difference]: Start difference. First operand 426 states and 568 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:42:12,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:12,416 INFO L93 Difference]: Finished difference Result 836 states and 1144 transitions. [2024-10-12 19:42:12,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 19:42:12,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-10-12 19:42:12,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:12,420 INFO L225 Difference]: With dead ends: 836 [2024-10-12 19:42:12,420 INFO L226 Difference]: Without dead ends: 412 [2024-10-12 19:42:12,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:42:12,422 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 286 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:12,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 220 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 19:42:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-12 19:42:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 340. [2024-10-12 19:42:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 245 states have (on average 1.3183673469387756) internal successors, (323), 270 states have internal predecessors, (323), 46 states have call successors, (46), 38 states have call predecessors, (46), 48 states have return successors, (78), 43 states have call predecessors, (78), 46 states have call successors, (78) [2024-10-12 19:42:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 447 transitions. [2024-10-12 19:42:12,459 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 447 transitions. Word has length 37 [2024-10-12 19:42:12,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:12,460 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 447 transitions. [2024-10-12 19:42:12,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:42:12,460 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 447 transitions. [2024-10-12 19:42:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 19:42:12,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:12,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:12,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:42:12,462 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:12,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:12,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1183072625, now seen corresponding path program 1 times [2024-10-12 19:42:12,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:12,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663909487] [2024-10-12 19:42:12,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:12,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:12,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:12,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:42:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:12,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:42:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:12,550 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-12 19:42:12,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:12,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663909487] [2024-10-12 19:42:12,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663909487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:12,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:12,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:42:12,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924959254] [2024-10-12 19:42:12,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:12,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:42:12,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:12,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:42:12,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:42:12,553 INFO L87 Difference]: Start difference. First operand 340 states and 447 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 19:42:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:12,994 INFO L93 Difference]: Finished difference Result 778 states and 1097 transitions. [2024-10-12 19:42:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 19:42:12,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-10-12 19:42:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:12,999 INFO L225 Difference]: With dead ends: 778 [2024-10-12 19:42:12,999 INFO L226 Difference]: Without dead ends: 524 [2024-10-12 19:42:13,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:42:13,002 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 162 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:13,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 223 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:42:13,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-10-12 19:42:13,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 506. [2024-10-12 19:42:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 367 states have (on average 1.2833787465940054) internal successors, (471), 399 states have internal predecessors, (471), 67 states have call successors, (67), 57 states have call predecessors, (67), 71 states have return successors, (141), 70 states have call predecessors, (141), 67 states have call successors, (141) [2024-10-12 19:42:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 679 transitions. [2024-10-12 19:42:13,045 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 679 transitions. Word has length 37 [2024-10-12 19:42:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:13,045 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 679 transitions. [2024-10-12 19:42:13,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 19:42:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 679 transitions. [2024-10-12 19:42:13,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 19:42:13,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:13,049 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:13,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:42:13,049 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:13,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash -265884366, now seen corresponding path program 1 times [2024-10-12 19:42:13,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:13,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107920044] [2024-10-12 19:42:13,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:13,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:42:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:42:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:42:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:42:13,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:13,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107920044] [2024-10-12 19:42:13,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107920044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:13,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:13,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:42:13,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650017519] [2024-10-12 19:42:13,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:13,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:42:13,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:13,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:42:13,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:42:13,143 INFO L87 Difference]: Start difference. First operand 506 states and 679 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 19:42:13,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:13,461 INFO L93 Difference]: Finished difference Result 600 states and 802 transitions. [2024-10-12 19:42:13,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:42:13,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 56 [2024-10-12 19:42:13,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:13,464 INFO L225 Difference]: With dead ends: 600 [2024-10-12 19:42:13,464 INFO L226 Difference]: Without dead ends: 256 [2024-10-12 19:42:13,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:42:13,466 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 225 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:13,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 171 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:42:13,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-12 19:42:13,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 248. [2024-10-12 19:42:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 180 states have (on average 1.238888888888889) internal successors, (223), 195 states have internal predecessors, (223), 32 states have call successors, (32), 28 states have call predecessors, (32), 35 states have return successors, (69), 34 states have call predecessors, (69), 32 states have call successors, (69) [2024-10-12 19:42:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 324 transitions. [2024-10-12 19:42:13,488 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 324 transitions. Word has length 56 [2024-10-12 19:42:13,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:13,488 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 324 transitions. [2024-10-12 19:42:13,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 19:42:13,489 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 324 transitions. [2024-10-12 19:42:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 19:42:13,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:13,491 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:13,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:42:13,491 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:13,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:13,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1873743989, now seen corresponding path program 1 times [2024-10-12 19:42:13,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:13,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077222515] [2024-10-12 19:42:13,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:13,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:42:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:42:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:42:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:42:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:42:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:42:13,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:13,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077222515] [2024-10-12 19:42:13,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077222515] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:42:13,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157982153] [2024-10-12 19:42:13,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:13,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:42:13,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:42:13,703 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-12 19:42:13,704 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-12 19:42:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 19:42:13,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:42:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:42:13,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:42:14,057 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:42:14,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157982153] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:42:14,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:42:14,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 8 [2024-10-12 19:42:14,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956943965] [2024-10-12 19:42:14,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:42:14,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:42:14,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:14,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:42:14,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:42:14,060 INFO L87 Difference]: Start difference. First operand 248 states and 324 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 19:42:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:14,657 INFO L93 Difference]: Finished difference Result 597 states and 831 transitions. [2024-10-12 19:42:14,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 19:42:14,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2024-10-12 19:42:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:14,663 INFO L225 Difference]: With dead ends: 597 [2024-10-12 19:42:14,663 INFO L226 Difference]: Without dead ends: 392 [2024-10-12 19:42:14,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 158 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:42:14,665 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 259 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:14,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 228 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 19:42:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-12 19:42:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 347. [2024-10-12 19:42:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 249 states have (on average 1.2449799196787148) internal successors, (310), 271 states have internal predecessors, (310), 47 states have call successors, (47), 41 states have call predecessors, (47), 50 states have return successors, (107), 46 states have call predecessors, (107), 47 states have call successors, (107) [2024-10-12 19:42:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 464 transitions. [2024-10-12 19:42:14,701 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 464 transitions. Word has length 72 [2024-10-12 19:42:14,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:14,702 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 464 transitions. [2024-10-12 19:42:14,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 19:42:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 464 transitions. [2024-10-12 19:42:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 19:42:14,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:14,705 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:14,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 19:42:14,906 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,SelfDestructingSolverStorable10 [2024-10-12 19:42:14,906 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:14,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:14,907 INFO L85 PathProgramCache]: Analyzing trace with hash 707345679, now seen corresponding path program 2 times [2024-10-12 19:42:14,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:14,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994115325] [2024-10-12 19:42:14,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:14,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:42:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:42:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:42:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:42:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:42:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:42:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:42:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:42:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 42 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 19:42:15,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:15,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994115325] [2024-10-12 19:42:15,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994115325] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:42:15,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331833031] [2024-10-12 19:42:15,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 19:42:15,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:42:15,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:42:15,217 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:42:15,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 19:42:15,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 19:42:15,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:42:15,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 19:42:15,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:42:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 19:42:15,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:42:15,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331833031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:15,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:42:15,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-10-12 19:42:15,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439742373] [2024-10-12 19:42:15,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:15,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:42:15,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:15,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:42:15,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:42:15,432 INFO L87 Difference]: Start difference. First operand 347 states and 464 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 19:42:15,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:15,662 INFO L93 Difference]: Finished difference Result 928 states and 1311 transitions. [2024-10-12 19:42:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:42:15,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 107 [2024-10-12 19:42:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:15,666 INFO L225 Difference]: With dead ends: 928 [2024-10-12 19:42:15,667 INFO L226 Difference]: Without dead ends: 623 [2024-10-12 19:42:15,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:42:15,669 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 115 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:15,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 374 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:42:15,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-10-12 19:42:15,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 602. [2024-10-12 19:42:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 433 states have (on average 1.2378752886836029) internal successors, (536), 463 states have internal predecessors, (536), 80 states have call successors, (80), 74 states have call predecessors, (80), 88 states have return successors, (169), 81 states have call predecessors, (169), 80 states have call successors, (169) [2024-10-12 19:42:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 785 transitions. [2024-10-12 19:42:15,716 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 785 transitions. Word has length 107 [2024-10-12 19:42:15,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:15,717 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 785 transitions. [2024-10-12 19:42:15,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-12 19:42:15,717 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 785 transitions. [2024-10-12 19:42:15,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 19:42:15,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:15,720 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:15,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 19:42:15,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-12 19:42:15,924 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:15,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:15,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1151246353, now seen corresponding path program 1 times [2024-10-12 19:42:15,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:15,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564026963] [2024-10-12 19:42:15,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:15,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:42:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:42:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:42:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:42:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-12 19:42:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:42:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:42:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:42:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,085 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 36 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:42:16,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:16,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564026963] [2024-10-12 19:42:16,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564026963] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:42:16,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847584135] [2024-10-12 19:42:16,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:16,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:42:16,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:42:16,087 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:42:16,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 19:42:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 19:42:16,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:42:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 19:42:16,199 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:42:16,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847584135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:16,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:42:16,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2024-10-12 19:42:16,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190495575] [2024-10-12 19:42:16,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:16,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:42:16,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:16,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:42:16,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:42:16,203 INFO L87 Difference]: Start difference. First operand 602 states and 785 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-12 19:42:16,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:16,255 INFO L93 Difference]: Finished difference Result 825 states and 1064 transitions. [2024-10-12 19:42:16,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:42:16,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 107 [2024-10-12 19:42:16,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:16,258 INFO L225 Difference]: With dead ends: 825 [2024-10-12 19:42:16,258 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 19:42:16,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:42:16,261 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:16,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:42:16,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 19:42:16,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 19:42:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:42:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 19:42:16,264 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2024-10-12 19:42:16,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:16,264 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 19:42:16,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-12 19:42:16,265 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 19:42:16,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 19:42:16,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:42:16,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 19:42:16,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:42:16,470 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:16,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 19:42:18,260 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:42:18,274 WARN L155 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (or (and (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0))) (= 1 ~systemActive~0))) Eliminated clause: (or (and (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0))) (= 1 ~systemActive~0)) [2024-10-12 19:42:18,284 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= |old(~pumpRunning~0)| 0))) (or (and .cse0 (<= 2 |old(~waterLevel~0)|)) (and .cse1 (= 0 ~systemActive~0)) (and .cse0 .cse1 (<= 1 |old(~waterLevel~0)|)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse1 (= 1 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0))) (or (and .cse0 .cse1 (<= 1 ~waterLevel~0)) (and (<= 2 ~waterLevel~0) .cse1) (and .cse0 (= 0 ~systemActive~0)))) [2024-10-12 19:42:18,289 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 0) (= 1 ~systemActive~0) (= |old(~pumpRunning~0)| 0) (<= 1 ~waterLevel~0)) Eliminated clause: (and (= ~pumpRunning~0 0) (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)) [2024-10-12 19:42:18,292 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0))) (or (and .cse0 (<= 2 |old(~waterLevel~0)|)) (and .cse1 .cse0 (<= 1 |old(~waterLevel~0)|)) (and .cse1 (= 0 ~systemActive~0)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse1 (= 1 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0))) (or (and .cse0 .cse1 (<= 1 ~waterLevel~0)) (and (<= 2 ~waterLevel~0) .cse1) (and .cse0 (= 0 ~systemActive~0)))) [2024-10-12 19:42:18,295 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__lowWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)) Eliminated clause: (and (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)) [2024-10-12 19:42:18,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:42:18 BoogieIcfgContainer [2024-10-12 19:42:18,297 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:42:18,298 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:42:18,298 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:42:18,298 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:42:18,298 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:42:09" (3/4) ... [2024-10-12 19:42:18,300 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 19:42:18,303 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-10-12 19:42:18,303 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-12 19:42:18,304 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-12 19:42:18,304 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-12 19:42:18,304 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-12 19:42:18,304 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:42:18,304 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-12 19:42:18,304 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__lowWaterSensor [2024-10-12 19:42:18,310 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2024-10-12 19:42:18,311 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-12 19:42:18,311 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-12 19:42:18,311 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:42:18,312 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:42:18,419 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:42:18,420 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 19:42:18,420 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:42:18,420 INFO L158 Benchmark]: Toolchain (without parser) took 10163.03ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 107.4MB in the beginning and 213.8MB in the end (delta: -106.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:42:18,421 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 67.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:42:18,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 599.44ms. Allocated memory is still 176.2MB. Free memory was 107.2MB in the beginning and 142.6MB in the end (delta: -35.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-10-12 19:42:18,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.82ms. Allocated memory is still 176.2MB. Free memory was 142.6MB in the beginning and 140.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:42:18,421 INFO L158 Benchmark]: Boogie Preprocessor took 57.34ms. Allocated memory is still 176.2MB. Free memory was 140.5MB in the beginning and 137.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:42:18,422 INFO L158 Benchmark]: RCFGBuilder took 512.87ms. Allocated memory is still 176.2MB. Free memory was 137.7MB in the beginning and 112.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 19:42:18,422 INFO L158 Benchmark]: TraceAbstraction took 8819.26ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 111.8MB in the beginning and 222.2MB in the end (delta: -110.3MB). Peak memory consumption was 126.8MB. Max. memory is 16.1GB. [2024-10-12 19:42:18,422 INFO L158 Benchmark]: Witness Printer took 122.22ms. Allocated memory is still 272.6MB. Free memory was 221.1MB in the beginning and 213.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 19:42:18,423 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 67.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 599.44ms. Allocated memory is still 176.2MB. Free memory was 107.2MB in the beginning and 142.6MB in the end (delta: -35.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.82ms. Allocated memory is still 176.2MB. Free memory was 142.6MB in the beginning and 140.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.34ms. Allocated memory is still 176.2MB. Free memory was 140.5MB in the beginning and 137.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 512.87ms. Allocated memory is still 176.2MB. Free memory was 137.7MB in the beginning and 112.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8819.26ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 111.8MB in the beginning and 222.2MB in the end (delta: -110.3MB). Peak memory consumption was 126.8MB. Max. memory is 16.1GB. * Witness Printer took 122.22ms. Allocated memory is still 272.6MB. Free memory was 221.1MB in the beginning and 213.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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,"scenario.i","") [49] - GenericResultAtLocation [Line: 121]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] - GenericResultAtLocation [Line: 369]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [369] - GenericResultAtLocation [Line: 397]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [397] - GenericResultAtLocation [Line: 435]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [435] - GenericResultAtLocation [Line: 444]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [444] - GenericResultAtLocation [Line: 540]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [540] - GenericResultAtLocation [Line: 906]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [906] * 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 - PositiveResult [Line: 440]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1500 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1470 mSDsluCounter, 2452 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1549 mSDsCounter, 428 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2136 IncrementalHoareTripleChecker+Invalid, 2564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 428 mSolverCounterUnsat, 903 mSDtfsCounter, 2136 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 567 GetRequests, 464 SyntacticMatches, 12 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=602occurred in iteration=12, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 207 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 843 NumberOfCodeBlocks, 843 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 898 ConstructedInterpolants, 0 QuantifiedInterpolants, 1598 SizeOfPredicates, 3 NumberOfNonLiveVariables, 943 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 340/394 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((2 <= waterLevel) && (1 == systemActive)) && (splverifierCounter == 0)) || (((pumpRunning == 0) && (splverifierCounter == 0)) && (0 == systemActive))) || ((((pumpRunning == 0) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) - InvariantResult [Line: 64]: Location Invariant Derived location invariant: 0 - ProcedureContractResult [Line: 252]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: (((2 <= waterLevel) && (0 != systemActive)) || (1 == systemActive)) Ensures: ((pumpRunning == 0) && (((2 <= waterLevel) && (0 != systemActive)) || (1 == systemActive))) - ProcedureContractResult [Line: 159]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1)) || (((pumpRunning == 0) && (2 <= waterLevel)) && (1 == systemActive))) Ensures: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1)) || (((pumpRunning == 0) && (2 <= waterLevel)) && (1 == systemActive))) - ProcedureContractResult [Line: 933]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1)) || ((2 <= waterLevel) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) Ensures: (((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1)) || ((2 <= waterLevel) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) - ProcedureContractResult [Line: 446]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 135]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: (((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) Ensures: ((((((1 == systemActive) && (2 <= \old(waterLevel))) || (\old(pumpRunning) == 0)) && (((pumpRunning == 0) && (\old(waterLevel) == waterLevel)) || (0 != systemActive))) && (((1 < waterLevel) || ((pumpRunning == 0) && (waterLevel == 1))) || (0 == systemActive))) && (((\old(pumpRunning) != 0) || ((1 == systemActive) && (\old(waterLevel) == waterLevel))) || (0 == systemActive))) - ProcedureContractResult [Line: 167]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: (((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) Ensures: ((((1 == systemActive) && (\old(pumpRunning) == 0)) && (1 <= waterLevel)) && ((pumpRunning == 0) || (1 < waterLevel))) - ProcedureContractResult [Line: 921]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) Ensures: ((((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel)) && (((1 == systemActive) && (1 <= \old(waterLevel))) || ((pumpRunning == 0) && (0 == systemActive)))) && (((\old(waterLevel) != 1) || ((pumpRunning == 0) && (2 <= waterLevel))) || (0 == systemActive))) - ProcedureContractResult [Line: 193]: Procedure Contract for processEnvironment__wrappee__lowWaterSensor Derived contract for procedure processEnvironment__wrappee__lowWaterSensor. Requires: ((1 == systemActive) && (1 <= waterLevel)) Ensures: (((1 == systemActive) && (1 <= waterLevel)) && ((pumpRunning == 0) || (1 < waterLevel))) RESULT: Ultimate proved your program to be correct! [2024-10-12 19:42:18,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE