./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product61.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product61.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 f250833677b07ed1377ed852c7268af3b652ab26de7f7fe1fca27ae75baf167f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:38:58,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:38:58,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:38:58,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:38:58,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:38:58,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:38:58,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:38:58,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:38:58,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:38:58,537 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:38:58,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:38:58,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:38:58,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:38:58,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:38:58,538 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:38:58,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:38:58,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:38:58,538 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:38:58,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:38:58,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:38:58,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:38:58,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:38:58,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:38:58,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:38:58,539 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:38:58,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:38:58,539 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:38:58,539 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:38:58,539 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:38:58,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:38:58,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:38:58,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:38:58,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:38:58,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:38:58,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:38:58,540 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:38:58,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:38:58,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:38:58,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:38:58,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:38:58,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:38:58,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:38:58,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:38:58,541 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> f250833677b07ed1377ed852c7268af3b652ab26de7f7fe1fca27ae75baf167f [2025-03-08 05:38:58,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:38:58,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:38:58,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:38:58,781 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:38:58,782 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:38:58,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product61.cil.c [2025-03-08 05:38:59,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fa63429/03d522837fc248cbaceea01d9641e209/FLAG068000aad [2025-03-08 05:39:00,224 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:39:00,229 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product61.cil.c [2025-03-08 05:39:00,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fa63429/03d522837fc248cbaceea01d9641e209/FLAG068000aad [2025-03-08 05:39:00,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fa63429/03d522837fc248cbaceea01d9641e209 [2025-03-08 05:39:00,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:39:00,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:39:00,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:39:00,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:39:00,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:39:00,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:39:00" (1/1) ... [2025-03-08 05:39:00,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c121e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:00, skipping insertion in model container [2025-03-08 05:39:00,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:39:00" (1/1) ... [2025-03-08 05:39:00,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:39:00,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product61.cil.c[3777,3790] [2025-03-08 05:39:00,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:39:00,761 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:39:00,767 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2025-03-08 05:39:00,768 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [87] [2025-03-08 05:39:00,768 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [198] [2025-03-08 05:39:00,768 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [207] [2025-03-08 05:39:00,768 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [234] [2025-03-08 05:39:00,768 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [333] [2025-03-08 05:39:00,768 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [575] [2025-03-08 05:39:00,768 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [640] [2025-03-08 05:39:00,775 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product61.cil.c[3777,3790] [2025-03-08 05:39:00,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:39:00,813 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:39:00,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:00 WrapperNode [2025-03-08 05:39:00,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:39:00,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:39:00,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:39:00,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:39:00,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:00" (1/1) ... [2025-03-08 05:39:00,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:00" (1/1) ... [2025-03-08 05:39:00,838 INFO L138 Inliner]: procedures = 57, calls = 104, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 212 [2025-03-08 05:39:00,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:39:00,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:39:00,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:39:00,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:39:00,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:00" (1/1) ... [2025-03-08 05:39:00,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:00" (1/1) ... [2025-03-08 05:39:00,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:00" (1/1) ... [2025-03-08 05:39:00,855 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]. [2025-03-08 05:39:00,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:00" (1/1) ... [2025-03-08 05:39:00,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:00" (1/1) ... [2025-03-08 05:39:00,863 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:00" (1/1) ... [2025-03-08 05:39:00,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:00" (1/1) ... [2025-03-08 05:39:00,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:00" (1/1) ... [2025-03-08 05:39:00,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:00" (1/1) ... [2025-03-08 05:39:00,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:39:00,868 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:39:00,868 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:39:00,868 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:39:00,869 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:00" (1/1) ... [2025-03-08 05:39:00,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:39:00,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:39:00,906 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) [2025-03-08 05:39:00,915 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 [2025-03-08 05:39:00,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-03-08 05:39:00,930 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-03-08 05:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:39:00,930 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:39:00,930 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-03-08 05:39:00,930 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-03-08 05:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-03-08 05:39:00,930 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-03-08 05:39:00,930 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-03-08 05:39:00,930 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-03-08 05:39:00,931 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2025-03-08 05:39:00,931 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2025-03-08 05:39:00,931 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2025-03-08 05:39:00,931 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2025-03-08 05:39:00,931 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-03-08 05:39:00,931 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-03-08 05:39:00,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:39:00,931 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-03-08 05:39:00,931 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-03-08 05:39:00,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:39:00,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:39:00,998 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:39:01,000 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:39:01,048 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L572-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~10#1; [2025-03-08 05:39:01,048 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L195-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~5#1; [2025-03-08 05:39:01,085 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L498-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~8#1; [2025-03-08 05:39:01,106 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L140: #res := ~retValue_acc~2; [2025-03-08 05:39:01,161 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L84-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-08 05:39:01,161 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L330-1: main_#res#1 := main_~retValue_acc~6#1; [2025-03-08 05:39:01,196 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L186-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~4#1; [2025-03-08 05:39:01,196 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L553-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~9#1; [2025-03-08 05:39:01,203 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L489: #res := ~retValue_acc~7; [2025-03-08 05:39:01,221 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2025-03-08 05:39:01,222 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:39:01,229 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:39:01,229 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:39:01,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:39:01 BoogieIcfgContainer [2025-03-08 05:39:01,229 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:39:01,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:39:01,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:39:01,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:39:01,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:39:00" (1/3) ... [2025-03-08 05:39:01,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454e3fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:39:01, skipping insertion in model container [2025-03-08 05:39:01,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:00" (2/3) ... [2025-03-08 05:39:01,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454e3fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:39:01, skipping insertion in model container [2025-03-08 05:39:01,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:39:01" (3/3) ... [2025-03-08 05:39:01,236 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product61.cil.c [2025-03-08 05:39:01,246 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:39:01,248 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec1_product61.cil.c that has 11 procedures, 105 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 05:39:01,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:39:01,294 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;@2e98480f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:39:01,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:39:01,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 75 states have (on average 1.36) internal successors, (102), 85 states have internal predecessors, (102), 18 states have call successors, (18), 10 states have call predecessors, (18), 10 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 05:39:01,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 05:39:01,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:01,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:01,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:01,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:01,306 INFO L85 PathProgramCache]: Analyzing trace with hash -977653738, now seen corresponding path program 1 times [2025-03-08 05:39:01,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:01,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527980632] [2025-03-08 05:39:01,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:01,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:01,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:39:01,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:39:01,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:01,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:39:01,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:01,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527980632] [2025-03-08 05:39:01,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527980632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:01,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:01,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:39:01,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520877805] [2025-03-08 05:39:01,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:01,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:39:01,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:01,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:39:01,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:39:01,582 INFO L87 Difference]: Start difference. First operand has 105 states, 75 states have (on average 1.36) internal successors, (102), 85 states have internal predecessors, (102), 18 states have call successors, (18), 10 states have call predecessors, (18), 10 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:39:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:01,626 INFO L93 Difference]: Finished difference Result 190 states and 252 transitions. [2025-03-08 05:39:01,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:39:01,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-08 05:39:01,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:01,634 INFO L225 Difference]: With dead ends: 190 [2025-03-08 05:39:01,635 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 05:39:01,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:39:01,641 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 11 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:01,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 220 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:01,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 05:39:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-08 05:39:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 72 states have internal predecessors, (84), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 05:39:01,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2025-03-08 05:39:01,682 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 23 [2025-03-08 05:39:01,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:01,683 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2025-03-08 05:39:01,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:39:01,683 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2025-03-08 05:39:01,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 05:39:01,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:01,686 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:01,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:39:01,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:01,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:01,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1163167039, now seen corresponding path program 1 times [2025-03-08 05:39:01,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:01,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311550096] [2025-03-08 05:39:01,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:01,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:01,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 05:39:01,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 05:39:01,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:01,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:39:01,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:01,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311550096] [2025-03-08 05:39:01,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311550096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:01,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:01,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:39:01,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991023115] [2025-03-08 05:39:01,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:01,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:39:01,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:01,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:39:01,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:39:01,836 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:39:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:01,975 INFO L93 Difference]: Finished difference Result 169 states and 222 transitions. [2025-03-08 05:39:01,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:39:01,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-08 05:39:01,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:01,976 INFO L225 Difference]: With dead ends: 169 [2025-03-08 05:39:01,976 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 05:39:01,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:39:01,978 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 110 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:01,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 266 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:39:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 05:39:01,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-08 05:39:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 72 states have internal predecessors, (83), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 05:39:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2025-03-08 05:39:02,013 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 26 [2025-03-08 05:39:02,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:02,015 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2025-03-08 05:39:02,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:39:02,016 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2025-03-08 05:39:02,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 05:39:02,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:02,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:02,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:39:02,018 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:02,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:02,019 INFO L85 PathProgramCache]: Analyzing trace with hash 250387685, now seen corresponding path program 1 times [2025-03-08 05:39:02,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:02,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935459056] [2025-03-08 05:39:02,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:02,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:02,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 05:39:02,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 05:39:02,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:02,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:02,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:39:02,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:02,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935459056] [2025-03-08 05:39:02,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935459056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:02,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:02,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:39:02,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099317655] [2025-03-08 05:39:02,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:02,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:39:02,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:02,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:39:02,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:39:02,134 INFO L87 Difference]: Start difference. First operand 88 states and 113 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 05:39:02,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:02,381 INFO L93 Difference]: Finished difference Result 252 states and 321 transitions. [2025-03-08 05:39:02,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:39:02,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 41 [2025-03-08 05:39:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:02,383 INFO L225 Difference]: With dead ends: 252 [2025-03-08 05:39:02,383 INFO L226 Difference]: Without dead ends: 171 [2025-03-08 05:39:02,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:39:02,384 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 207 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:02,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 280 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:39:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-08 05:39:02,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 165. [2025-03-08 05:39:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 119 states have (on average 1.2436974789915967) internal successors, (148), 128 states have internal predecessors, (148), 22 states have call successors, (22), 18 states have call predecessors, (22), 23 states have return successors, (29), 24 states have call predecessors, (29), 22 states have call successors, (29) [2025-03-08 05:39:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 199 transitions. [2025-03-08 05:39:02,409 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 199 transitions. Word has length 41 [2025-03-08 05:39:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:02,410 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 199 transitions. [2025-03-08 05:39:02,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 05:39:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 199 transitions. [2025-03-08 05:39:02,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 05:39:02,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:02,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:02,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:39:02,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:02,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:02,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1281829665, now seen corresponding path program 1 times [2025-03-08 05:39:02,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:02,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37089914] [2025-03-08 05:39:02,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:02,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:02,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 05:39:02,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 05:39:02,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:02,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:39:02,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:02,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37089914] [2025-03-08 05:39:02,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37089914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:02,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:02,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:39:02,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096233401] [2025-03-08 05:39:02,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:02,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:39:02,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:02,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:39:02,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:39:02,529 INFO L87 Difference]: Start difference. First operand 165 states and 199 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 05:39:02,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:02,648 INFO L93 Difference]: Finished difference Result 576 states and 734 transitions. [2025-03-08 05:39:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:39:02,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 47 [2025-03-08 05:39:02,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:02,651 INFO L225 Difference]: With dead ends: 576 [2025-03-08 05:39:02,651 INFO L226 Difference]: Without dead ends: 418 [2025-03-08 05:39:02,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:39:02,657 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 159 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:02,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 338 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:39:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-08 05:39:02,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 409. [2025-03-08 05:39:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 295 states have (on average 1.2474576271186442) internal successors, (368), 315 states have internal predecessors, (368), 55 states have call successors, (55), 46 states have call predecessors, (55), 58 states have return successors, (89), 61 states have call predecessors, (89), 55 states have call successors, (89) [2025-03-08 05:39:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 512 transitions. [2025-03-08 05:39:02,730 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 512 transitions. Word has length 47 [2025-03-08 05:39:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:02,731 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 512 transitions. [2025-03-08 05:39:02,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 05:39:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 512 transitions. [2025-03-08 05:39:02,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 05:39:02,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:02,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:02,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:39:02,735 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:02,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:02,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1147816159, now seen corresponding path program 1 times [2025-03-08 05:39:02,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:02,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812758564] [2025-03-08 05:39:02,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:02,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:02,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 05:39:02,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 05:39:02,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:02,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:39:02,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:02,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812758564] [2025-03-08 05:39:02,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812758564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:02,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:02,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:39:02,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690460441] [2025-03-08 05:39:02,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:02,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:39:02,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:02,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:39:02,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:39:02,887 INFO L87 Difference]: Start difference. First operand 409 states and 512 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 05:39:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:03,095 INFO L93 Difference]: Finished difference Result 413 states and 514 transitions. [2025-03-08 05:39:03,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:39:03,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-03-08 05:39:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:03,098 INFO L225 Difference]: With dead ends: 413 [2025-03-08 05:39:03,102 INFO L226 Difference]: Without dead ends: 411 [2025-03-08 05:39:03,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:39:03,103 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 141 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:03,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 353 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:39:03,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-08 05:39:03,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2025-03-08 05:39:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 295 states have (on average 1.230508474576271) internal successors, (363), 315 states have internal predecessors, (363), 55 states have call successors, (55), 46 states have call predecessors, (55), 58 states have return successors, (89), 61 states have call predecessors, (89), 55 states have call successors, (89) [2025-03-08 05:39:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 507 transitions. [2025-03-08 05:39:03,143 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 507 transitions. Word has length 47 [2025-03-08 05:39:03,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:03,144 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 507 transitions. [2025-03-08 05:39:03,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 05:39:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 507 transitions. [2025-03-08 05:39:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 05:39:03,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:03,148 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:03,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:39:03,148 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:03,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:03,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1090659589, now seen corresponding path program 1 times [2025-03-08 05:39:03,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:03,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363093912] [2025-03-08 05:39:03,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:03,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:03,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 05:39:03,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 05:39:03,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:03,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:39:03,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:03,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363093912] [2025-03-08 05:39:03,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363093912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:03,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:03,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:39:03,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094486131] [2025-03-08 05:39:03,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:03,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:39:03,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:03,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:39:03,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:39:03,227 INFO L87 Difference]: Start difference. First operand 409 states and 507 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:39:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:03,271 INFO L93 Difference]: Finished difference Result 820 states and 1051 transitions. [2025-03-08 05:39:03,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:39:03,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2025-03-08 05:39:03,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:03,274 INFO L225 Difference]: With dead ends: 820 [2025-03-08 05:39:03,274 INFO L226 Difference]: Without dead ends: 418 [2025-03-08 05:39:03,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:39:03,278 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:03,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 434 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:03,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-08 05:39:03,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-03-08 05:39:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 304 states have (on average 1.2236842105263157) internal successors, (372), 324 states have internal predecessors, (372), 55 states have call successors, (55), 46 states have call predecessors, (55), 58 states have return successors, (89), 61 states have call predecessors, (89), 55 states have call successors, (89) [2025-03-08 05:39:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 516 transitions. [2025-03-08 05:39:03,326 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 516 transitions. Word has length 57 [2025-03-08 05:39:03,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:03,326 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 516 transitions. [2025-03-08 05:39:03,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:39:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 516 transitions. [2025-03-08 05:39:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 05:39:03,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:03,328 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:03,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:39:03,329 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:03,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:03,330 INFO L85 PathProgramCache]: Analyzing trace with hash -919444252, now seen corresponding path program 1 times [2025-03-08 05:39:03,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:03,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928605771] [2025-03-08 05:39:03,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:03,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:03,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 05:39:03,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 05:39:03,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:03,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:39:03,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:03,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928605771] [2025-03-08 05:39:03,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928605771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:03,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:03,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:39:03,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168675448] [2025-03-08 05:39:03,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:03,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:39:03,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:03,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:39:03,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:39:03,390 INFO L87 Difference]: Start difference. First operand 418 states and 516 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:39:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:03,430 INFO L93 Difference]: Finished difference Result 753 states and 950 transitions. [2025-03-08 05:39:03,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:39:03,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2025-03-08 05:39:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:03,433 INFO L225 Difference]: With dead ends: 753 [2025-03-08 05:39:03,433 INFO L226 Difference]: Without dead ends: 342 [2025-03-08 05:39:03,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:39:03,437 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:03,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:03,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-08 05:39:03,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-03-08 05:39:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 248 states have (on average 1.2096774193548387) internal successors, (300), 264 states have internal predecessors, (300), 46 states have call successors, (46), 39 states have call predecessors, (46), 47 states have return successors, (70), 49 states have call predecessors, (70), 46 states have call successors, (70) [2025-03-08 05:39:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 416 transitions. [2025-03-08 05:39:03,461 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 416 transitions. Word has length 57 [2025-03-08 05:39:03,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:03,461 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 416 transitions. [2025-03-08 05:39:03,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:39:03,462 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 416 transitions. [2025-03-08 05:39:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 05:39:03,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:03,463 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:03,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:39:03,463 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:03,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:03,463 INFO L85 PathProgramCache]: Analyzing trace with hash 881481696, now seen corresponding path program 1 times [2025-03-08 05:39:03,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:03,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725557358] [2025-03-08 05:39:03,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:03,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:03,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 05:39:03,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 05:39:03,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:03,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:39:03,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:03,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725557358] [2025-03-08 05:39:03,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725557358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:03,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:03,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:39:03,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615152044] [2025-03-08 05:39:03,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:03,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:39:03,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:03,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:39:03,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:39:03,588 INFO L87 Difference]: Start difference. First operand 342 states and 416 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:39:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:03,820 INFO L93 Difference]: Finished difference Result 974 states and 1232 transitions. [2025-03-08 05:39:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:39:03,820 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2025-03-08 05:39:03,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:03,823 INFO L225 Difference]: With dead ends: 974 [2025-03-08 05:39:03,823 INFO L226 Difference]: Without dead ends: 639 [2025-03-08 05:39:03,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:39:03,824 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 92 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:03,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 778 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:39:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-03-08 05:39:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2025-03-08 05:39:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 457 states have (on average 1.1859956236323852) internal successors, (542), 486 states have internal predecessors, (542), 91 states have call successors, (91), 77 states have call predecessors, (91), 90 states have return successors, (144), 95 states have call predecessors, (144), 91 states have call successors, (144) [2025-03-08 05:39:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 777 transitions. [2025-03-08 05:39:03,861 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 777 transitions. Word has length 61 [2025-03-08 05:39:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:03,861 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 777 transitions. [2025-03-08 05:39:03,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 05:39:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 777 transitions. [2025-03-08 05:39:03,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 05:39:03,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:03,863 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:03,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:39:03,863 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:03,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:03,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1527050797, now seen corresponding path program 1 times [2025-03-08 05:39:03,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:03,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462310516] [2025-03-08 05:39:03,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:03,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:03,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:39:03,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:39:03,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:03,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:39:04,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:04,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462310516] [2025-03-08 05:39:04,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462310516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:39:04,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22148806] [2025-03-08 05:39:04,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:04,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:04,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:39:04,052 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) [2025-03-08 05:39:04,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:39:04,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:39:04,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:39:04,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:04,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:04,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 05:39:04,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:39:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:39:04,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:39:04,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22148806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:04,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:39:04,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2025-03-08 05:39:04,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700180003] [2025-03-08 05:39:04,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:04,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:39:04,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:04,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:39:04,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:39:04,327 INFO L87 Difference]: Start difference. First operand 639 states and 777 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:39:04,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:04,502 INFO L93 Difference]: Finished difference Result 1271 states and 1547 transitions. [2025-03-08 05:39:04,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:39:04,502 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2025-03-08 05:39:04,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:04,508 INFO L225 Difference]: With dead ends: 1271 [2025-03-08 05:39:04,508 INFO L226 Difference]: Without dead ends: 639 [2025-03-08 05:39:04,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:39:04,510 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 70 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:04,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1141 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:39:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-03-08 05:39:04,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2025-03-08 05:39:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 457 states have (on average 1.1728665207877462) internal successors, (536), 486 states have internal predecessors, (536), 91 states have call successors, (91), 77 states have call predecessors, (91), 90 states have return successors, (131), 95 states have call predecessors, (131), 91 states have call successors, (131) [2025-03-08 05:39:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 758 transitions. [2025-03-08 05:39:04,550 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 758 transitions. Word has length 125 [2025-03-08 05:39:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:04,550 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 758 transitions. [2025-03-08 05:39:04,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:39:04,551 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 758 transitions. [2025-03-08 05:39:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:39:04,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:04,554 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:04,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:39:04,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:04,755 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:04,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:04,755 INFO L85 PathProgramCache]: Analyzing trace with hash -173309612, now seen corresponding path program 1 times [2025-03-08 05:39:04,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:04,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008191199] [2025-03-08 05:39:04,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:04,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:04,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:39:04,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:39:04,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:04,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:39:04,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:04,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008191199] [2025-03-08 05:39:04,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008191199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:39:04,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096797928] [2025-03-08 05:39:04,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:04,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:04,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:39:04,882 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:39:04,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:39:04,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:39:04,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:39:04,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:04,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:04,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:39:04,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:39:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:39:05,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:39:05,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096797928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:05,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:39:05,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-08 05:39:05,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555433713] [2025-03-08 05:39:05,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:05,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:39:05,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:05,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:39:05,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:39:05,045 INFO L87 Difference]: Start difference. First operand 639 states and 758 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:39:05,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:05,335 INFO L93 Difference]: Finished difference Result 1301 states and 1586 transitions. [2025-03-08 05:39:05,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:39:05,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 121 [2025-03-08 05:39:05,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:05,340 INFO L225 Difference]: With dead ends: 1301 [2025-03-08 05:39:05,340 INFO L226 Difference]: Without dead ends: 765 [2025-03-08 05:39:05,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:39:05,342 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 151 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:05,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 253 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:39:05,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-03-08 05:39:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 763. [2025-03-08 05:39:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 546 states have (on average 1.1776556776556777) internal successors, (643), 579 states have internal predecessors, (643), 110 states have call successors, (110), 96 states have call predecessors, (110), 106 states have return successors, (166), 112 states have call predecessors, (166), 110 states have call successors, (166) [2025-03-08 05:39:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 919 transitions. [2025-03-08 05:39:05,411 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 919 transitions. Word has length 121 [2025-03-08 05:39:05,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:05,411 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 919 transitions. [2025-03-08 05:39:05,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:39:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 919 transitions. [2025-03-08 05:39:05,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:39:05,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:05,414 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:05,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:39:05,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:39:05,615 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:05,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:05,616 INFO L85 PathProgramCache]: Analyzing trace with hash 751394326, now seen corresponding path program 1 times [2025-03-08 05:39:05,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:05,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076154739] [2025-03-08 05:39:05,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:05,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:05,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:39:05,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:39:05,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:05,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 05:39:05,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:05,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076154739] [2025-03-08 05:39:05,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076154739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:39:05,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249164321] [2025-03-08 05:39:05,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:05,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:05,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:39:05,776 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:39:05,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:39:05,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:39:05,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:39:05,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:05,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:05,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 05:39:05,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:39:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:39:05,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:39:05,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249164321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:05,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:39:05,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-03-08 05:39:05,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186332383] [2025-03-08 05:39:05,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:05,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:39:05,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:05,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:39:05,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:39:05,955 INFO L87 Difference]: Start difference. First operand 763 states and 919 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:39:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:06,097 INFO L93 Difference]: Finished difference Result 1327 states and 1620 transitions. [2025-03-08 05:39:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:39:06,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2025-03-08 05:39:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:06,098 INFO L225 Difference]: With dead ends: 1327 [2025-03-08 05:39:06,098 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 05:39:06,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:39:06,103 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 61 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:39:06,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1109 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:39:06,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 05:39:06,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 05:39:06,105 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) [2025-03-08 05:39:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 05:39:06,106 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2025-03-08 05:39:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:06,107 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 05:39:06,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:39:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 05:39:06,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 05:39:06,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:39:06,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:39:06,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:39:06,316 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:39:06,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 05:39:09,341 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:39:09,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:39:09 BoogieIcfgContainer [2025-03-08 05:39:09,349 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:39:09,350 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:39:09,350 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:39:09,350 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:39:09,350 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:39:01" (3/4) ... [2025-03-08 05:39:09,352 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 05:39:09,356 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2025-03-08 05:39:09,356 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-03-08 05:39:09,356 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-03-08 05:39:09,356 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-03-08 05:39:09,356 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-03-08 05:39:09,356 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-03-08 05:39:09,356 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-03-08 05:39:09,356 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-03-08 05:39:09,356 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__methaneQuery [2025-03-08 05:39:09,357 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneAlarm [2025-03-08 05:39:09,361 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-03-08 05:39:09,362 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-08 05:39:09,363 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 05:39:09,363 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:39:09,364 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:39:09,444 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:39:09,444 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:39:09,444 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:39:09,445 INFO L158 Benchmark]: Toolchain (without parser) took 8934.15ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 131.9MB in the beginning and 229.9MB in the end (delta: -98.0MB). Peak memory consumption was 156.8MB. Max. memory is 16.1GB. [2025-03-08 05:39:09,446 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:39:09,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.99ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 112.8MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:39:09,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.84ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 110.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:39:09,447 INFO L158 Benchmark]: Boogie Preprocessor took 28.38ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:39:09,447 INFO L158 Benchmark]: IcfgBuilder took 361.43ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 89.3MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:39:09,448 INFO L158 Benchmark]: TraceAbstraction took 8118.05ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 88.5MB in the beginning and 85.1MB in the end (delta: 3.4MB). Peak memory consumption was 108.7MB. Max. memory is 16.1GB. [2025-03-08 05:39:09,448 INFO L158 Benchmark]: Witness Printer took 94.67ms. Allocated memory is still 268.4MB. Free memory was 85.1MB in the beginning and 229.9MB in the end (delta: -144.8MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2025-03-08 05:39:09,449 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.20ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.99ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 112.8MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.84ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 110.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.38ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 109.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 361.43ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 89.3MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8118.05ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 88.5MB in the beginning and 85.1MB in the end (delta: 3.4MB). Peak memory consumption was 108.7MB. Max. memory is 16.1GB. * Witness Printer took 94.67ms. Allocated memory is still 268.4MB. Free memory was 85.1MB in the beginning and 229.9MB in the end (delta: -144.8MB). Peak memory consumption was 8.6MB. 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,"featureselect.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [87] - GenericResultAtLocation [Line: 198]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [198] - GenericResultAtLocation [Line: 207]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [207] - GenericResultAtLocation [Line: 234]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [234] - GenericResultAtLocation [Line: 333]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [333] - GenericResultAtLocation [Line: 575]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [575] - GenericResultAtLocation [Line: 640]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [640] * 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: 203]: 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 11 procedures, 105 locations, 156 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1031 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1002 mSDsluCounter, 5499 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4078 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1318 IncrementalHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 1421 mSDtfsCounter, 1318 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 466 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=763occurred in iteration=10, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1085 NumberOfCodeBlocks, 1085 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1071 ConstructedInterpolants, 0 QuantifiedInterpolants, 1706 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1123 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 288/309 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 586]: Location Invariant Derived location invariant: ((((methaneLevelCritical == 0) && (1 == systemActive)) && (splverifierCounter == 0)) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 247]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-03-08 05:39:09,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE