./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product60.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product60.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 a218bb67596641a4ce71d6987e627686ed630ab4299f0e9b54dfa98d78549c82 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:53:29,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:53:29,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:53:29,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:53:29,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:53:29,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:53:29,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:53:29,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:53:29,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:53:29,227 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:53:29,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:53:29,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:53:29,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:53:29,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:53:29,228 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:53:29,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:53:29,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:53:29,229 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:53:29,230 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:53:29,230 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:53:29,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:53:29,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:53:29,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:53:29,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:53:29,238 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:53:29,238 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:53:29,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:53:29,238 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:53:29,239 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:53:29,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:53:29,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:53:29,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:53:29,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:53:29,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:53:29,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:53:29,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:53:29,241 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:53:29,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:53:29,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:53:29,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:53:29,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:53:29,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:53:29,242 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 -> a218bb67596641a4ce71d6987e627686ed630ab4299f0e9b54dfa98d78549c82 [2024-11-11 20:53:29,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:53:29,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:53:29,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:53:29,453 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:53:29,454 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:53:29,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product60.cil.c [2024-11-11 20:53:30,715 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:53:30,880 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:53:30,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product60.cil.c [2024-11-11 20:53:30,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71dde8516/bd445d1e68e44b4c8c72746131518e23/FLAG3452a5d4c [2024-11-11 20:53:30,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71dde8516/bd445d1e68e44b4c8c72746131518e23 [2024-11-11 20:53:30,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:53:30,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:53:30,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:53:30,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:53:30,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:53:30,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:53:30" (1/1) ... [2024-11-11 20:53:30,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e29f379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:30, skipping insertion in model container [2024-11-11 20:53:30,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:53:30" (1/1) ... [2024-11-11 20:53:30,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:53:31,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product60.cil.c[3241,3254] [2024-11-11 20:53:31,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:53:31,241 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:53:31,248 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2024-11-11 20:53:31,249 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [160] [2024-11-11 20:53:31,249 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [169] [2024-11-11 20:53:31,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [273] [2024-11-11 20:53:31,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [308] [2024-11-11 20:53:31,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [379] [2024-11-11 20:53:31,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [745] [2024-11-11 20:53:31,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [987] [2024-11-11 20:53:31,262 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product60.cil.c[3241,3254] [2024-11-11 20:53:31,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:53:31,312 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:53:31,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:31 WrapperNode [2024-11-11 20:53:31,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:53:31,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:53:31,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:53:31,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:53:31,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:31" (1/1) ... [2024-11-11 20:53:31,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:31" (1/1) ... [2024-11-11 20:53:31,352 INFO L138 Inliner]: procedures = 59, calls = 104, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 229 [2024-11-11 20:53:31,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:53:31,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:53:31,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:53:31,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:53:31,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:31" (1/1) ... [2024-11-11 20:53:31,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:31" (1/1) ... [2024-11-11 20:53:31,365 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:31" (1/1) ... [2024-11-11 20:53:31,385 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 20:53:31,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:31" (1/1) ... [2024-11-11 20:53:31,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:31" (1/1) ... [2024-11-11 20:53:31,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:31" (1/1) ... [2024-11-11 20:53:31,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:31" (1/1) ... [2024-11-11 20:53:31,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:31" (1/1) ... [2024-11-11 20:53:31,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:31" (1/1) ... [2024-11-11 20:53:31,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:53:31,397 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:53:31,397 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:53:31,397 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:53:31,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:31" (1/1) ... [2024-11-11 20:53:31,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:53:31,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:31,425 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:53:31,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:53:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:53:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-11 20:53:31,463 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-11 20:53:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:53:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:53:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:53:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:53:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-11 20:53:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-11 20:53:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:53:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:53:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-11 20:53:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-11 20:53:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-11 20:53:31,465 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-11 20:53:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:53:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-11 20:53:31,465 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-11 20:53:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:53:31,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:53:31,529 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:53:31,530 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:53:31,732 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-11-11 20:53:31,732 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:53:31,746 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:53:31,746 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:53:31,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:53:31 BoogieIcfgContainer [2024-11-11 20:53:31,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:53:31,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:53:31,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:53:31,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:53:31,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:53:30" (1/3) ... [2024-11-11 20:53:31,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0073d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:53:31, skipping insertion in model container [2024-11-11 20:53:31,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:31" (2/3) ... [2024-11-11 20:53:31,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0073d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:53:31, skipping insertion in model container [2024-11-11 20:53:31,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:53:31" (3/3) ... [2024-11-11 20:53:31,752 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product60.cil.c [2024-11-11 20:53:31,763 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:53:31,763 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:53:31,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:53:31,807 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;@87c6351, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:53:31,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:53:31,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 86 states have internal predecessors, (106), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-11 20:53:31,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 20:53:31,816 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:31,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:31,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:31,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:31,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1691208954, now seen corresponding path program 1 times [2024-11-11 20:53:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:31,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811109988] [2024-11-11 20:53:31,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:31,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:31,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:53:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:31,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:31,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811109988] [2024-11-11 20:53:31,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811109988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:31,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:31,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:53:31,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353001787] [2024-11-11 20:53:31,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:31,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:53:31,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:32,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:53:32,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:53:32,024 INFO L87 Difference]: Start difference. First operand has 101 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 86 states have internal predecessors, (106), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:32,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:32,069 INFO L93 Difference]: Finished difference Result 193 states and 262 transitions. [2024-11-11 20:53:32,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:53:32,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-11 20:53:32,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:32,083 INFO L225 Difference]: With dead ends: 193 [2024-11-11 20:53:32,083 INFO L226 Difference]: Without dead ends: 92 [2024-11-11 20:53:32,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:53:32,090 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:32,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:32,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-11 20:53:32,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-11 20:53:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 78 states have internal predecessors, (92), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-11 20:53:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2024-11-11 20:53:32,136 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 119 transitions. Word has length 25 [2024-11-11 20:53:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:32,137 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 119 transitions. [2024-11-11 20:53:32,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2024-11-11 20:53:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 20:53:32,139 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:32,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:32,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:53:32,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:32,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:32,141 INFO L85 PathProgramCache]: Analyzing trace with hash 356391721, now seen corresponding path program 1 times [2024-11-11 20:53:32,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:32,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754711511] [2024-11-11 20:53:32,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:32,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 20:53:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:32,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:32,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754711511] [2024-11-11 20:53:32,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754711511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:32,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:32,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:53:32,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965179881] [2024-11-11 20:53:32,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:32,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:53:32,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:32,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:53:32,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:32,257 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:32,281 INFO L93 Difference]: Finished difference Result 144 states and 186 transitions. [2024-11-11 20:53:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:53:32,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-11 20:53:32,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:32,283 INFO L225 Difference]: With dead ends: 144 [2024-11-11 20:53:32,284 INFO L226 Difference]: Without dead ends: 83 [2024-11-11 20:53:32,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:32,286 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 17 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:32,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 190 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:32,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-11 20:53:32,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-11 20:53:32,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.328125) internal successors, (85), 72 states have internal predecessors, (85), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-11 20:53:32,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2024-11-11 20:53:32,300 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 26 [2024-11-11 20:53:32,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:32,302 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2024-11-11 20:53:32,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:32,302 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2024-11-11 20:53:32,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 20:53:32,303 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:32,303 INFO L218 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] [2024-11-11 20:53:32,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:53:32,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:32,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1826063129, now seen corresponding path program 1 times [2024-11-11 20:53:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:32,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732750964] [2024-11-11 20:53:32,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 20:53:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:32,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:32,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732750964] [2024-11-11 20:53:32,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732750964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:32,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:32,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:32,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584025419] [2024-11-11 20:53:32,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:32,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:32,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:32,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:32,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:32,422 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:32,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:32,486 INFO L93 Difference]: Finished difference Result 201 states and 263 transitions. [2024-11-11 20:53:32,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:53:32,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-11 20:53:32,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:32,488 INFO L225 Difference]: With dead ends: 201 [2024-11-11 20:53:32,488 INFO L226 Difference]: Without dead ends: 126 [2024-11-11 20:53:32,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:53:32,490 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 100 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:32,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 413 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:32,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-11 20:53:32,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2024-11-11 20:53:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 94 states have (on average 1.351063829787234) internal successors, (127), 105 states have internal predecessors, (127), 16 states have call successors, (16), 12 states have call predecessors, (16), 12 states have return successors, (17), 12 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-11 20:53:32,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 160 transitions. [2024-11-11 20:53:32,503 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 160 transitions. Word has length 31 [2024-11-11 20:53:32,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:32,503 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 160 transitions. [2024-11-11 20:53:32,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:32,503 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 160 transitions. [2024-11-11 20:53:32,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-11 20:53:32,504 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:32,505 INFO L218 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] [2024-11-11 20:53:32,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:53:32,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:32,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:32,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1496608149, now seen corresponding path program 1 times [2024-11-11 20:53:32,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:32,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472640465] [2024-11-11 20:53:32,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:32,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:53:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:32,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:32,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472640465] [2024-11-11 20:53:32,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472640465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:32,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:32,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:32,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035466387] [2024-11-11 20:53:32,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:32,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:32,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:32,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:32,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:32,613 INFO L87 Difference]: Start difference. First operand 123 states and 160 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:32,685 INFO L93 Difference]: Finished difference Result 274 states and 366 transitions. [2024-11-11 20:53:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:53:32,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-11-11 20:53:32,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:32,687 INFO L225 Difference]: With dead ends: 274 [2024-11-11 20:53:32,687 INFO L226 Difference]: Without dead ends: 159 [2024-11-11 20:53:32,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:53:32,689 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 76 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:32,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 365 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-11 20:53:32,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2024-11-11 20:53:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 132 states have internal predecessors, (156), 19 states have call successors, (19), 17 states have call predecessors, (19), 17 states have return successors, (25), 18 states have call predecessors, (25), 19 states have call successors, (25) [2024-11-11 20:53:32,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 200 transitions. [2024-11-11 20:53:32,711 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 200 transitions. Word has length 34 [2024-11-11 20:53:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:32,712 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 200 transitions. [2024-11-11 20:53:32,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 200 transitions. [2024-11-11 20:53:32,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 20:53:32,716 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:32,716 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:32,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:53:32,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:32,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:32,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1570330873, now seen corresponding path program 1 times [2024-11-11 20:53:32,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:32,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88188522] [2024-11-11 20:53:32,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:32,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 20:53:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:53:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:53:32,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:32,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88188522] [2024-11-11 20:53:32,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88188522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:32,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:32,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:53:32,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105601960] [2024-11-11 20:53:32,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:32,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:53:32,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:32,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:53:32,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:53:32,843 INFO L87 Difference]: Start difference. First operand 158 states and 200 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:53:32,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:32,974 INFO L93 Difference]: Finished difference Result 336 states and 436 transitions. [2024-11-11 20:53:32,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:53:32,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2024-11-11 20:53:32,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:32,976 INFO L225 Difference]: With dead ends: 336 [2024-11-11 20:53:32,979 INFO L226 Difference]: Without dead ends: 186 [2024-11-11 20:53:32,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:53:32,980 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 58 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:32,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 374 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:32,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-11 20:53:32,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2024-11-11 20:53:32,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 153 states have internal predecessors, (181), 21 states have call successors, (21), 17 states have call predecessors, (21), 20 states have return successors, (30), 22 states have call predecessors, (30), 21 states have call successors, (30) [2024-11-11 20:53:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 232 transitions. [2024-11-11 20:53:32,997 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 232 transitions. Word has length 53 [2024-11-11 20:53:32,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:32,998 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 232 transitions. [2024-11-11 20:53:32,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:53:32,998 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 232 transitions. [2024-11-11 20:53:33,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 20:53:33,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:33,001 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:33,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:53:33,001 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:33,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:33,002 INFO L85 PathProgramCache]: Analyzing trace with hash 364060663, now seen corresponding path program 1 times [2024-11-11 20:53:33,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:33,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044547428] [2024-11-11 20:53:33,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:33,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:53:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 20:53:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:53:33,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:33,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044547428] [2024-11-11 20:53:33,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044547428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:33,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:33,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 20:53:33,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783762482] [2024-11-11 20:53:33,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:33,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 20:53:33,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:33,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 20:53:33,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 20:53:33,063 INFO L87 Difference]: Start difference. First operand 184 states and 232 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:53:33,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:33,174 INFO L93 Difference]: Finished difference Result 364 states and 459 transitions. [2024-11-11 20:53:33,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:53:33,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2024-11-11 20:53:33,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:33,175 INFO L225 Difference]: With dead ends: 364 [2024-11-11 20:53:33,176 INFO L226 Difference]: Without dead ends: 188 [2024-11-11 20:53:33,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-11-11 20:53:33,177 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 97 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:33,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 251 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:33,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-11 20:53:33,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2024-11-11 20:53:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 142 states have (on average 1.267605633802817) internal successors, (180), 153 states have internal predecessors, (180), 21 states have call successors, (21), 17 states have call predecessors, (21), 20 states have return successors, (28), 22 states have call predecessors, (28), 21 states have call successors, (28) [2024-11-11 20:53:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 229 transitions. [2024-11-11 20:53:33,197 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 229 transitions. Word has length 56 [2024-11-11 20:53:33,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:33,198 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 229 transitions. [2024-11-11 20:53:33,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:53:33,198 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 229 transitions. [2024-11-11 20:53:33,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 20:53:33,200 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:33,201 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:33,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:53:33,201 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:33,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:33,201 INFO L85 PathProgramCache]: Analyzing trace with hash -801408389, now seen corresponding path program 1 times [2024-11-11 20:53:33,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:33,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212590592] [2024-11-11 20:53:33,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:33,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 20:53:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:53:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:53:33,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:33,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212590592] [2024-11-11 20:53:33,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212590592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:33,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:33,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:33,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540940715] [2024-11-11 20:53:33,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:33,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:33,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:33,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:33,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:33,286 INFO L87 Difference]: Start difference. First operand 184 states and 229 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:53:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:33,379 INFO L93 Difference]: Finished difference Result 364 states and 462 transitions. [2024-11-11 20:53:33,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:53:33,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2024-11-11 20:53:33,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:33,381 INFO L225 Difference]: With dead ends: 364 [2024-11-11 20:53:33,381 INFO L226 Difference]: Without dead ends: 188 [2024-11-11 20:53:33,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:53:33,384 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 57 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:33,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 293 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-11 20:53:33,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2024-11-11 20:53:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 155 states have internal predecessors, (182), 21 states have call successors, (21), 17 states have call predecessors, (21), 20 states have return successors, (28), 22 states have call predecessors, (28), 21 states have call successors, (28) [2024-11-11 20:53:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 231 transitions. [2024-11-11 20:53:33,402 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 231 transitions. Word has length 53 [2024-11-11 20:53:33,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:33,402 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 231 transitions. [2024-11-11 20:53:33,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:53:33,403 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 231 transitions. [2024-11-11 20:53:33,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 20:53:33,404 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:33,404 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:33,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:53:33,404 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:33,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:33,405 INFO L85 PathProgramCache]: Analyzing trace with hash 584795005, now seen corresponding path program 1 times [2024-11-11 20:53:33,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:33,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093881571] [2024-11-11 20:53:33,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:33,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 20:53:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:53:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:53:33,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:33,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093881571] [2024-11-11 20:53:33,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093881571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:33,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:33,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:33,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876977544] [2024-11-11 20:53:33,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:33,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:33,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:33,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:33,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:33,494 INFO L87 Difference]: Start difference. First operand 186 states and 231 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:53:33,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:33,651 INFO L93 Difference]: Finished difference Result 557 states and 715 transitions. [2024-11-11 20:53:33,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:53:33,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 53 [2024-11-11 20:53:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:33,654 INFO L225 Difference]: With dead ends: 557 [2024-11-11 20:53:33,654 INFO L226 Difference]: Without dead ends: 379 [2024-11-11 20:53:33,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:53:33,655 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 222 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:33,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 314 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-11 20:53:33,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2024-11-11 20:53:33,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 289 states have (on average 1.2387543252595157) internal successors, (358), 308 states have internal predecessors, (358), 45 states have call successors, (45), 42 states have call predecessors, (45), 42 states have return successors, (65), 44 states have call predecessors, (65), 45 states have call successors, (65) [2024-11-11 20:53:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 468 transitions. [2024-11-11 20:53:33,679 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 468 transitions. Word has length 53 [2024-11-11 20:53:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:33,679 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 468 transitions. [2024-11-11 20:53:33,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:53:33,680 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 468 transitions. [2024-11-11 20:53:33,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 20:53:33,680 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:33,680 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:33,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:53:33,681 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:33,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:33,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2002712797, now seen corresponding path program 1 times [2024-11-11 20:53:33,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:33,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8362769] [2024-11-11 20:53:33,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:33,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:53:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:53:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:53:33,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:33,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8362769] [2024-11-11 20:53:33,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8362769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:33,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:33,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:33,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010752513] [2024-11-11 20:53:33,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:33,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:33,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:33,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:33,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:33,731 INFO L87 Difference]: Start difference. First operand 377 states and 468 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 20:53:33,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:33,976 INFO L93 Difference]: Finished difference Result 702 states and 914 transitions. [2024-11-11 20:53:33,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:53:33,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2024-11-11 20:53:33,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:33,979 INFO L225 Difference]: With dead ends: 702 [2024-11-11 20:53:33,979 INFO L226 Difference]: Without dead ends: 700 [2024-11-11 20:53:33,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:53:33,980 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 332 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:33,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 230 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:53:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-11 20:53:34,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 605. [2024-11-11 20:53:34,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 465 states have (on average 1.243010752688172) internal successors, (578), 498 states have internal predecessors, (578), 73 states have call successors, (73), 57 states have call predecessors, (73), 66 states have return successors, (144), 72 states have call predecessors, (144), 73 states have call successors, (144) [2024-11-11 20:53:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 795 transitions. [2024-11-11 20:53:34,013 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 795 transitions. Word has length 57 [2024-11-11 20:53:34,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:34,014 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 795 transitions. [2024-11-11 20:53:34,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 20:53:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 795 transitions. [2024-11-11 20:53:34,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 20:53:34,015 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:34,016 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:34,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:53:34,016 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:34,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:34,016 INFO L85 PathProgramCache]: Analyzing trace with hash -729677511, now seen corresponding path program 1 times [2024-11-11 20:53:34,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:34,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129493400] [2024-11-11 20:53:34,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:34,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 20:53:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:53:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:53:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:53:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 20:53:34,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:34,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129493400] [2024-11-11 20:53:34,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129493400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:34,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422880353] [2024-11-11 20:53:34,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:34,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:34,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:34,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:53:34,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:53:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 20:53:34,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-11 20:53:34,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:53:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-11 20:53:34,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422880353] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:34,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 20:53:34,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 5] total 14 [2024-11-11 20:53:34,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464975163] [2024-11-11 20:53:34,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:34,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:53:34,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:34,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:53:34,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:53:34,574 INFO L87 Difference]: Start difference. First operand 605 states and 795 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:53:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:34,682 INFO L93 Difference]: Finished difference Result 1719 states and 2329 transitions. [2024-11-11 20:53:34,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:53:34,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2024-11-11 20:53:34,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:34,687 INFO L225 Difference]: With dead ends: 1719 [2024-11-11 20:53:34,687 INFO L226 Difference]: Without dead ends: 1122 [2024-11-11 20:53:34,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:53:34,689 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 63 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:34,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 480 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-11-11 20:53:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1003. [2024-11-11 20:53:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 761 states have (on average 1.2155059132720105) internal successors, (925), 819 states have internal predecessors, (925), 125 states have call successors, (125), 99 states have call predecessors, (125), 116 states have return successors, (236), 124 states have call predecessors, (236), 125 states have call successors, (236) [2024-11-11 20:53:34,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1286 transitions. [2024-11-11 20:53:34,743 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1286 transitions. Word has length 99 [2024-11-11 20:53:34,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:34,744 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1286 transitions. [2024-11-11 20:53:34,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:53:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1286 transitions. [2024-11-11 20:53:34,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 20:53:34,760 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:34,760 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:34,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:53:34,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-11 20:53:34,962 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:34,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash -136342563, now seen corresponding path program 1 times [2024-11-11 20:53:34,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:34,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720058469] [2024-11-11 20:53:34,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:34,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:53:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:53:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:53:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:53:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:53:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 20:53:35,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:35,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720058469] [2024-11-11 20:53:35,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720058469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:35,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573622302] [2024-11-11 20:53:35,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:35,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:35,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:35,292 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-11-11 20:53:35,293 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-11-11 20:53:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:53:35,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:35,472 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 20:53:35,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:35,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573622302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:35,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:53:35,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 21 [2024-11-11 20:53:35,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684993477] [2024-11-11 20:53:35,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:35,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:53:35,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:35,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:53:35,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2024-11-11 20:53:35,476 INFO L87 Difference]: Start difference. First operand 1003 states and 1286 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:53:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:35,587 INFO L93 Difference]: Finished difference Result 1924 states and 2482 transitions. [2024-11-11 20:53:35,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:53:35,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 103 [2024-11-11 20:53:35,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:35,592 INFO L225 Difference]: With dead ends: 1924 [2024-11-11 20:53:35,592 INFO L226 Difference]: Without dead ends: 929 [2024-11-11 20:53:35,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2024-11-11 20:53:35,595 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 70 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:35,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 556 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2024-11-11 20:53:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 921. [2024-11-11 20:53:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 699 states have (on average 1.200286123032904) internal successors, (839), 751 states have internal predecessors, (839), 117 states have call successors, (117), 93 states have call predecessors, (117), 104 states have return successors, (188), 112 states have call predecessors, (188), 117 states have call successors, (188) [2024-11-11 20:53:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1144 transitions. [2024-11-11 20:53:35,657 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1144 transitions. Word has length 103 [2024-11-11 20:53:35,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:35,657 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1144 transitions. [2024-11-11 20:53:35,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:53:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1144 transitions. [2024-11-11 20:53:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-11 20:53:35,661 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:35,661 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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, 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-11-11 20:53:35,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 20:53:35,862 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,SelfDestructingSolverStorable10 [2024-11-11 20:53:35,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:35,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:35,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1042607335, now seen corresponding path program 1 times [2024-11-11 20:53:35,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:35,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084418681] [2024-11-11 20:53:35,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:35,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 20:53:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:53:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:53:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:53:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:36,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:53:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:36,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:36,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:36,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:53:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:36,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:36,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 20:53:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 46 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:53:36,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:36,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084418681] [2024-11-11 20:53:36,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084418681] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:36,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083864402] [2024-11-11 20:53:36,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:36,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:36,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:36,050 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-11-11 20:53:36,051 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-11-11 20:53:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:36,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 20:53:36,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 20:53:36,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:53:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-11 20:53:36,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083864402] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:53:36,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:53:36,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2024-11-11 20:53:36,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323773535] [2024-11-11 20:53:36,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:53:36,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:53:36,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:36,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:53:36,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:53:36,448 INFO L87 Difference]: Start difference. First operand 921 states and 1144 transitions. Second operand has 12 states, 12 states have (on average 11.583333333333334) internal successors, (139), 9 states have internal predecessors, (139), 6 states have call successors, (29), 10 states have call predecessors, (29), 5 states have return successors, (21), 6 states have call predecessors, (21), 5 states have call successors, (21) [2024-11-11 20:53:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:37,077 INFO L93 Difference]: Finished difference Result 2220 states and 2871 transitions. [2024-11-11 20:53:37,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 20:53:37,077 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.583333333333334) internal successors, (139), 9 states have internal predecessors, (139), 6 states have call successors, (29), 10 states have call predecessors, (29), 5 states have return successors, (21), 6 states have call predecessors, (21), 5 states have call successors, (21) Word has length 142 [2024-11-11 20:53:37,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:37,095 INFO L225 Difference]: With dead ends: 2220 [2024-11-11 20:53:37,095 INFO L226 Difference]: Without dead ends: 1471 [2024-11-11 20:53:37,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 309 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=630, Unknown=0, NotChecked=0, Total=930 [2024-11-11 20:53:37,098 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 611 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:37,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 280 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 20:53:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2024-11-11 20:53:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1280. [2024-11-11 20:53:37,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 967 states have (on average 1.2099276111685626) internal successors, (1170), 1040 states have internal predecessors, (1170), 165 states have call successors, (165), 134 states have call predecessors, (165), 147 states have return successors, (277), 149 states have call predecessors, (277), 165 states have call successors, (277) [2024-11-11 20:53:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1612 transitions. [2024-11-11 20:53:37,158 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1612 transitions. Word has length 142 [2024-11-11 20:53:37,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:37,158 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1612 transitions. [2024-11-11 20:53:37,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.583333333333334) internal successors, (139), 9 states have internal predecessors, (139), 6 states have call successors, (29), 10 states have call predecessors, (29), 5 states have return successors, (21), 6 states have call predecessors, (21), 5 states have call successors, (21) [2024-11-11 20:53:37,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1612 transitions. [2024-11-11 20:53:37,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-11 20:53:37,162 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:37,162 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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, 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] [2024-11-11 20:53:37,176 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-11-11 20:53:37,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:37,367 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:37,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:37,368 INFO L85 PathProgramCache]: Analyzing trace with hash -343596059, now seen corresponding path program 1 times [2024-11-11 20:53:37,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:37,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857587980] [2024-11-11 20:53:37,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:37,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 20:53:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:53:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:53:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:53:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:53:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:53:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 20:53:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:53:37,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:37,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857587980] [2024-11-11 20:53:37,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857587980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:37,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968439585] [2024-11-11 20:53:37,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:37,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:37,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:37,618 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:53:37,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 20:53:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:37,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 20:53:37,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:37,900 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 82 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:53:37,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:53:38,074 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-11 20:53:38,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968439585] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:53:38,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:53:38,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 18 [2024-11-11 20:53:38,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769963648] [2024-11-11 20:53:38,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:53:38,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-11 20:53:38,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:38,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-11 20:53:38,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:53:38,076 INFO L87 Difference]: Start difference. First operand 1280 states and 1612 transitions. Second operand has 18 states, 18 states have (on average 8.11111111111111) internal successors, (146), 15 states have internal predecessors, (146), 6 states have call successors, (30), 10 states have call predecessors, (30), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-11 20:53:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:39,347 INFO L93 Difference]: Finished difference Result 3506 states and 4646 transitions. [2024-11-11 20:53:39,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-11 20:53:39,348 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.11111111111111) internal successors, (146), 15 states have internal predecessors, (146), 6 states have call successors, (30), 10 states have call predecessors, (30), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 142 [2024-11-11 20:53:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:39,357 INFO L225 Difference]: With dead ends: 3506 [2024-11-11 20:53:39,358 INFO L226 Difference]: Without dead ends: 2395 [2024-11-11 20:53:39,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 305 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=503, Invalid=1477, Unknown=0, NotChecked=0, Total=1980 [2024-11-11 20:53:39,362 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 664 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:39,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 528 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 20:53:39,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2024-11-11 20:53:39,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 2091. [2024-11-11 20:53:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2091 states, 1575 states have (on average 1.2019047619047618) internal successors, (1893), 1677 states have internal predecessors, (1893), 274 states have call successors, (274), 234 states have call predecessors, (274), 241 states have return successors, (447), 241 states have call predecessors, (447), 274 states have call successors, (447) [2024-11-11 20:53:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 2614 transitions. [2024-11-11 20:53:39,498 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 2614 transitions. Word has length 142 [2024-11-11 20:53:39,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:39,499 INFO L471 AbstractCegarLoop]: Abstraction has 2091 states and 2614 transitions. [2024-11-11 20:53:39,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.11111111111111) internal successors, (146), 15 states have internal predecessors, (146), 6 states have call successors, (30), 10 states have call predecessors, (30), 6 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-11 20:53:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 2614 transitions. [2024-11-11 20:53:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-11 20:53:39,502 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:39,502 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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, 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-11-11 20:53:39,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 20:53:39,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:39,707 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:39,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:39,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1075563485, now seen corresponding path program 1 times [2024-11-11 20:53:39,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:39,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269312375] [2024-11-11 20:53:39,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:39,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 20:53:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:53:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:53:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:53:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:53:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:53:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 20:53:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-11 20:53:39,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:39,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269312375] [2024-11-11 20:53:39,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269312375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:39,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:39,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 20:53:39,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067094186] [2024-11-11 20:53:39,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:39,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:53:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:39,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:53:39,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:53:39,839 INFO L87 Difference]: Start difference. First operand 2091 states and 2614 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:53:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:40,211 INFO L93 Difference]: Finished difference Result 2704 states and 3329 transitions. [2024-11-11 20:53:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 20:53:40,211 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 142 [2024-11-11 20:53:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:40,213 INFO L225 Difference]: With dead ends: 2704 [2024-11-11 20:53:40,213 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 20:53:40,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:53:40,217 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 222 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:40,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 238 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:53:40,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 20:53:40,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 20:53:40,218 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-11-11 20:53:40,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 20:53:40,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2024-11-11 20:53:40,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:40,219 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 20:53:40,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:53:40,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 20:53:40,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 20:53:40,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:53:40,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:53:40,223 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:40,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 20:53:44,429 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:53:44,441 WARN L156 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (<= 1 ~waterLevel~0)) (.cse1 (not (= 0 ~systemActive~0)))) (or (and (= ~methaneLevelCritical~0 0) .cse0 .cse1) (and (<= 1 ~methaneLevelCritical~0) .cse0 .cse1)))) Eliminated clause: (let ((.cse0 (<= 1 ~waterLevel~0)) (.cse1 (not (= 0 ~systemActive~0)))) (or (and (= ~methaneLevelCritical~0 0) .cse0 .cse1) (and (<= 1 ~methaneLevelCritical~0) .cse0 .cse1))) [2024-11-11 20:53:44,459 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (and (let ((.cse0 (= ~pumpRunning~0 0)) (.cse3 (<= 1 ~waterLevel~0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse2 (= |old(~methaneLevelCritical~0)| 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 1 |old(~methaneLevelCritical~0)|) .cse3) (and .cse1 .cse2 (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0))))) (= |old(~methaneLevelCritical~0)| ~methaneLevelCritical~0)) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse3 (<= 1 ~waterLevel~0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse2 (= ~methaneLevelCritical~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 1 ~methaneLevelCritical~0) .cse3) (and .cse1 .cse2 (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0))))) [2024-11-11 20:53:44,470 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (= |old(~waterLevel~0)| ~waterLevel~0) (= |old(~methAndRunningLastTime~0)| ~methAndRunningLastTime~0) (let ((.cse4 (= 0 ~systemActive~0))) (let ((.cse0 (<= 1 ~methaneLevelCritical~0)) (.cse5 (<= 2 |old(~waterLevel~0)|)) (.cse6 (not .cse4)) (.cse7 (= ~methaneLevelCritical~0 0)) (.cse1 (= |old(~methAndRunningLastTime~0)| 0)) (.cse2 (= |old(~pumpRunning~0)| 0)) (.cse3 (<= 1 |old(~waterLevel~0)|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6) (and .cse7 .cse2 .cse3 .cse4) (and .cse7 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse3))))) Eliminated clause: (let ((.cse3 (= 0 ~systemActive~0))) (let ((.cse5 (<= 2 ~waterLevel~0)) (.cse6 (not .cse3)) (.cse4 (= ~methaneLevelCritical~0 0)) (.cse0 (= ~pumpRunning~0 0)) (.cse7 (= ~methAndRunningLastTime~0 0)) (.cse1 (<= 1 ~methaneLevelCritical~0)) (.cse2 (<= 1 ~waterLevel~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse4 .cse2) (and .cse7 .cse1 .cse5 .cse6) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse7 .cse1 .cse2)))) [2024-11-11 20:53:44,497 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 0) (let ((.cse2 (= ~methAndRunningLastTime~0 0)) (.cse3 (<= 1 ~methaneLevelCritical~0)) (.cse0 (= |old(~pumpRunning~0)| 0)) (.cse1 (not (= 0 ~systemActive~0)))) (or (and (= ~methaneLevelCritical~0 0) .cse0 (<= 1 ~waterLevel~0) .cse1) (and .cse2 .cse3 (<= 2 ~waterLevel~0) .cse0 .cse1) (and .cse2 .cse3 .cse0 (= ~waterLevel~0 1) .cse1)))) Eliminated clause: (and (= ~pumpRunning~0 0) (let ((.cse1 (= ~methAndRunningLastTime~0 0)) (.cse2 (<= 1 ~methaneLevelCritical~0)) (.cse0 (not (= 0 ~systemActive~0)))) (or (and (= ~methaneLevelCritical~0 0) (<= 1 ~waterLevel~0) .cse0) (and .cse1 .cse2 (<= 2 ~waterLevel~0) .cse0) (and .cse1 .cse2 (= ~waterLevel~0 1) .cse0)))) [2024-11-11 20:53:44,506 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse2 (= ~pumpRunning~0 0)) (.cse0 (= ~methAndRunningLastTime~0 0)) (.cse1 (= ~methaneLevelCritical~0 0)) (.cse3 (<= 1 |old(~waterLevel~0)|))) (or (and .cse0 .cse1 (<= 2 |old(~waterLevel~0)|) (not (= 0 ~systemActive~0))) (and .cse2 .cse0 (<= 1 ~methaneLevelCritical~0) .cse3) (and .cse2 .cse0 .cse1 .cse3)))) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse3 (<= 1 ~waterLevel~0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse2 (= ~methaneLevelCritical~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 1 ~methaneLevelCritical~0) .cse3) (and .cse1 .cse2 (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0))))) [2024-11-11 20:53:44,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:53:44 BoogieIcfgContainer [2024-11-11 20:53:44,509 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:53:44,510 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:53:44,510 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:53:44,510 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:53:44,510 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:53:31" (3/4) ... [2024-11-11 20:53:44,512 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 20:53:44,517 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-11-11 20:53:44,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-11 20:53:44,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-11 20:53:44,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-11 20:53:44,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-11 20:53:44,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-11-11 20:53:44,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:53:44,518 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-11 20:53:44,525 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-11 20:53:44,525 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-11 20:53:44,525 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-11 20:53:44,525 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:53:44,526 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:53:44,604 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:53:44,605 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 20:53:44,605 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:53:44,605 INFO L158 Benchmark]: Toolchain (without parser) took 13695.06ms. Allocated memory was 155.2MB in the beginning and 369.1MB in the end (delta: 213.9MB). Free memory was 81.8MB in the beginning and 293.7MB in the end (delta: -211.9MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2024-11-11 20:53:44,605 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:53:44,606 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.19ms. Allocated memory is still 155.2MB. Free memory was 81.4MB in the beginning and 115.3MB in the end (delta: -33.9MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-11-11 20:53:44,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.01ms. Allocated memory is still 155.2MB. Free memory was 115.3MB in the beginning and 113.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:53:44,606 INFO L158 Benchmark]: Boogie Preprocessor took 40.92ms. Allocated memory is still 155.2MB. Free memory was 113.2MB in the beginning and 110.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 20:53:44,606 INFO L158 Benchmark]: RCFGBuilder took 349.81ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 91.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 20:53:44,607 INFO L158 Benchmark]: TraceAbstraction took 12761.67ms. Allocated memory was 155.2MB in the beginning and 369.1MB in the end (delta: 213.9MB). Free memory was 90.1MB in the beginning and 302.1MB in the end (delta: -212.0MB). Peak memory consumption was 191.9MB. Max. memory is 16.1GB. [2024-11-11 20:53:44,607 INFO L158 Benchmark]: Witness Printer took 95.09ms. Allocated memory is still 369.1MB. Free memory was 302.1MB in the beginning and 293.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 20:53:44,608 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 155.2MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.19ms. Allocated memory is still 155.2MB. Free memory was 81.4MB in the beginning and 115.3MB in the end (delta: -33.9MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.01ms. Allocated memory is still 155.2MB. Free memory was 115.3MB in the beginning and 113.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.92ms. Allocated memory is still 155.2MB. Free memory was 113.2MB in the beginning and 110.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 349.81ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 91.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12761.67ms. Allocated memory was 155.2MB in the beginning and 369.1MB in the end (delta: 213.9MB). Free memory was 90.1MB in the beginning and 302.1MB in the end (delta: -212.0MB). Peak memory consumption was 191.9MB. Max. memory is 16.1GB. * Witness Printer took 95.09ms. Allocated memory is still 369.1MB. Free memory was 302.1MB in the beginning and 293.7MB in the end (delta: 8.4MB). 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,"Environment.i","") [49] - GenericResultAtLocation [Line: 160]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [160] - GenericResultAtLocation [Line: 169]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [169] - GenericResultAtLocation [Line: 273]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [273] - GenericResultAtLocation [Line: 308]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [308] - GenericResultAtLocation [Line: 379]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [379] - GenericResultAtLocation [Line: 745]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [745] - GenericResultAtLocation [Line: 987]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [987] * 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: 165]: 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, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2630 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2589 mSDsluCounter, 4640 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3247 mSDsCounter, 771 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3474 IncrementalHoareTripleChecker+Invalid, 4245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 771 mSolverCounterUnsat, 1393 mSDtfsCounter, 3474 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1201 GetRequests, 1032 SyntacticMatches, 10 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2091occurred in iteration=13, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 731 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1502 NumberOfCodeBlocks, 1502 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1864 ConstructedInterpolants, 0 QuantifiedInterpolants, 3787 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1548 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 21 InterpolantComputations, 12 PerfectInterpolantSequences, 761/892 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: 321]: Loop Invariant Derived loop invariant: (((((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (2 <= waterLevel)) && (splverifierCounter == 0)) && (0 != systemActive)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (splverifierCounter == 0)) && (1 <= waterLevel))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (splverifierCounter == 0)) && (1 <= waterLevel))) - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 320]: Location Invariant Derived location invariant: 0 - ProcedureContractResult [Line: 862]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: ((((methaneLevelCritical == 0) && (1 <= waterLevel)) && (0 != systemActive)) || (((1 <= methaneLevelCritical) && (1 <= waterLevel)) && (0 != systemActive))) Ensures: (((pumpRunning == 0) && ((((methaneLevelCritical == 0) && (1 <= waterLevel)) && (0 != systemActive)) || (((1 <= methaneLevelCritical) && (1 <= waterLevel)) && (0 != systemActive)))) && ((((((waterLevel == \old(waterLevel)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime)))) - ProcedureContractResult [Line: 777]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 <= waterLevel)) && (0 != systemActive)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (waterLevel == 1)) && (0 != systemActive))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (2 <= waterLevel)) && (0 != systemActive))) Ensures: (((((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 <= waterLevel)) && (0 != systemActive)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (waterLevel == 1)) && (0 != systemActive))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (2 <= waterLevel)) && (0 != systemActive))) && (((((((waterLevel == \old(waterLevel)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime)))) - ProcedureContractResult [Line: 84]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 <= waterLevel)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 <= waterLevel))) || ((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (2 <= waterLevel)) && (0 != systemActive))) Ensures: (((((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (\old(methaneLevelCritical) == 0)) && (1 <= waterLevel)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= \old(methaneLevelCritical))) && (1 <= waterLevel))) || ((((methAndRunningLastTime == 0) && (\old(methaneLevelCritical) == 0)) && (2 <= waterLevel)) && (0 != systemActive))) && ((\old(methaneLevelCritical) != 0) || (0 < methaneLevelCritical))) && ((methaneLevelCritical == 0) || (\old(methaneLevelCritical) < 1))) && ((((((waterLevel == \old(waterLevel)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime)))) - ProcedureContractResult [Line: 753]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: (((((((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 <= waterLevel)) && (0 == systemActive)) || (((methaneLevelCritical == 0) && (2 <= waterLevel)) && (0 != systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 <= waterLevel))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (2 <= waterLevel)) && (0 != systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 <= waterLevel)) && (0 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 <= waterLevel))) Ensures: ((((((((0 == systemActive) || (methaneLevelCritical < 1)) || ((pumpRunning == 0) && (methAndRunningLastTime == 0))) && ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (\old(waterLevel) == waterLevel)) || (0 != systemActive))) && ((((\old(pumpRunning) != 0) || (\old(methAndRunningLastTime) != 0)) || (((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (\old(waterLevel) == waterLevel))) || ((2 <= waterLevel) && (\old(waterLevel) == waterLevel)))) && (((\old(waterLevel) < 2) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (\old(waterLevel) <= ((long long) waterLevel + 1))) && (0 != systemActive))) || (((methAndRunningLastTime == 0) && (2 <= waterLevel)) && (\old(waterLevel) <= ((long long) waterLevel + 1))))) && (((((((((1 <= methaneLevelCritical) && (\old(methAndRunningLastTime) == 0)) && (\old(pumpRunning) == 0)) && (1 <= \old(waterLevel))) || ((((1 <= methaneLevelCritical) && (\old(pumpRunning) == 0)) && (1 <= \old(waterLevel))) && (0 == systemActive))) || ((((1 <= methaneLevelCritical) && (\old(methAndRunningLastTime) == 0)) && (2 <= \old(waterLevel))) && (0 != systemActive))) || ((((methaneLevelCritical == 0) && (\old(pumpRunning) == 0)) && (1 <= \old(waterLevel))) && (0 == systemActive))) || (((methaneLevelCritical == 0) && (2 <= \old(waterLevel))) && (0 != systemActive))) || ((((methaneLevelCritical == 0) && (\old(methAndRunningLastTime) == 0)) && (\old(pumpRunning) == 0)) && (1 <= \old(waterLevel))))) && ((((methaneLevelCritical == \old(methaneLevelCritical)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 172]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((methaneLevelCritical == \old(methaneLevelCritical)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 96]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 <= waterLevel)) && (0 != systemActive)) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 <= waterLevel)) && (0 == systemActive))) || (((methaneLevelCritical == 0) && (2 <= waterLevel)) && (0 != systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 <= waterLevel)) && (0 != systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 <= waterLevel)) && (0 == systemActive))) Ensures: ((((methaneLevelCritical <= \result) && ((((((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 <= waterLevel)) && (0 != systemActive)) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 <= waterLevel)) && (0 == systemActive))) || (((methaneLevelCritical == 0) && (2 <= waterLevel)) && (0 != systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 <= waterLevel)) && (0 != systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 <= waterLevel)) && (0 == systemActive)))) && ((methaneLevelCritical != 0) || (\result == 0))) && (((((((waterLevel == \old(waterLevel)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime)))) - ProcedureContractResult [Line: 785]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((pumpRunning == 0) && (((((methaneLevelCritical == 0) && (1 <= waterLevel)) && (0 != systemActive)) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (2 <= waterLevel)) && (0 != systemActive))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (waterLevel == 1)) && (0 != systemActive)))) Ensures: (((((pumpRunning == 0) || (methaneLevelCritical < 1)) && ((waterLevel != 1) || (pumpRunning == 0))) && ((((((methaneLevelCritical == 0) && (\old(pumpRunning) == 0)) && (1 <= waterLevel)) && (0 != systemActive)) || (((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (2 <= waterLevel)) && (\old(pumpRunning) == 0)) && (0 != systemActive))) || (((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (\old(pumpRunning) == 0)) && (waterLevel == 1)) && (0 != systemActive)))) && ((((((waterLevel == \old(waterLevel)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime)))) - ProcedureContractResult [Line: 72]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 <= waterLevel)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 <= waterLevel))) || ((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (2 <= waterLevel)) && (0 != systemActive))) Ensures: (((((((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel)) && ((pumpRunning == 0) || (methaneLevelCritical < 1))) && ((pumpRunning == 0) || (0 != systemActive))) && ((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (1 <= \old(waterLevel))) || (((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 <= \old(waterLevel))))) && ((\old(waterLevel) != 1) || ((pumpRunning == 0) && (2 <= waterLevel)))) && ((((((methaneLevelCritical == \old(methaneLevelCritical)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime)))) RESULT: Ultimate proved your program to be correct! [2024-11-11 20:53:44,640 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