./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product43.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product43.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 e5a4c274bc0fec0eeea8ea2f72c4bc5bbc7aef2fd24f2cf907e22c2c7f3759d4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:42:48,066 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:42:48,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:42:48,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:42:48,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:42:48,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:42:48,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:42:48,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:42:48,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:42:48,176 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:42:48,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:42:48,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:42:48,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:42:48,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:42:48,179 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:42:48,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:42:48,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:42:48,180 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:42:48,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:42:48,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:42:48,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:42:48,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:42:48,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:42:48,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:42:48,187 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:42:48,188 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:42:48,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:42:48,188 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:42:48,188 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:42:48,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:42:48,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:42:48,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:42:48,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:42:48,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:42:48,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:42:48,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:42:48,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:42:48,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:42:48,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:42:48,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:42:48,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:42:48,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:42:48,192 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 -> e5a4c274bc0fec0eeea8ea2f72c4bc5bbc7aef2fd24f2cf907e22c2c7f3759d4 [2024-10-12 19:42:48,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:42:48,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:42:48,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:42:48,425 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:42:48,425 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:42:48,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product43.cil.c [2024-10-12 19:42:49,843 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:42:50,044 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:42:50,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product43.cil.c [2024-10-12 19:42:50,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5549f0491/0d290581203b41969cebb5f4aa17c2ba/FLAG2afee6cbf [2024-10-12 19:42:50,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5549f0491/0d290581203b41969cebb5f4aa17c2ba [2024-10-12 19:42:50,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:42:50,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:42:50,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:42:50,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:42:50,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:42:50,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:42:50" (1/1) ... [2024-10-12 19:42:50,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69d4e13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:50, skipping insertion in model container [2024-10-12 19:42:50,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:42:50" (1/1) ... [2024-10-12 19:42:50,124 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:42:50,372 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product43.cil.c[18537,18550] [2024-10-12 19:42:50,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:42:50,384 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:42:50,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-10-12 19:42:50,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [415] [2024-10-12 19:42:50,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [521] [2024-10-12 19:42:50,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [589] [2024-10-12 19:42:50,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [786] [2024-10-12 19:42:50,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [881] [2024-10-12 19:42:50,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [931] [2024-10-12 19:42:50,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [966] [2024-10-12 19:42:50,437 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product43.cil.c[18537,18550] [2024-10-12 19:42:50,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:42:50,458 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:42:50,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:50 WrapperNode [2024-10-12 19:42:50,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:42:50,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:42:50,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:42:50,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:42:50,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:50" (1/1) ... [2024-10-12 19:42:50,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:50" (1/1) ... [2024-10-12 19:42:50,511 INFO L138 Inliner]: procedures = 56, calls = 100, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 205 [2024-10-12 19:42:50,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:42:50,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:42:50,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:42:50,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:42:50,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:50" (1/1) ... [2024-10-12 19:42:50,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:50" (1/1) ... [2024-10-12 19:42:50,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:50" (1/1) ... [2024-10-12 19:42:50,563 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 19:42:50,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:50" (1/1) ... [2024-10-12 19:42:50,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:50" (1/1) ... [2024-10-12 19:42:50,568 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:50" (1/1) ... [2024-10-12 19:42:50,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:50" (1/1) ... [2024-10-12 19:42:50,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:50" (1/1) ... [2024-10-12 19:42:50,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:50" (1/1) ... [2024-10-12 19:42:50,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:42:50,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:42:50,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:42:50,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:42:50,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:50" (1/1) ... [2024-10-12 19:42:50,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:42:50,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:42:50,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:42:50,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:42:50,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:42:50,716 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-12 19:42:50,716 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-12 19:42:50,716 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:42:50,717 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:42:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:42:50,717 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:42:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-12 19:42:50,717 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-12 19:42:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2024-10-12 19:42:50,717 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2024-10-12 19:42:50,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:42:50,718 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-12 19:42:50,718 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-12 19:42:50,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:42:50,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:42:50,805 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:42:50,806 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:42:50,995 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-10-12 19:42:50,995 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:42:51,044 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:42:51,044 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 19:42:51,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:42:51 BoogieIcfgContainer [2024-10-12 19:42:51,045 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:42:51,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:42:51,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:42:51,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:42:51,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:42:50" (1/3) ... [2024-10-12 19:42:51,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eccf4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:42:51, skipping insertion in model container [2024-10-12 19:42:51,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:50" (2/3) ... [2024-10-12 19:42:51,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eccf4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:42:51, skipping insertion in model container [2024-10-12 19:42:51,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:42:51" (3/3) ... [2024-10-12 19:42:51,051 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product43.cil.c [2024-10-12 19:42:51,065 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:42:51,066 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:42:51,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:42:51,135 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;@6b4215d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:42:51,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:42:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 54 states have internal predecessors, (74), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-12 19:42:51,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 19:42:51,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:51,147 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:51,147 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:51,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:51,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1216755973, now seen corresponding path program 1 times [2024-10-12 19:42:51,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:51,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088956874] [2024-10-12 19:42:51,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:51,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:51,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:42:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:51,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:42:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:42:51,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:51,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088956874] [2024-10-12 19:42:51,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088956874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:51,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:51,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:42:51,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346230677] [2024-10-12 19:42:51,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:51,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:42:51,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:51,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:42:51,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:42:51,336 INFO L87 Difference]: Start difference. First operand has 66 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 54 states have internal predecessors, (74), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 19:42:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:51,386 INFO L93 Difference]: Finished difference Result 130 states and 189 transitions. [2024-10-12 19:42:51,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:42:51,388 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-12 19:42:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:51,394 INFO L225 Difference]: With dead ends: 130 [2024-10-12 19:42:51,394 INFO L226 Difference]: Without dead ends: 61 [2024-10-12 19:42:51,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:42:51,402 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:51,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:42:51,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-12 19:42:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-12 19:42:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 50 states have internal predecessors, (64), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-12 19:42:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2024-10-12 19:42:51,437 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 22 [2024-10-12 19:42:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:51,437 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2024-10-12 19:42:51,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 19:42:51,438 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2024-10-12 19:42:51,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 19:42:51,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:51,439 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:51,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:42:51,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:51,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:51,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2084275414, now seen corresponding path program 1 times [2024-10-12 19:42:51,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:51,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348312906] [2024-10-12 19:42:51,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:51,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:51,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:42:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:51,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:42:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:42:51,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:51,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348312906] [2024-10-12 19:42:51,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348312906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:51,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:51,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:42:51,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473238238] [2024-10-12 19:42:51,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:51,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:42:51,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:51,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:42:51,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:42:51,559 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 19:42:51,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:51,589 INFO L93 Difference]: Finished difference Result 93 states and 126 transitions. [2024-10-12 19:42:51,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:42:51,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-10-12 19:42:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:51,591 INFO L225 Difference]: With dead ends: 93 [2024-10-12 19:42:51,591 INFO L226 Difference]: Without dead ends: 53 [2024-10-12 19:42:51,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:42:51,592 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 14 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:51,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:42:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-12 19:42:51,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-12 19:42:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.45) internal successors, (58), 45 states have internal predecessors, (58), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-12 19:42:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2024-10-12 19:42:51,601 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 23 [2024-10-12 19:42:51,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:51,602 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2024-10-12 19:42:51,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 19:42:51,602 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2024-10-12 19:42:51,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 19:42:51,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:51,603 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:42:51,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:42:51,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:51,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:51,604 INFO L85 PathProgramCache]: Analyzing trace with hash -508518016, now seen corresponding path program 1 times [2024-10-12 19:42:51,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:51,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791641723] [2024-10-12 19:42:51,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:51,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:51,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:42:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:51,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:42:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:42:51,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:51,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791641723] [2024-10-12 19:42:51,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791641723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:51,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:51,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:42:51,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523128099] [2024-10-12 19:42:51,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:51,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:42:51,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:51,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:42:51,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:42:51,671 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:42:51,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:51,716 INFO L93 Difference]: Finished difference Result 155 states and 213 transitions. [2024-10-12 19:42:51,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:42:51,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-10-12 19:42:51,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:51,718 INFO L225 Difference]: With dead ends: 155 [2024-10-12 19:42:51,718 INFO L226 Difference]: Without dead ends: 104 [2024-10-12 19:42:51,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:42:51,719 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 56 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:51,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 128 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:42:51,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-12 19:42:51,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2024-10-12 19:42:51,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 84 states have internal predecessors, (109), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-12 19:42:51,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2024-10-12 19:42:51,732 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 26 [2024-10-12 19:42:51,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:51,733 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2024-10-12 19:42:51,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:42:51,733 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2024-10-12 19:42:51,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 19:42:51,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:51,734 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:42:51,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:42:51,734 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:51,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:51,735 INFO L85 PathProgramCache]: Analyzing trace with hash 911150500, now seen corresponding path program 1 times [2024-10-12 19:42:51,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:51,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673782697] [2024-10-12 19:42:51,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:51,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:51,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:42:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:51,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 19:42:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 19:42:51,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:51,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673782697] [2024-10-12 19:42:51,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673782697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:51,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:51,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:42:51,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263572841] [2024-10-12 19:42:51,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:51,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:42:51,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:51,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:42:51,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:42:51,824 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:42:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:51,990 INFO L93 Difference]: Finished difference Result 271 states and 375 transitions. [2024-10-12 19:42:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:42:51,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-12 19:42:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:51,992 INFO L225 Difference]: With dead ends: 271 [2024-10-12 19:42:51,992 INFO L226 Difference]: Without dead ends: 173 [2024-10-12 19:42:51,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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-10-12 19:42:51,993 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 53 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:51,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 255 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:42:51,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-12 19:42:52,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-10-12 19:42:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 128 states have (on average 1.3828125) internal successors, (177), 141 states have internal predecessors, (177), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2024-10-12 19:42:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 229 transitions. [2024-10-12 19:42:52,031 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 229 transitions. Word has length 29 [2024-10-12 19:42:52,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:52,031 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 229 transitions. [2024-10-12 19:42:52,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:42:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 229 transitions. [2024-10-12 19:42:52,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 19:42:52,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:52,033 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:42:52,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:42:52,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:52,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:52,034 INFO L85 PathProgramCache]: Analyzing trace with hash 844412357, now seen corresponding path program 1 times [2024-10-12 19:42:52,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:52,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900634122] [2024-10-12 19:42:52,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:52,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:52,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:42:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:52,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:42:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:42:52,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:52,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900634122] [2024-10-12 19:42:52,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900634122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:52,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:52,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:42:52,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687679504] [2024-10-12 19:42:52,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:52,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:42:52,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:52,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:42:52,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:42:52,123 INFO L87 Difference]: Start difference. First operand 173 states and 229 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:42:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:52,160 INFO L93 Difference]: Finished difference Result 348 states and 470 transitions. [2024-10-12 19:42:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:42:52,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-10-12 19:42:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:52,164 INFO L225 Difference]: With dead ends: 348 [2024-10-12 19:42:52,164 INFO L226 Difference]: Without dead ends: 177 [2024-10-12 19:42:52,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:42:52,166 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:52,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:42:52,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-12 19:42:52,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-10-12 19:42:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 132 states have (on average 1.371212121212121) internal successors, (181), 145 states have internal predecessors, (181), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2024-10-12 19:42:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 233 transitions. [2024-10-12 19:42:52,208 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 233 transitions. Word has length 35 [2024-10-12 19:42:52,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:52,208 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 233 transitions. [2024-10-12 19:42:52,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:42:52,212 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 233 transitions. [2024-10-12 19:42:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 19:42:52,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:52,213 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:42:52,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:42:52,213 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:52,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:52,213 INFO L85 PathProgramCache]: Analyzing trace with hash -435451321, now seen corresponding path program 1 times [2024-10-12 19:42:52,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:52,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114641639] [2024-10-12 19:42:52,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:52,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:52,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:42:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:52,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:42:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:52,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:42:52,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:52,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114641639] [2024-10-12 19:42:52,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114641639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:52,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:52,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:42:52,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954333164] [2024-10-12 19:42:52,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:52,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:42:52,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:52,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:42:52,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:42:52,331 INFO L87 Difference]: Start difference. First operand 177 states and 233 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:42:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:52,392 INFO L93 Difference]: Finished difference Result 361 states and 483 transitions. [2024-10-12 19:42:52,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:42:52,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-10-12 19:42:52,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:52,394 INFO L225 Difference]: With dead ends: 361 [2024-10-12 19:42:52,394 INFO L226 Difference]: Without dead ends: 186 [2024-10-12 19:42:52,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:42:52,395 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 58 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:52,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 234 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:42:52,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-12 19:42:52,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 181. [2024-10-12 19:42:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 136 states have (on average 1.3602941176470589) internal successors, (185), 149 states have internal predecessors, (185), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2024-10-12 19:42:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 237 transitions. [2024-10-12 19:42:52,407 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 237 transitions. Word has length 35 [2024-10-12 19:42:52,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:52,407 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 237 transitions. [2024-10-12 19:42:52,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:42:52,407 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 237 transitions. [2024-10-12 19:42:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 19:42:52,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:52,408 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:42:52,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:42:52,409 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:52,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:52,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2023799223, now seen corresponding path program 1 times [2024-10-12 19:42:52,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:52,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328840539] [2024-10-12 19:42:52,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:52,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:52,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:42:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:52,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:42:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:42:52,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:52,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328840539] [2024-10-12 19:42:52,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328840539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:52,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:52,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:42:52,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418367399] [2024-10-12 19:42:52,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:52,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:42:52,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:52,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:42:52,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:42:52,467 INFO L87 Difference]: Start difference. First operand 181 states and 237 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:42:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:52,523 INFO L93 Difference]: Finished difference Result 513 states and 699 transitions. [2024-10-12 19:42:52,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:42:52,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-10-12 19:42:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:52,526 INFO L225 Difference]: With dead ends: 513 [2024-10-12 19:42:52,527 INFO L226 Difference]: Without dead ends: 334 [2024-10-12 19:42:52,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:42:52,529 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 45 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:52,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 124 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:42:52,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-12 19:42:52,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2024-10-12 19:42:52,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 247 states have (on average 1.3481781376518218) internal successors, (333), 264 states have internal predecessors, (333), 48 states have call successors, (48), 40 states have call predecessors, (48), 36 states have return successors, (60), 44 states have call predecessors, (60), 48 states have call successors, (60) [2024-10-12 19:42:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 441 transitions. [2024-10-12 19:42:52,559 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 441 transitions. Word has length 35 [2024-10-12 19:42:52,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:52,559 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 441 transitions. [2024-10-12 19:42:52,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:42:52,559 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 441 transitions. [2024-10-12 19:42:52,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 19:42:52,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:52,561 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:42:52,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:42:52,562 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:52,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:52,563 INFO L85 PathProgramCache]: Analyzing trace with hash 384406563, now seen corresponding path program 1 times [2024-10-12 19:42:52,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:52,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756456164] [2024-10-12 19:42:52,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:52,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:52,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:52,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:42:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:42:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:42:52,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:52,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756456164] [2024-10-12 19:42:52,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756456164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:52,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:52,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:42:52,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279566719] [2024-10-12 19:42:52,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:52,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:42:52,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:52,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:42:52,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:42:52,705 INFO L87 Difference]: Start difference. First operand 332 states and 441 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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-10-12 19:42:52,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:52,988 INFO L93 Difference]: Finished difference Result 869 states and 1198 transitions. [2024-10-12 19:42:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:42:52,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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 39 [2024-10-12 19:42:52,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:52,992 INFO L225 Difference]: With dead ends: 869 [2024-10-12 19:42:52,992 INFO L226 Difference]: Without dead ends: 539 [2024-10-12 19:42:52,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:42:52,997 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 147 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:52,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 252 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:42:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-10-12 19:42:53,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 537. [2024-10-12 19:42:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 405 states have (on average 1.3111111111111111) internal successors, (531), 437 states have internal predecessors, (531), 72 states have call successors, (72), 55 states have call predecessors, (72), 59 states have return successors, (113), 68 states have call predecessors, (113), 72 states have call successors, (113) [2024-10-12 19:42:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 716 transitions. [2024-10-12 19:42:53,043 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 716 transitions. Word has length 39 [2024-10-12 19:42:53,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:53,044 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 716 transitions. [2024-10-12 19:42:53,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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-10-12 19:42:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 716 transitions. [2024-10-12 19:42:53,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 19:42:53,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:53,046 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:53,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:42:53,046 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:53,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:53,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1519866038, now seen corresponding path program 1 times [2024-10-12 19:42:53,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:53,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369964290] [2024-10-12 19:42:53,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:53,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:53,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:53,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:42:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:53,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:42:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:53,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 19:42:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:53,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:42:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 19:42:53,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:53,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369964290] [2024-10-12 19:42:53,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369964290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:53,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:53,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:42:53,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478741768] [2024-10-12 19:42:53,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:53,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:42:53,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:53,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:42:53,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:42:53,137 INFO L87 Difference]: Start difference. First operand 537 states and 716 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 19:42:53,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:53,339 INFO L93 Difference]: Finished difference Result 644 states and 855 transitions. [2024-10-12 19:42:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:42:53,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 63 [2024-10-12 19:42:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:53,342 INFO L225 Difference]: With dead ends: 644 [2024-10-12 19:42:53,342 INFO L226 Difference]: Without dead ends: 262 [2024-10-12 19:42:53,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:42:53,344 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 158 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:53,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 209 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:42:53,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-12 19:42:53,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2024-10-12 19:42:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 195 states have (on average 1.2615384615384615) internal successors, (246), 211 states have internal predecessors, (246), 35 states have call successors, (35), 27 states have call predecessors, (35), 29 states have return successors, (54), 33 states have call predecessors, (54), 35 states have call successors, (54) [2024-10-12 19:42:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 335 transitions. [2024-10-12 19:42:53,368 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 335 transitions. Word has length 63 [2024-10-12 19:42:53,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:53,368 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 335 transitions. [2024-10-12 19:42:53,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 19:42:53,368 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 335 transitions. [2024-10-12 19:42:53,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 19:42:53,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:53,369 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-12 19:42:53,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:42:53,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:53,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:53,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1365866285, now seen corresponding path program 1 times [2024-10-12 19:42:53,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:53,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034301479] [2024-10-12 19:42:53,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:53,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:53,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:53,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:42:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:53,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:42:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:53,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:42:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:53,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:42:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:53,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:42:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:42:53,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:53,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034301479] [2024-10-12 19:42:53,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034301479] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:42:53,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585180898] [2024-10-12 19:42:53,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:53,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:42:53,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:42:53,502 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:42:53,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 19:42:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:53,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 19:42:53,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:42:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:42:53,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:42:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:42:53,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585180898] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:42:53,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:42:53,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 14 [2024-10-12 19:42:53,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379732430] [2024-10-12 19:42:53,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:42:53,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 19:42:53,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:53,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 19:42:53,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:42:53,855 INFO L87 Difference]: Start difference. First operand 260 states and 335 transitions. Second operand has 14 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2024-10-12 19:42:54,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:54,397 INFO L93 Difference]: Finished difference Result 516 states and 682 transitions. [2024-10-12 19:42:54,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 19:42:54,398 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) Word has length 65 [2024-10-12 19:42:54,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:54,399 INFO L225 Difference]: With dead ends: 516 [2024-10-12 19:42:54,399 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 19:42:54,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 139 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2024-10-12 19:42:54,401 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 216 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:54,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 461 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:42:54,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 19:42:54,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 19:42:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:42:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 19:42:54,402 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2024-10-12 19:42:54,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:54,403 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 19:42:54,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2024-10-12 19:42:54,403 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 19:42:54,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 19:42:54,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:42:54,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 19:42:54,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-12 19:42:54,612 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:54,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 19:42:56,765 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:42:56,785 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|) (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse0 (= |old(~pumpRunning~0)| 0)) (.cse1 (<= |old(~waterLevel~0)| 2)) (.cse2 (= 1 ~systemActive~0)) (.cse3 (<= 1 |old(~pumpRunning~0)|))) (or (and .cse0 (= 0 ~systemActive~0) .cse1) (and .cse2 (<= 1 |old(~switchedOnBeforeTS~0)|) .cse1 .cse3) (and .cse2 .cse0 .cse1) (and .cse2 .cse3 (= |old(~waterLevel~0)| 2))))) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= 1 ~systemActive~0)) (.cse3 (= ~pumpRunning~0 0)) (.cse2 (<= ~waterLevel~0 2))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and .cse0 .cse1 .cse2 (<= 1 ~switchedOnBeforeTS~0)) (and .cse3 .cse1 .cse2) (and .cse3 .cse2 (= 0 ~systemActive~0)))) [2024-10-12 19:42:56,794 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse3 (= ~pumpRunning~0 0)) (.cse2 (<= |old(~waterLevel~0)| 2)) (.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 (<= 1 ~switchedOnBeforeTS~0) .cse2) (and .cse3 .cse1 .cse2) (and .cse3 (= 0 ~systemActive~0) .cse2) (and .cse0 .cse1 (= |old(~waterLevel~0)| 2))))) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= 1 ~systemActive~0)) (.cse3 (= ~pumpRunning~0 0)) (.cse2 (<= ~waterLevel~0 2))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and .cse0 .cse1 .cse2 (<= 1 ~switchedOnBeforeTS~0)) (and .cse3 .cse1 .cse2) (and .cse3 .cse2 (= 0 ~systemActive~0)))) [2024-10-12 19:42:56,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:42:56 BoogieIcfgContainer [2024-10-12 19:42:56,801 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:42:56,802 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:42:56,802 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:42:56,802 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:42:56,803 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:42:51" (3/4) ... [2024-10-12 19:42:56,804 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 19:42:56,807 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-12 19:42:56,807 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-12 19:42:56,807 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-12 19:42:56,807 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-12 19:42:56,807 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-12 19:42:56,807 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2024-10-12 19:42:56,811 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2024-10-12 19:42:56,812 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-12 19:42:56,812 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-12 19:42:56,812 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:42:56,813 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:42:56,904 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:42:56,905 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 19:42:56,905 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:42:56,905 INFO L158 Benchmark]: Toolchain (without parser) took 6831.57ms. Allocated memory was 230.7MB in the beginning and 310.4MB in the end (delta: 79.7MB). Free memory was 159.7MB in the beginning and 170.2MB in the end (delta: -10.5MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2024-10-12 19:42:56,907 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:42:56,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.16ms. Allocated memory is still 230.7MB. Free memory was 159.4MB in the beginning and 138.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-12 19:42:56,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.59ms. Allocated memory is still 230.7MB. Free memory was 138.4MB in the beginning and 135.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:42:56,907 INFO L158 Benchmark]: Boogie Preprocessor took 107.97ms. Allocated memory is still 230.7MB. Free memory was 135.9MB in the beginning and 200.9MB in the end (delta: -65.0MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2024-10-12 19:42:56,907 INFO L158 Benchmark]: RCFGBuilder took 423.95ms. Allocated memory is still 230.7MB. Free memory was 199.9MB in the beginning and 175.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-12 19:42:56,908 INFO L158 Benchmark]: TraceAbstraction took 5755.04ms. Allocated memory was 230.7MB in the beginning and 310.4MB in the end (delta: 79.7MB). Free memory was 175.8MB in the beginning and 177.5MB in the end (delta: -1.8MB). Peak memory consumption was 156.6MB. Max. memory is 16.1GB. [2024-10-12 19:42:56,908 INFO L158 Benchmark]: Witness Printer took 102.95ms. Allocated memory is still 310.4MB. Free memory was 177.5MB in the beginning and 170.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 19:42:56,911 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 115.3MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.16ms. Allocated memory is still 230.7MB. Free memory was 159.4MB in the beginning and 138.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.59ms. Allocated memory is still 230.7MB. Free memory was 138.4MB in the beginning and 135.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.97ms. Allocated memory is still 230.7MB. Free memory was 135.9MB in the beginning and 200.9MB in the end (delta: -65.0MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * RCFGBuilder took 423.95ms. Allocated memory is still 230.7MB. Free memory was 199.9MB in the beginning and 175.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5755.04ms. Allocated memory was 230.7MB in the beginning and 310.4MB in the end (delta: 79.7MB). Free memory was 175.8MB in the beginning and 177.5MB in the end (delta: -1.8MB). Peak memory consumption was 156.6MB. Max. memory is 16.1GB. * Witness Printer took 102.95ms. Allocated memory is still 310.4MB. Free memory was 177.5MB in the beginning and 170.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [415] - GenericResultAtLocation [Line: 521]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [521] - GenericResultAtLocation [Line: 589]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [589] - GenericResultAtLocation [Line: 786]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [786] - GenericResultAtLocation [Line: 881]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [881] - GenericResultAtLocation [Line: 931]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [931] - GenericResultAtLocation [Line: 966]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [966] * 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: 971]: 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 7 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 768 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 747 mSDsluCounter, 2014 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1309 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1123 IncrementalHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 705 mSDtfsCounter, 1123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 202 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=537occurred in iteration=8, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 437 NumberOfCodeBlocks, 437 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 490 ConstructedInterpolants, 0 QuantifiedInterpolants, 965 SizeOfPredicates, 2 NumberOfNonLiveVariables, 253 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 84/106 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: 428]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: ((((((((pumpRunning == 0) && (splverifierCounter == 0)) && (waterLevel <= 2)) && (0 == systemActive)) || ((((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((1 <= pumpRunning) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 532]: Location Invariant Derived location invariant: 0 - ProcedureContractResult [Line: 629]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) Ensures: (((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) - ProcedureContractResult [Line: 814]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) || (((pumpRunning == 0) && (waterLevel <= 2)) && (0 == systemActive))) Ensures: ((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) || (((pumpRunning == 0) && (waterLevel <= 2)) && (0 == systemActive))) - ProcedureContractResult [Line: 602]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: ((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) || (((pumpRunning == 0) && (waterLevel <= 2)) && (0 == systemActive))) Ensures: (((((((1 < \old(waterLevel)) || (waterLevel < 2)) && ((\old(pumpRunning) < 1) || (((1 <= pumpRunning) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)))) && ((((\old(pumpRunning) != 0) || ((1 <= pumpRunning) && (2 == waterLevel))) || ((pumpRunning == 0) && (2 == waterLevel))) || (\old(waterLevel) != 2))) && ((pumpRunning == 0) || (0 != systemActive))) && (((1 < \old(waterLevel)) || (\old(pumpRunning) != 0)) || ((pumpRunning == 0) && (\old(waterLevel) == waterLevel)))) && ((((((\old(pumpRunning) == 0) && (0 == systemActive)) && (\old(waterLevel) <= 2)) || ((((1 == systemActive) && (1 <= \old(switchedOnBeforeTS))) && (\old(waterLevel) <= 2)) && (1 <= \old(pumpRunning)))) || (((1 == systemActive) && (\old(pumpRunning) == 0)) && (\old(waterLevel) <= 2))) || (((1 == systemActive) && (1 <= \old(pumpRunning))) && (\old(waterLevel) == 2)))) - ProcedureContractResult [Line: 418]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 802]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) || (((pumpRunning == 0) && (waterLevel <= 2)) && (0 == systemActive))) Ensures: ((((2 == waterLevel) || (\old(waterLevel) != 2)) && (waterLevel <= 2)) && (((((((1 <= pumpRunning) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)) && (\old(waterLevel) <= 2)) || (((pumpRunning == 0) && (1 == systemActive)) && (\old(waterLevel) <= 2))) || (((pumpRunning == 0) && (0 == systemActive)) && (\old(waterLevel) <= 2))) || (((1 <= pumpRunning) && (1 == systemActive)) && (\old(waterLevel) == 2)))) - ProcedureContractResult [Line: 707]: Procedure Contract for isPumpRunning Derived contract for procedure isPumpRunning. Requires: ((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) || (((pumpRunning == 0) && (waterLevel <= 2)) && (0 == systemActive))) Ensures: (((pumpRunning == \result) && ((\result == 0) || (0 != systemActive))) && ((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) || ((waterLevel <= 2) && (0 == systemActive)))) RESULT: Ultimate proved your program to be correct! [2024-10-12 19:42:56,934 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