./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i -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 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:40:49,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:40:49,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:40:49,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:40:49,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:40:49,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:40:49,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:40:49,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:40:49,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:40:49,840 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:40:49,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:40:49,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:40:49,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:40:49,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:40:49,843 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:40:49,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:40:49,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:40:49,844 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:40:49,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:40:49,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:40:49,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:40:49,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:40:49,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:40:49,848 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:40:49,848 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:40:49,848 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:40:49,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:40:49,849 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:40:49,849 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:40:49,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:40:49,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:40:49,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:40:49,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:40:49,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:40:49,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:40:49,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:40:49,850 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:40:49,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:40:49,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:40:49,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:40:49,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:40:49,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:40:49,851 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 [2024-11-19 00:40:50,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:40:50,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:40:50,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:40:50,124 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:40:50,124 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:40:50,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2024-11-19 00:40:51,477 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:40:51,668 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:40:51,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2024-11-19 00:40:51,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46718e4c1/0bfd99db5984454cb0a4b86e16ad78e1/FLAGa1723b109 [2024-11-19 00:40:51,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46718e4c1/0bfd99db5984454cb0a4b86e16ad78e1 [2024-11-19 00:40:51,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:40:51,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:40:51,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:40:51,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:40:51,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:40:51,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:40:51" (1/1) ... [2024-11-19 00:40:51,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268f7030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:51, skipping insertion in model container [2024-11-19 00:40:51,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:40:51" (1/1) ... [2024-11-19 00:40:51,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:40:51,880 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2024-11-19 00:40:51,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:40:51,991 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:40:52,000 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2024-11-19 00:40:52,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:40:52,033 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:40:52,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:52 WrapperNode [2024-11-19 00:40:52,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:40:52,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:40:52,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:40:52,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:40:52,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:52" (1/1) ... [2024-11-19 00:40:52,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:52" (1/1) ... [2024-11-19 00:40:52,097 INFO L138 Inliner]: procedures = 29, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 350 [2024-11-19 00:40:52,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:40:52,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:40:52,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:40:52,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:40:52,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:52" (1/1) ... [2024-11-19 00:40:52,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:52" (1/1) ... [2024-11-19 00:40:52,132 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:52" (1/1) ... [2024-11-19 00:40:52,156 INFO L175 MemorySlicer]: Split 86 memory accesses to 6 slices as follows [2, 6, 22, 8, 17, 31]. 36 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 2, 1, 2, 3]. The 13 writes are split as follows [0, 1, 2, 1, 3, 6]. [2024-11-19 00:40:52,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:52" (1/1) ... [2024-11-19 00:40:52,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:52" (1/1) ... [2024-11-19 00:40:52,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:52" (1/1) ... [2024-11-19 00:40:52,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:52" (1/1) ... [2024-11-19 00:40:52,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:52" (1/1) ... [2024-11-19 00:40:52,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:52" (1/1) ... [2024-11-19 00:40:52,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:40:52,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:40:52,193 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:40:52,193 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:40:52,194 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:52" (1/1) ... [2024-11-19 00:40:52,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:40:52,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:40:52,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:40:52,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:40:52,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:40:52,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 00:40:52,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 00:40:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-19 00:40:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-19 00:40:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-19 00:40:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-19 00:40:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 00:40:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 00:40:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 00:40:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 00:40:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 00:40:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 00:40:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 00:40:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 00:40:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-19 00:40:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-19 00:40:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-19 00:40:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-19 00:40:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 00:40:52,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 00:40:52,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 00:40:52,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 00:40:52,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 00:40:52,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 00:40:52,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 00:40:52,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 00:40:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-19 00:40:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-19 00:40:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-19 00:40:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-19 00:40:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:40:52,277 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:40:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:40:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 00:40:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 00:40:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 00:40:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 00:40:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 00:40:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:40:52,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:40:52,385 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:40:52,388 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:40:52,659 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-19 00:40:52,660 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:40:52,677 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:40:52,678 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:40:52,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:40:52 BoogieIcfgContainer [2024-11-19 00:40:52,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:40:52,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:40:52,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:40:52,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:40:52,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:40:51" (1/3) ... [2024-11-19 00:40:52,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31478f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:40:52, skipping insertion in model container [2024-11-19 00:40:52,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:40:52" (2/3) ... [2024-11-19 00:40:52,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31478f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:40:52, skipping insertion in model container [2024-11-19 00:40:52,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:40:52" (3/3) ... [2024-11-19 00:40:52,688 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-9.i [2024-11-19 00:40:52,704 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:40:52,705 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:40:52,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:40:52,770 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;@1f7a6b4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:40:52,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:40:52,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 00:40:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 00:40:52,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:52,781 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:52,781 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:52,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:52,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1456443472, now seen corresponding path program 1 times [2024-11-19 00:40:52,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:52,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577113235] [2024-11-19 00:40:52,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:52,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-19 00:40:53,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:53,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577113235] [2024-11-19 00:40:53,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577113235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:40:53,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148240834] [2024-11-19 00:40:53,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:53,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:53,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:40:53,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:40:53,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:40:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:53,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:40:53,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-19 00:40:53,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:53,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148240834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:53,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:40:53,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:40:53,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358391128] [2024-11-19 00:40:53,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:53,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:40:53,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:53,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:40:53,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:40:53,221 INFO L87 Difference]: Start difference. First operand has 76 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 00:40:53,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:53,239 INFO L93 Difference]: Finished difference Result 145 states and 213 transitions. [2024-11-19 00:40:53,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:40:53,241 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-11-19 00:40:53,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:53,246 INFO L225 Difference]: With dead ends: 145 [2024-11-19 00:40:53,246 INFO L226 Difference]: Without dead ends: 72 [2024-11-19 00:40:53,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:40:53,251 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:53,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:40:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-19 00:40:53,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-19 00:40:53,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 00:40:53,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2024-11-19 00:40:53,279 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 62 [2024-11-19 00:40:53,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:53,279 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2024-11-19 00:40:53,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 00:40:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2024-11-19 00:40:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 00:40:53,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:53,285 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:53,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:40:53,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:40:53,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:53,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:53,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1297553522, now seen corresponding path program 1 times [2024-11-19 00:40:53,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:53,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172642482] [2024-11-19 00:40:53,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:53,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:40:53,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:53,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172642482] [2024-11-19 00:40:53,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172642482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:53,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:53,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:40:53,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466822350] [2024-11-19 00:40:53,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:53,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:40:53,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:53,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:40:53,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:40:53,695 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 00:40:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:53,732 INFO L93 Difference]: Finished difference Result 143 states and 200 transitions. [2024-11-19 00:40:53,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:40:53,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-11-19 00:40:53,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:53,735 INFO L225 Difference]: With dead ends: 143 [2024-11-19 00:40:53,735 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 00:40:53,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:40:53,738 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:53,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:40:53,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 00:40:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-19 00:40:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 00:40:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2024-11-19 00:40:53,748 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 62 [2024-11-19 00:40:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:53,749 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2024-11-19 00:40:53,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 00:40:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2024-11-19 00:40:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 00:40:53,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:53,750 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:53,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:40:53,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:53,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:53,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2103927436, now seen corresponding path program 1 times [2024-11-19 00:40:53,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:53,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507159166] [2024-11-19 00:40:53,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:53,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:40:53,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:53,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507159166] [2024-11-19 00:40:53,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507159166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:53,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:53,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:40:53,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220181312] [2024-11-19 00:40:53,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:53,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:40:53,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:53,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:40:53,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:40:53,904 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:40:53,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:53,937 INFO L93 Difference]: Finished difference Result 148 states and 205 transitions. [2024-11-19 00:40:53,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:40:53,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-19 00:40:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:53,939 INFO L225 Difference]: With dead ends: 148 [2024-11-19 00:40:53,939 INFO L226 Difference]: Without dead ends: 77 [2024-11-19 00:40:53,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:40:53,944 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:53,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 280 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:40:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-19 00:40:53,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-11-19 00:40:53,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 69 states have internal predecessors, (94), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 00:40:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2024-11-19 00:40:53,953 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 62 [2024-11-19 00:40:53,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:53,953 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2024-11-19 00:40:53,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:40:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2024-11-19 00:40:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 00:40:53,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:53,957 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:53,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:40:53,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:53,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:53,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1489975282, now seen corresponding path program 1 times [2024-11-19 00:40:53,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:53,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323846648] [2024-11-19 00:40:53,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:53,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:54,288 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 00:40:54,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:54,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323846648] [2024-11-19 00:40:54,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323846648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:40:54,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647804628] [2024-11-19 00:40:54,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:54,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:54,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:40:54,292 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:40:54,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:40:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:54,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:40:54,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:40:54,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:54,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647804628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:54,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:40:54,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-11-19 00:40:54,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373724748] [2024-11-19 00:40:54,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:54,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:40:54,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:54,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:40:54,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:40:54,534 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:40:54,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:54,568 INFO L93 Difference]: Finished difference Result 152 states and 209 transitions. [2024-11-19 00:40:54,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:40:54,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-19 00:40:54,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:54,569 INFO L225 Difference]: With dead ends: 152 [2024-11-19 00:40:54,570 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 00:40:54,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:40:54,573 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:54,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 281 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:40:54,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 00:40:54,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-11-19 00:40:54,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.352112676056338) internal successors, (96), 71 states have internal predecessors, (96), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 00:40:54,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 106 transitions. [2024-11-19 00:40:54,580 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 106 transitions. Word has length 62 [2024-11-19 00:40:54,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:54,581 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 106 transitions. [2024-11-19 00:40:54,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:40:54,581 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 106 transitions. [2024-11-19 00:40:54,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 00:40:54,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:54,583 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:54,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 00:40:54,783 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,SelfDestructingSolverStorable3 [2024-11-19 00:40:54,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:54,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:54,785 INFO L85 PathProgramCache]: Analyzing trace with hash -809916912, now seen corresponding path program 1 times [2024-11-19 00:40:54,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:54,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727224349] [2024-11-19 00:40:54,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:54,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 00:40:55,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:55,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727224349] [2024-11-19 00:40:55,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727224349] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:40:55,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20314550] [2024-11-19 00:40:55,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:55,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:55,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:40:55,024 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:40:55,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 00:40:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:55,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:40:55,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:40:55,199 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:55,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20314550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:55,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:40:55,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-11-19 00:40:55,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554090257] [2024-11-19 00:40:55,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:55,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:40:55,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:55,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:40:55,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:40:55,201 INFO L87 Difference]: Start difference. First operand 78 states and 106 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:40:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:55,259 INFO L93 Difference]: Finished difference Result 156 states and 213 transitions. [2024-11-19 00:40:55,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:40:55,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-19 00:40:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:55,264 INFO L225 Difference]: With dead ends: 156 [2024-11-19 00:40:55,264 INFO L226 Difference]: Without dead ends: 81 [2024-11-19 00:40:55,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:40:55,265 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:55,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 282 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:40:55,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-19 00:40:55,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2024-11-19 00:40:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 00:40:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 108 transitions. [2024-11-19 00:40:55,276 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 108 transitions. Word has length 62 [2024-11-19 00:40:55,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:55,276 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 108 transitions. [2024-11-19 00:40:55,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:40:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2024-11-19 00:40:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 00:40:55,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:55,280 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:55,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 00:40:55,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:55,481 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:55,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:55,482 INFO L85 PathProgramCache]: Analyzing trace with hash -808069870, now seen corresponding path program 1 times [2024-11-19 00:40:55,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:55,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960991659] [2024-11-19 00:40:55,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:55,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 00:40:55,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:55,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960991659] [2024-11-19 00:40:55,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960991659] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:40:55,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556827455] [2024-11-19 00:40:55,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:55,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:55,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:40:55,633 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:40:55,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 00:40:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:55,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 00:40:55,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:55,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-11-19 00:40:55,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 00:40:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:40:55,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:55,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556827455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:55,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:40:55,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-11-19 00:40:55,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193462351] [2024-11-19 00:40:55,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:55,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:40:55,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:55,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:40:55,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:40:55,984 INFO L87 Difference]: Start difference. First operand 80 states and 108 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:40:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:56,059 INFO L93 Difference]: Finished difference Result 234 states and 318 transitions. [2024-11-19 00:40:56,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:40:56,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-19 00:40:56,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:56,060 INFO L225 Difference]: With dead ends: 234 [2024-11-19 00:40:56,061 INFO L226 Difference]: Without dead ends: 157 [2024-11-19 00:40:56,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:40:56,062 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 71 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:56,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 326 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:40:56,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-19 00:40:56,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2024-11-19 00:40:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 140 states have (on average 1.3428571428571427) internal successors, (188), 140 states have internal predecessors, (188), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-19 00:40:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 208 transitions. [2024-11-19 00:40:56,078 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 208 transitions. Word has length 62 [2024-11-19 00:40:56,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:56,078 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 208 transitions. [2024-11-19 00:40:56,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:40:56,079 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 208 transitions. [2024-11-19 00:40:56,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 00:40:56,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:56,079 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:56,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 00:40:56,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:56,286 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:56,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1593708835, now seen corresponding path program 1 times [2024-11-19 00:40:56,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:56,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187267983] [2024-11-19 00:40:56,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:56,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:40:56,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:56,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187267983] [2024-11-19 00:40:56,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187267983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:56,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:56,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:40:56,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366091126] [2024-11-19 00:40:56,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:56,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:56,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:56,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:56,681 INFO L87 Difference]: Start difference. First operand 153 states and 208 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 00:40:56,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:56,769 INFO L93 Difference]: Finished difference Result 330 states and 446 transitions. [2024-11-19 00:40:56,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:40:56,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2024-11-19 00:40:56,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:56,770 INFO L225 Difference]: With dead ends: 330 [2024-11-19 00:40:56,770 INFO L226 Difference]: Without dead ends: 180 [2024-11-19 00:40:56,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:40:56,771 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 68 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:56,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 446 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:40:56,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-19 00:40:56,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2024-11-19 00:40:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 161 states have (on average 1.3167701863354038) internal successors, (212), 162 states have internal predecessors, (212), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 00:40:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 238 transitions. [2024-11-19 00:40:56,788 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 238 transitions. Word has length 63 [2024-11-19 00:40:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:56,788 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 238 transitions. [2024-11-19 00:40:56,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 00:40:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 238 transitions. [2024-11-19 00:40:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 00:40:56,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:56,789 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:56,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:40:56,789 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:56,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:56,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2055758801, now seen corresponding path program 1 times [2024-11-19 00:40:56,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:56,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857807059] [2024-11-19 00:40:56,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:56,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:56,999 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 00:40:56,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:56,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857807059] [2024-11-19 00:40:56,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857807059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:40:56,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271376517] [2024-11-19 00:40:57,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:57,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:57,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:40:57,004 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:40:57,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 00:40:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:57,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 00:40:57,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:40:57,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-11-19 00:40:57,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 67 [2024-11-19 00:40:57,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 61 [2024-11-19 00:40:57,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 77 [2024-11-19 00:40:57,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 66 [2024-11-19 00:40:57,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:40:57,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 29 [2024-11-19 00:40:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:40:57,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:40:57,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271376517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:57,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:40:57,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-19 00:40:57,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565150149] [2024-11-19 00:40:57,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:57,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:40:57,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:57,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:40:57,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:40:57,563 INFO L87 Difference]: Start difference. First operand 179 states and 238 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:40:57,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:57,688 INFO L93 Difference]: Finished difference Result 345 states and 457 transitions. [2024-11-19 00:40:57,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:40:57,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2024-11-19 00:40:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:57,691 INFO L225 Difference]: With dead ends: 345 [2024-11-19 00:40:57,691 INFO L226 Difference]: Without dead ends: 183 [2024-11-19 00:40:57,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:40:57,692 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 149 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:57,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 331 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:40:57,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-19 00:40:57,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2024-11-19 00:40:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 161 states have (on average 1.31055900621118) internal successors, (211), 162 states have internal predecessors, (211), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 00:40:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 237 transitions. [2024-11-19 00:40:57,701 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 237 transitions. Word has length 67 [2024-11-19 00:40:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:57,702 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 237 transitions. [2024-11-19 00:40:57,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:40:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 237 transitions. [2024-11-19 00:40:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 00:40:57,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:57,703 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:57,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 00:40:57,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:57,904 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:57,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:57,905 INFO L85 PathProgramCache]: Analyzing trace with hash 859585701, now seen corresponding path program 1 times [2024-11-19 00:40:57,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:57,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995743293] [2024-11-19 00:40:57,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:57,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:40:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:40:58,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:40:58,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995743293] [2024-11-19 00:40:58,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995743293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:40:58,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:40:58,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:40:58,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244086032] [2024-11-19 00:40:58,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:40:58,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:40:58,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:40:58,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:40:58,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:40:58,003 INFO L87 Difference]: Start difference. First operand 179 states and 237 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:40:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:40:58,086 INFO L93 Difference]: Finished difference Result 461 states and 604 transitions. [2024-11-19 00:40:58,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:40:58,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2024-11-19 00:40:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:40:58,090 INFO L225 Difference]: With dead ends: 461 [2024-11-19 00:40:58,090 INFO L226 Difference]: Without dead ends: 299 [2024-11-19 00:40:58,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:40:58,091 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 69 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:40:58,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 329 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:40:58,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-19 00:40:58,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 236. [2024-11-19 00:40:58,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 211 states have (on average 1.2890995260663507) internal successors, (272), 213 states have internal predecessors, (272), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:40:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 308 transitions. [2024-11-19 00:40:58,111 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 308 transitions. Word has length 67 [2024-11-19 00:40:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:40:58,111 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 308 transitions. [2024-11-19 00:40:58,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:40:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 308 transitions. [2024-11-19 00:40:58,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 00:40:58,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:40:58,114 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:58,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:40:58,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:40:58,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:40:58,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1528781773, now seen corresponding path program 1 times [2024-11-19 00:40:58,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:40:58,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396914385] [2024-11-19 00:40:58,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:58,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:40:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:40:58,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1613033371] [2024-11-19 00:40:58,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:40:58,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:58,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:40:58,205 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:40:58,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 00:40:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:40:58,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:40:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:40:58,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:40:58,536 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:40:58,537 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:40:58,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 00:40:58,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:40:58,743 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:40:58,810 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:40:58,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:40:58 BoogieIcfgContainer [2024-11-19 00:40:58,816 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:40:58,816 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:40:58,816 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:40:58,817 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:40:58,817 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:40:52" (3/4) ... [2024-11-19 00:40:58,823 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:40:58,824 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:40:58,824 INFO L158 Benchmark]: Toolchain (without parser) took 7126.23ms. Allocated memory was 165.7MB in the beginning and 312.5MB in the end (delta: 146.8MB). Free memory was 94.6MB in the beginning and 113.4MB in the end (delta: -18.8MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. [2024-11-19 00:40:58,824 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 165.7MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:40:58,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.16ms. Allocated memory is still 165.7MB. Free memory was 94.3MB in the beginning and 132.8MB in the end (delta: -38.5MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-11-19 00:40:58,825 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.45ms. Allocated memory is still 165.7MB. Free memory was 132.8MB in the beginning and 129.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:40:58,828 INFO L158 Benchmark]: Boogie Preprocessor took 91.19ms. Allocated memory is still 165.7MB. Free memory was 129.4MB in the beginning and 125.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:40:58,828 INFO L158 Benchmark]: RCFGBuilder took 488.68ms. Allocated memory is still 165.7MB. Free memory was 125.2MB in the beginning and 95.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-19 00:40:58,828 INFO L158 Benchmark]: TraceAbstraction took 6135.83ms. Allocated memory was 165.7MB in the beginning and 312.5MB in the end (delta: 146.8MB). Free memory was 95.9MB in the beginning and 114.4MB in the end (delta: -18.5MB). Peak memory consumption was 129.1MB. Max. memory is 16.1GB. [2024-11-19 00:40:58,829 INFO L158 Benchmark]: Witness Printer took 7.30ms. Allocated memory is still 312.5MB. Free memory is still 113.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:40:58,830 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.18ms. Allocated memory is still 165.7MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.16ms. Allocated memory is still 165.7MB. Free memory was 94.3MB in the beginning and 132.8MB in the end (delta: -38.5MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.45ms. Allocated memory is still 165.7MB. Free memory was 132.8MB in the beginning and 129.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.19ms. Allocated memory is still 165.7MB. Free memory was 129.4MB in the beginning and 125.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 488.68ms. Allocated memory is still 165.7MB. Free memory was 125.2MB in the beginning and 95.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6135.83ms. Allocated memory was 165.7MB in the beginning and 312.5MB in the end (delta: 146.8MB). Free memory was 95.9MB in the beginning and 114.4MB in the end (delta: -18.5MB). Peak memory consumption was 129.1MB. Max. memory is 16.1GB. * Witness Printer took 7.30ms. Allocated memory is still 312.5MB. Free memory is still 113.4MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of shiftLeft at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[2] = { 9.2, 0.975 }; [L25-L27] double double_Array_0[2] = { 9.2, 0.975 }; [L25-L27] double double_Array_0[2] = { 9.2, 0.975 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -16 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -16 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 1, 100 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 1, 100 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 1, 100 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L37] double last_1_double_Array_0_0_ = 9.2; [L38] signed long int last_1_signed_long_int_Array_0_0_ = -16; [L39] signed short int last_1_signed_short_int_Array_0_0_ = 1; [L40] unsigned char last_1_unsigned_char_Array_0_2_ = 10; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] CALL updateLastVariables() [L81] EXPR double_Array_0[0] [L81] last_1_double_Array_0_0_ = double_Array_0[0] [L82] EXPR signed_long_int_Array_0[0] [L82] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L83] EXPR signed_short_int_Array_0[0] [L83] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L84] EXPR unsigned_char_Array_0[2] [L84] last_1_unsigned_char_Array_0_2_ = unsigned_char_Array_0[2] [L94] RET updateLastVariables() [L95] CALL updateVariables() [L71] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] double_Array_0[1] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L75] EXPR double_Array_0[1] [L75] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L77] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] RET updateVariables() [L96] CALL step() [L44] unsigned char stepLocal_0 = last_1_double_Array_0_0_ > last_1_double_Array_0_0_; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=0, unsigned_char_Array_0={8:0}] [L45] COND FALSE !(((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || stepLocal_0) [L48] signed_short_int_Array_0[0] = last_1_signed_short_int_Array_0_0_ VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L50] EXPR signed_short_int_Array_0[0] [L50] signed_long_int_Array_0[0] = signed_short_int_Array_0[0] [L51] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L51] EXPR 10 << signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L51] COND TRUE (10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0]) [L52] EXPR signed_short_int_Array_0[0] [L52] EXPR signed_long_int_Array_0[0] [L52] signed_short_int_Array_0[1] = (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]) [L54] unsigned_char_Array_0[0] = 64 [L55] EXPR double_Array_0[1] [L55] double_Array_0[0] = double_Array_0[1] [L56] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L56] COND TRUE signed_short_int_Array_0[0] <= 16 [L57] EXPR unsigned_char_Array_0[1] [L57] unsigned_char_Array_0[2] = unsigned_char_Array_0[1] [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) [L87] EXPR unsigned_char_Array_0[2] [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR (signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1) [L87] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR 10 << signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR unsigned_char_Array_0[1] [L87] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1 [L87] EXPR signed_short_int_Array_0[1] [L87] EXPR signed_short_int_Array_0[0] [L87] EXPR signed_long_int_Array_0[0] [L87] EXPR ((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64)) [L87] EXPR unsigned_char_Array_0[0] [L87] EXPR (((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1])) [L87] EXPR double_Array_0[0] [L87] EXPR double_Array_0[1] [L87] EXPR ((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR (((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] EXPR ((((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87-L88] return ((((((signed_short_int_Array_0[0] <= 16) ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : ((((((double_Array_0[0]) > (double_Array_0[0])) ? (double_Array_0[0]) : (double_Array_0[0]))) < double_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1]))) : (unsigned_char_Array_0[2] == ((unsigned char) unsigned_char_Array_0[1])))) && (((10 << signed_short_int_Array_0[0]) < (unsigned_char_Array_0[1] * signed_long_int_Array_0[0])) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] + signed_long_int_Array_0[0]))) : 1)) && (unsigned_char_Array_0[0] == ((unsigned char) 64))) && (double_Array_0[0] == ((double) double_Array_0[1]))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? (signed_short_int_Array_0[0] == ((signed short int) ((((((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? (((unsigned_char_Array_0[1] + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && (signed_long_int_Array_0[0] == ((signed long int) signed_short_int_Array_0[0])) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 361 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 360 mSDsluCounter, 2658 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1807 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 354 IncrementalHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 851 mSDtfsCounter, 354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=9, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 75 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1020 NumberOfCodeBlocks, 1020 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 870 ConstructedInterpolants, 0 QuantifiedInterpolants, 2749 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1469 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 504/560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 00:40:58,856 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:41:00,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:41:01,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:41:01,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:41:01,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:41:01,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:41:01,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:41:01,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:41:01,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:41:01,073 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:41:01,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:41:01,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:41:01,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:41:01,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:41:01,074 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:41:01,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:41:01,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:41:01,075 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:41:01,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:41:01,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:41:01,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:41:01,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:41:01,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:41:01,079 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:41:01,079 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:41:01,080 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:41:01,080 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:41:01,081 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:41:01,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:41:01,081 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:41:01,081 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:41:01,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:41:01,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:41:01,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:41:01,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:41:01,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:41:01,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:41:01,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:41:01,083 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:41:01,084 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:41:01,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:41:01,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:41:01,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:41:01,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:41:01,084 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c975edcf93ad701ca3189f1eb3683e2db491e10cd89ec62916352d02b9ad719 [2024-11-19 00:41:01,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:41:01,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:41:01,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:41:01,363 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:41:01,364 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:41:01,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2024-11-19 00:41:02,823 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:41:02,979 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:41:02,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i [2024-11-19 00:41:02,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac01a2d9d/d362344792344c92b643444930ff69e5/FLAGc6df88cb8 [2024-11-19 00:41:02,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac01a2d9d/d362344792344c92b643444930ff69e5 [2024-11-19 00:41:03,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:41:03,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:41:03,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:41:03,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:41:03,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:41:03,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:41:02" (1/1) ... [2024-11-19 00:41:03,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5691bc40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:03, skipping insertion in model container [2024-11-19 00:41:03,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:41:02" (1/1) ... [2024-11-19 00:41:03,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:41:03,168 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2024-11-19 00:41:03,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:41:03,227 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:41:03,239 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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-9.i[915,928] [2024-11-19 00:41:03,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:41:03,297 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:41:03,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:03 WrapperNode [2024-11-19 00:41:03,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:41:03,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:41:03,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:41:03,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:41:03,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:03" (1/1) ... [2024-11-19 00:41:03,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:03" (1/1) ... [2024-11-19 00:41:03,351 INFO L138 Inliner]: procedures = 36, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 336 [2024-11-19 00:41:03,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:41:03,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:41:03,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:41:03,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:41:03,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:03" (1/1) ... [2024-11-19 00:41:03,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:03" (1/1) ... [2024-11-19 00:41:03,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:03" (1/1) ... [2024-11-19 00:41:03,397 INFO L175 MemorySlicer]: Split 86 memory accesses to 6 slices as follows [2, 6, 22, 8, 17, 31]. 36 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 2, 1, 2, 3]. The 13 writes are split as follows [0, 1, 2, 1, 3, 6]. [2024-11-19 00:41:03,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:03" (1/1) ... [2024-11-19 00:41:03,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:03" (1/1) ... [2024-11-19 00:41:03,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:03" (1/1) ... [2024-11-19 00:41:03,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:03" (1/1) ... [2024-11-19 00:41:03,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:03" (1/1) ... [2024-11-19 00:41:03,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:03" (1/1) ... [2024-11-19 00:41:03,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:41:03,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:41:03,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:41:03,442 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:41:03,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:03" (1/1) ... [2024-11-19 00:41:03,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:41:03,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:41:03,471 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:41:03,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:41:03,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:41:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 00:41:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 00:41:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-19 00:41:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-19 00:41:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-19 00:41:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-19 00:41:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 00:41:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 00:41:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-19 00:41:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-19 00:41:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-19 00:41:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-19 00:41:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 00:41:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 00:41:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 00:41:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 00:41:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 00:41:03,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 00:41:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 00:41:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 00:41:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 00:41:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 00:41:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 00:41:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-19 00:41:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:41:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 00:41:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 00:41:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 00:41:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 00:41:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 00:41:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 00:41:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 00:41:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 00:41:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 00:41:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 00:41:03,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-19 00:41:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 00:41:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 00:41:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-19 00:41:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-19 00:41:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-19 00:41:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-19 00:41:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 00:41:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 00:41:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 00:41:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 00:41:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 00:41:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-19 00:41:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 00:41:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 00:41:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-19 00:41:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-19 00:41:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-19 00:41:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-19 00:41:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:41:03,520 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:41:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:41:03,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:41:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 00:41:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 00:41:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 00:41:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 00:41:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 00:41:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 00:41:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 00:41:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 00:41:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-19 00:41:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-19 00:41:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-19 00:41:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-19 00:41:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 00:41:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 00:41:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 00:41:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 00:41:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-19 00:41:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-19 00:41:03,648 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:41:03,650 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:41:04,127 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-11-19 00:41:04,127 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:41:04,137 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:41:04,137 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:41:04,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:41:04 BoogieIcfgContainer [2024-11-19 00:41:04,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:41:04,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:41:04,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:41:04,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:41:04,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:41:02" (1/3) ... [2024-11-19 00:41:04,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f75c11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:41:04, skipping insertion in model container [2024-11-19 00:41:04,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:41:03" (2/3) ... [2024-11-19 00:41:04,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f75c11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:41:04, skipping insertion in model container [2024-11-19 00:41:04,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:41:04" (3/3) ... [2024-11-19 00:41:04,143 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-9.i [2024-11-19 00:41:04,164 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:41:04,164 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:41:04,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:41:04,236 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;@62ca5e2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:41:04,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:41:04,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 00:41:04,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 00:41:04,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:04,247 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:04,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:04,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1798091589, now seen corresponding path program 1 times [2024-11-19 00:41:04,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:04,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823534205] [2024-11-19 00:41:04,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:04,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:04,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:04,265 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:04,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 00:41:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:04,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:41:04,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-19 00:41:04,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:41:04,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:04,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823534205] [2024-11-19 00:41:04,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823534205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:04,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:04,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:41:04,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088496736] [2024-11-19 00:41:04,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:04,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:41:04,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:04,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:41:04,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:41:04,568 INFO L87 Difference]: Start difference. First operand has 70 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:04,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:04,600 INFO L93 Difference]: Finished difference Result 133 states and 197 transitions. [2024-11-19 00:41:04,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:41:04,602 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-19 00:41:04,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:04,607 INFO L225 Difference]: With dead ends: 133 [2024-11-19 00:41:04,607 INFO L226 Difference]: Without dead ends: 66 [2024-11-19 00:41:04,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:41:04,616 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:04,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:41:04,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-19 00:41:04,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-19 00:41:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 00:41:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2024-11-19 00:41:04,655 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 60 [2024-11-19 00:41:04,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:04,656 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2024-11-19 00:41:04,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:04,656 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2024-11-19 00:41:04,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 00:41:04,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:04,658 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:04,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 00:41:04,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:04,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:04,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:04,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1196343811, now seen corresponding path program 1 times [2024-11-19 00:41:04,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:04,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402423933] [2024-11-19 00:41:04,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:04,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:04,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:04,867 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:04,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 00:41:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:05,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:41:05,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 00:41:05,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:41:05,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:05,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402423933] [2024-11-19 00:41:05,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402423933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:05,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:05,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:41:05,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503095144] [2024-11-19 00:41:05,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:05,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:41:05,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:05,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:41:05,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:41:05,142 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 00:41:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:05,181 INFO L93 Difference]: Finished difference Result 131 states and 184 transitions. [2024-11-19 00:41:05,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:41:05,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2024-11-19 00:41:05,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:05,182 INFO L225 Difference]: With dead ends: 131 [2024-11-19 00:41:05,183 INFO L226 Difference]: Without dead ends: 68 [2024-11-19 00:41:05,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:41:05,184 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:05,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:41:05,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-19 00:41:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-19 00:41:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 00:41:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2024-11-19 00:41:05,194 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 60 [2024-11-19 00:41:05,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:05,195 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2024-11-19 00:41:05,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 00:41:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2024-11-19 00:41:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 00:41:05,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:05,200 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:05,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 00:41:05,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:05,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:05,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:05,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2093737089, now seen corresponding path program 1 times [2024-11-19 00:41:05,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:05,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29100113] [2024-11-19 00:41:05,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:05,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:05,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:05,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:05,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 00:41:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:05,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:41:05,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:41:05,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:41:05,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:05,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29100113] [2024-11-19 00:41:05,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29100113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:05,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:05,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:41:05,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684557962] [2024-11-19 00:41:05,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:05,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:41:05,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:05,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:41:05,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:41:05,681 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:05,720 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2024-11-19 00:41:05,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:41:05,723 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), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-19 00:41:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:05,724 INFO L225 Difference]: With dead ends: 136 [2024-11-19 00:41:05,724 INFO L226 Difference]: Without dead ends: 71 [2024-11-19 00:41:05,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:41:05,725 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:05,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 256 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:41:05,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-19 00:41:05,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-11-19 00:41:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 00:41:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2024-11-19 00:41:05,734 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 60 [2024-11-19 00:41:05,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:05,734 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2024-11-19 00:41:05,734 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), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2024-11-19 00:41:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 00:41:05,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:05,736 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:05,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 00:41:05,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:05,943 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:05,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:05,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1500165629, now seen corresponding path program 1 times [2024-11-19 00:41:05,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:05,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644858250] [2024-11-19 00:41:05,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:05,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:05,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:05,948 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:05,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 00:41:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:06,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:41:06,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:41:06,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:41:06,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:06,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644858250] [2024-11-19 00:41:06,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644858250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:06,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:06,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:41:06,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499826324] [2024-11-19 00:41:06,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:06,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:41:06,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:06,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:41:06,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:41:06,123 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:06,156 INFO L93 Difference]: Finished difference Result 140 states and 193 transitions. [2024-11-19 00:41:06,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:41:06,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-19 00:41:06,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:06,157 INFO L225 Difference]: With dead ends: 140 [2024-11-19 00:41:06,157 INFO L226 Difference]: Without dead ends: 73 [2024-11-19 00:41:06,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:41:06,159 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:06,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 333 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:41:06,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-19 00:41:06,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-11-19 00:41:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 00:41:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2024-11-19 00:41:06,164 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 60 [2024-11-19 00:41:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:06,165 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2024-11-19 00:41:06,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2024-11-19 00:41:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 00:41:06,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:06,170 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:06,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 00:41:06,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:06,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:06,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:06,371 INFO L85 PathProgramCache]: Analyzing trace with hash -820107259, now seen corresponding path program 1 times [2024-11-19 00:41:06,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:06,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415988450] [2024-11-19 00:41:06,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:06,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:06,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:06,375 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:06,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 00:41:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:06,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:41:06,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:41:06,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:41:06,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:06,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415988450] [2024-11-19 00:41:06,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415988450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:06,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:06,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:41:06,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102622080] [2024-11-19 00:41:06,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:06,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:41:06,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:06,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:41:06,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:41:06,552 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:06,636 INFO L93 Difference]: Finished difference Result 146 states and 200 transitions. [2024-11-19 00:41:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:41:06,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-19 00:41:06,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:06,638 INFO L225 Difference]: With dead ends: 146 [2024-11-19 00:41:06,638 INFO L226 Difference]: Without dead ends: 77 [2024-11-19 00:41:06,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:41:06,644 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:06,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:41:06,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-19 00:41:06,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-11-19 00:41:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 69 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 00:41:06,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2024-11-19 00:41:06,658 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 60 [2024-11-19 00:41:06,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:06,659 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2024-11-19 00:41:06,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:06,659 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2024-11-19 00:41:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 00:41:06,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:06,661 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:06,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 00:41:06,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:06,862 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:06,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:06,863 INFO L85 PathProgramCache]: Analyzing trace with hash -818260217, now seen corresponding path program 1 times [2024-11-19 00:41:06,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:06,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659501814] [2024-11-19 00:41:06,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:06,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:06,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:06,867 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:06,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 00:41:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:07,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 00:41:07,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:07,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-19 00:41:07,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-19 00:41:07,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:07,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2024-11-19 00:41:07,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:07,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 38 [2024-11-19 00:41:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 00:41:07,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:41:07,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:07,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659501814] [2024-11-19 00:41:07,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659501814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:07,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:07,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:41:07,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428572262] [2024-11-19 00:41:07,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:07,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:41:07,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:07,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:41:07,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:41:07,443 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 00:41:07,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:07,782 INFO L93 Difference]: Finished difference Result 185 states and 247 transitions. [2024-11-19 00:41:07,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:41:07,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2024-11-19 00:41:07,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:07,784 INFO L225 Difference]: With dead ends: 185 [2024-11-19 00:41:07,788 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 00:41:07,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:41:07,789 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 170 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:07,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 337 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:41:07,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 00:41:07,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2024-11-19 00:41:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.288888888888889) internal successors, (116), 91 states have internal predecessors, (116), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-19 00:41:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2024-11-19 00:41:07,807 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 60 [2024-11-19 00:41:07,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:07,807 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2024-11-19 00:41:07,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 00:41:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2024-11-19 00:41:07,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 00:41:07,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:07,810 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:07,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 00:41:08,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:08,012 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:08,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:08,012 INFO L85 PathProgramCache]: Analyzing trace with hash -641616418, now seen corresponding path program 1 times [2024-11-19 00:41:08,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:08,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783863974] [2024-11-19 00:41:08,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:08,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:08,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:08,015 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:08,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 00:41:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:08,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 00:41:08,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:08,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:41:08,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:08,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 98 [2024-11-19 00:41:08,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:08,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 131 [2024-11-19 00:41:08,988 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 00:41:08,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:41:09,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:09,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783863974] [2024-11-19 00:41:09,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783863974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:41:09,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1137088034] [2024-11-19 00:41:09,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:09,154 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:41:09,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:41:09,158 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:41:09,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-19 00:41:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:09,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 00:41:09,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:10,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-11-19 00:41:10,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:10,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 96 [2024-11-19 00:41:11,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:11,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 288 treesize of output 144 [2024-11-19 00:41:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 00:41:11,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:41:11,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1137088034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:41:11,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:41:11,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-19 00:41:11,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779012908] [2024-11-19 00:41:11,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:41:11,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 00:41:11,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:11,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 00:41:11,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:41:11,334 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-19 00:41:12,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:12,487 INFO L93 Difference]: Finished difference Result 268 states and 348 transitions. [2024-11-19 00:41:12,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:41:12,488 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 62 [2024-11-19 00:41:12,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:12,491 INFO L225 Difference]: With dead ends: 268 [2024-11-19 00:41:12,491 INFO L226 Difference]: Without dead ends: 189 [2024-11-19 00:41:12,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-11-19 00:41:12,492 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 293 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:12,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 702 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 00:41:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-19 00:41:12,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2024-11-19 00:41:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 160 states have (on average 1.28125) internal successors, (205), 163 states have internal predecessors, (205), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:41:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 241 transitions. [2024-11-19 00:41:12,533 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 241 transitions. Word has length 62 [2024-11-19 00:41:12,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:12,533 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 241 transitions. [2024-11-19 00:41:12,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-19 00:41:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2024-11-19 00:41:12,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 00:41:12,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:12,534 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:12,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-19 00:41:12,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 00:41:12,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:12,935 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:12,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:12,936 INFO L85 PathProgramCache]: Analyzing trace with hash 38441952, now seen corresponding path program 1 times [2024-11-19 00:41:12,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:12,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606666367] [2024-11-19 00:41:12,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:12,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:12,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:12,940 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:12,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 00:41:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:13,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:41:13,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:13,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-19 00:41:13,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-19 00:41:13,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-11-19 00:41:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:41:13,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:41:13,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:13,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606666367] [2024-11-19 00:41:13,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606666367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:13,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:13,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:41:13,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261416580] [2024-11-19 00:41:13,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:13,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:41:13,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:13,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:41:13,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:41:13,186 INFO L87 Difference]: Start difference. First operand 186 states and 241 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:13,397 INFO L93 Difference]: Finished difference Result 354 states and 461 transitions. [2024-11-19 00:41:13,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:41:13,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-19 00:41:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:13,399 INFO L225 Difference]: With dead ends: 354 [2024-11-19 00:41:13,399 INFO L226 Difference]: Without dead ends: 202 [2024-11-19 00:41:13,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:41:13,400 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 77 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:13,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 350 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:41:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-19 00:41:13,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 186. [2024-11-19 00:41:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 160 states have (on average 1.26875) internal successors, (203), 163 states have internal predecessors, (203), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:41:13,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 239 transitions. [2024-11-19 00:41:13,424 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 239 transitions. Word has length 62 [2024-11-19 00:41:13,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:13,424 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 239 transitions. [2024-11-19 00:41:13,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:13,425 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 239 transitions. [2024-11-19 00:41:13,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 00:41:13,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:13,426 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:13,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 00:41:13,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:13,627 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:13,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:13,628 INFO L85 PathProgramCache]: Analyzing trace with hash 739506530, now seen corresponding path program 1 times [2024-11-19 00:41:13,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:13,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946725232] [2024-11-19 00:41:13,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:13,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:13,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:13,629 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:13,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 00:41:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:13,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 00:41:13,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:13,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 00:41:13,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 00:41:13,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2024-11-19 00:41:14,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:14,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 67 [2024-11-19 00:41:14,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 55 [2024-11-19 00:41:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:41:14,073 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:41:14,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:14,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946725232] [2024-11-19 00:41:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [946725232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:14,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:14,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:41:14,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474796543] [2024-11-19 00:41:14,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:14,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:41:14,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:14,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:41:14,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:41:14,075 INFO L87 Difference]: Start difference. First operand 186 states and 239 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:14,596 INFO L93 Difference]: Finished difference Result 666 states and 859 transitions. [2024-11-19 00:41:14,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:41:14,596 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-19 00:41:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:14,598 INFO L225 Difference]: With dead ends: 666 [2024-11-19 00:41:14,598 INFO L226 Difference]: Without dead ends: 514 [2024-11-19 00:41:14,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:41:14,599 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 285 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:14,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 819 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:41:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-19 00:41:14,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 490. [2024-11-19 00:41:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 434 states have (on average 1.2695852534562213) internal successors, (551), 439 states have internal predecessors, (551), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 00:41:14,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 627 transitions. [2024-11-19 00:41:14,626 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 627 transitions. Word has length 62 [2024-11-19 00:41:14,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:14,627 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 627 transitions. [2024-11-19 00:41:14,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:14,627 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 627 transitions. [2024-11-19 00:41:14,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 00:41:14,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:14,628 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:14,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 00:41:14,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:14,831 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:14,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:14,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1162208356, now seen corresponding path program 1 times [2024-11-19 00:41:14,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:14,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060396769] [2024-11-19 00:41:14,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:14,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:14,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:14,835 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:14,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 00:41:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:15,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 00:41:15,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:15,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:41:15,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 00:41:15,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 00:41:15,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2024-11-19 00:41:15,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:15,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2024-11-19 00:41:15,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-11-19 00:41:15,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2024-11-19 00:41:15,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:15,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 25 [2024-11-19 00:41:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:41:15,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:41:15,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:15,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060396769] [2024-11-19 00:41:15,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060396769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:15,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:15,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:41:15,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18451164] [2024-11-19 00:41:15,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:15,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:41:15,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:15,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:41:15,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:41:15,600 INFO L87 Difference]: Start difference. First operand 490 states and 627 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:16,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:16,326 INFO L93 Difference]: Finished difference Result 1070 states and 1368 transitions. [2024-11-19 00:41:16,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 00:41:16,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-19 00:41:16,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:16,328 INFO L225 Difference]: With dead ends: 1070 [2024-11-19 00:41:16,328 INFO L226 Difference]: Without dead ends: 614 [2024-11-19 00:41:16,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:41:16,330 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 182 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:16,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 528 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:41:16,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-19 00:41:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 376. [2024-11-19 00:41:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 335 states have (on average 1.2895522388059701) internal successors, (432), 339 states have internal predecessors, (432), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:41:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 488 transitions. [2024-11-19 00:41:16,353 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 488 transitions. Word has length 62 [2024-11-19 00:41:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:16,353 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 488 transitions. [2024-11-19 00:41:16,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 488 transitions. [2024-11-19 00:41:16,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 00:41:16,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:16,355 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:16,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 00:41:16,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:16,559 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:16,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:16,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1486813350, now seen corresponding path program 1 times [2024-11-19 00:41:16,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:16,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215488060] [2024-11-19 00:41:16,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:16,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:16,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:16,562 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:16,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 00:41:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:16,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 00:41:16,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:16,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:16,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 67 [2024-11-19 00:41:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 00:41:16,878 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:41:17,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:17,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 1 [2024-11-19 00:41:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 00:41:17,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:17,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215488060] [2024-11-19 00:41:17,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215488060] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:41:17,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:41:17,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-19 00:41:17,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691469110] [2024-11-19 00:41:17,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:41:17,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:41:17,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:17,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:41:17,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:41:17,179 INFO L87 Difference]: Start difference. First operand 376 states and 488 transitions. Second operand has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-19 00:41:17,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:17,690 INFO L93 Difference]: Finished difference Result 773 states and 995 transitions. [2024-11-19 00:41:17,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:41:17,693 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 64 [2024-11-19 00:41:17,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:17,696 INFO L225 Difference]: With dead ends: 773 [2024-11-19 00:41:17,698 INFO L226 Difference]: Without dead ends: 390 [2024-11-19 00:41:17,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:41:17,699 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 97 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:17,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 443 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:41:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-19 00:41:17,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 370. [2024-11-19 00:41:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 329 states have (on average 1.2765957446808511) internal successors, (420), 333 states have internal predecessors, (420), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:41:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 476 transitions. [2024-11-19 00:41:17,728 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 476 transitions. Word has length 64 [2024-11-19 00:41:17,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:17,729 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 476 transitions. [2024-11-19 00:41:17,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-19 00:41:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 476 transitions. [2024-11-19 00:41:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 00:41:17,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:17,730 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:17,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 00:41:17,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:17,930 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:17,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:17,931 INFO L85 PathProgramCache]: Analyzing trace with hash -734205554, now seen corresponding path program 1 times [2024-11-19 00:41:17,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:17,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252456701] [2024-11-19 00:41:17,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:17,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:17,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:17,932 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:17,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 00:41:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:18,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 00:41:18,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:18,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 00:41:18,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 00:41:18,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2024-11-19 00:41:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:41:18,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:41:18,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:18,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252456701] [2024-11-19 00:41:18,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252456701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:18,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:18,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:41:18,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260989263] [2024-11-19 00:41:18,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:18,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:41:18,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:18,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:41:18,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:41:18,587 INFO L87 Difference]: Start difference. First operand 370 states and 476 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:19,294 INFO L93 Difference]: Finished difference Result 552 states and 704 transitions. [2024-11-19 00:41:19,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:41:19,294 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2024-11-19 00:41:19,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:19,298 INFO L225 Difference]: With dead ends: 552 [2024-11-19 00:41:19,298 INFO L226 Difference]: Without dead ends: 550 [2024-11-19 00:41:19,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2024-11-19 00:41:19,299 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 410 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:19,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 699 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:41:19,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-19 00:41:19,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 376. [2024-11-19 00:41:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 335 states have (on average 1.2716417910447761) internal successors, (426), 339 states have internal predecessors, (426), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:41:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 482 transitions. [2024-11-19 00:41:19,325 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 482 transitions. Word has length 64 [2024-11-19 00:41:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:19,326 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 482 transitions. [2024-11-19 00:41:19,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:19,326 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 482 transitions. [2024-11-19 00:41:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 00:41:19,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:19,327 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:19,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 00:41:19,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:19,533 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:19,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:19,533 INFO L85 PathProgramCache]: Analyzing trace with hash -732358512, now seen corresponding path program 1 times [2024-11-19 00:41:19,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:19,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535738556] [2024-11-19 00:41:19,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:19,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:19,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:19,535 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:19,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 00:41:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:19,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 00:41:19,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:19,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-19 00:41:19,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 00:41:19,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2024-11-19 00:41:20,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 81 [2024-11-19 00:41:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:41:20,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:41:20,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:20,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535738556] [2024-11-19 00:41:20,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535738556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:20,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:20,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:41:20,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730975034] [2024-11-19 00:41:20,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:20,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 00:41:20,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:20,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 00:41:20,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:41:20,181 INFO L87 Difference]: Start difference. First operand 376 states and 482 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:20,918 INFO L93 Difference]: Finished difference Result 906 states and 1158 transitions. [2024-11-19 00:41:20,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:41:20,919 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2024-11-19 00:41:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:20,920 INFO L225 Difference]: With dead ends: 906 [2024-11-19 00:41:20,920 INFO L226 Difference]: Without dead ends: 562 [2024-11-19 00:41:20,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2024-11-19 00:41:20,921 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 230 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:20,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 854 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 00:41:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-19 00:41:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 382. [2024-11-19 00:41:20,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 341 states have (on average 1.2668621700879765) internal successors, (432), 345 states have internal predecessors, (432), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:41:20,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 488 transitions. [2024-11-19 00:41:20,941 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 488 transitions. Word has length 64 [2024-11-19 00:41:20,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:20,941 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 488 transitions. [2024-11-19 00:41:20,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:20,941 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 488 transitions. [2024-11-19 00:41:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 00:41:20,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:20,942 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:20,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 00:41:21,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:21,143 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:21,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:21,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1326417457, now seen corresponding path program 1 times [2024-11-19 00:41:21,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:21,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135740155] [2024-11-19 00:41:21,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:21,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:21,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:21,146 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:21,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 00:41:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:21,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:41:21,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:21,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 00:41:21,312 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:41:21,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:41:21,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:21,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135740155] [2024-11-19 00:41:21,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135740155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:21,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:21,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:41:21,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479103495] [2024-11-19 00:41:21,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:21,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:41:21,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:21,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:41:21,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:41:21,314 INFO L87 Difference]: Start difference. First operand 382 states and 488 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:21,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:21,583 INFO L93 Difference]: Finished difference Result 972 states and 1224 transitions. [2024-11-19 00:41:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:41:21,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2024-11-19 00:41:21,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:21,586 INFO L225 Difference]: With dead ends: 972 [2024-11-19 00:41:21,586 INFO L226 Difference]: Without dead ends: 622 [2024-11-19 00:41:21,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:41:21,587 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 63 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:21,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 289 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:41:21,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-19 00:41:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 394. [2024-11-19 00:41:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 353 states have (on average 1.2577903682719547) internal successors, (444), 357 states have internal predecessors, (444), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:41:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 500 transitions. [2024-11-19 00:41:21,618 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 500 transitions. Word has length 64 [2024-11-19 00:41:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:21,619 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 500 transitions. [2024-11-19 00:41:21,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 500 transitions. [2024-11-19 00:41:21,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 00:41:21,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:21,620 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:21,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 00:41:21,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:21,820 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:21,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:21,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1989253635, now seen corresponding path program 1 times [2024-11-19 00:41:21,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:21,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779510371] [2024-11-19 00:41:21,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:21,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:21,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:21,823 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:21,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 00:41:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:21,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:41:21,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:22,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 00:41:22,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 00:41:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:41:22,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:41:22,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:22,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779510371] [2024-11-19 00:41:22,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779510371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:22,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:22,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:41:22,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737095051] [2024-11-19 00:41:22,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:22,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:41:22,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:22,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:41:22,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:41:22,122 INFO L87 Difference]: Start difference. First operand 394 states and 500 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:22,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:22,305 INFO L93 Difference]: Finished difference Result 906 states and 1157 transitions. [2024-11-19 00:41:22,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:41:22,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2024-11-19 00:41:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:22,307 INFO L225 Difference]: With dead ends: 906 [2024-11-19 00:41:22,307 INFO L226 Difference]: Without dead ends: 544 [2024-11-19 00:41:22,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:41:22,310 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 80 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:22,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 276 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:41:22,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-19 00:41:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 504. [2024-11-19 00:41:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 463 states have (on average 1.285097192224622) internal successors, (595), 465 states have internal predecessors, (595), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:41:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 651 transitions. [2024-11-19 00:41:22,335 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 651 transitions. Word has length 64 [2024-11-19 00:41:22,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:22,335 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 651 transitions. [2024-11-19 00:41:22,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 651 transitions. [2024-11-19 00:41:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 00:41:22,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:22,336 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:22,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-19 00:41:22,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:22,541 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:22,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:22,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1839901732, now seen corresponding path program 1 times [2024-11-19 00:41:22,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:22,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245113966] [2024-11-19 00:41:22,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:22,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:22,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:22,545 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:22,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 00:41:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:22,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 00:41:22,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:22,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2024-11-19 00:41:25,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:25,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 100 [2024-11-19 00:41:25,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:25,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 389 treesize of output 133 [2024-11-19 00:41:25,572 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 00:41:25,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:41:25,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:25,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245113966] [2024-11-19 00:41:25,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245113966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:41:25,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1980451903] [2024-11-19 00:41:25,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:25,747 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:41:25,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:41:25,751 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:41:25,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-19 00:41:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:26,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 00:41:26,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:28,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-19 00:41:33,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:33,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 98 [2024-11-19 00:41:33,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:33,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 294 treesize of output 146 [2024-11-19 00:41:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 00:41:33,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:41:33,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1980451903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:41:33,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:41:33,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2024-11-19 00:41:33,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865017947] [2024-11-19 00:41:33,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:41:33,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 00:41:33,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:33,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 00:41:33,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=541, Unknown=3, NotChecked=0, Total=650 [2024-11-19 00:41:33,911 INFO L87 Difference]: Start difference. First operand 504 states and 651 transitions. Second operand has 24 states, 22 states have (on average 4.0) internal successors, (88), 21 states have internal predecessors, (88), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-19 00:41:36,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:36,296 INFO L93 Difference]: Finished difference Result 892 states and 1134 transitions. [2024-11-19 00:41:36,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 00:41:36,297 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 4.0) internal successors, (88), 21 states have internal predecessors, (88), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) Word has length 64 [2024-11-19 00:41:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:36,299 INFO L225 Difference]: With dead ends: 892 [2024-11-19 00:41:36,299 INFO L226 Difference]: Without dead ends: 530 [2024-11-19 00:41:36,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 152 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=366, Invalid=1353, Unknown=3, NotChecked=0, Total=1722 [2024-11-19 00:41:36,300 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 389 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:36,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1180 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 00:41:36,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-19 00:41:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 283. [2024-11-19 00:41:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 255 states have (on average 1.2588235294117647) internal successors, (321), 256 states have internal predecessors, (321), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:41:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 357 transitions. [2024-11-19 00:41:36,330 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 357 transitions. Word has length 64 [2024-11-19 00:41:36,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:36,330 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 357 transitions. [2024-11-19 00:41:36,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 4.0) internal successors, (88), 21 states have internal predecessors, (88), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 4 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-19 00:41:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 357 transitions. [2024-11-19 00:41:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 00:41:36,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:36,331 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:36,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-19 00:41:36,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-19 00:41:36,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:36,736 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:36,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:36,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1407798200, now seen corresponding path program 1 times [2024-11-19 00:41:36,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:36,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975103028] [2024-11-19 00:41:36,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:36,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:36,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:36,740 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:36,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-19 00:41:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:36,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 00:41:36,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:37,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:37,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 98 [2024-11-19 00:41:37,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:37,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 278 treesize of output 100 [2024-11-19 00:41:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 00:41:37,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:41:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:41:37,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:37,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975103028] [2024-11-19 00:41:37,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975103028] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:41:37,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:41:37,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2024-11-19 00:41:37,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086824334] [2024-11-19 00:41:37,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:37,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:41:37,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:37,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:41:37,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:41:37,452 INFO L87 Difference]: Start difference. First operand 283 states and 357 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:37,500 INFO L93 Difference]: Finished difference Result 515 states and 652 transitions. [2024-11-19 00:41:37,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:41:37,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2024-11-19 00:41:37,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:37,503 INFO L225 Difference]: With dead ends: 515 [2024-11-19 00:41:37,503 INFO L226 Difference]: Without dead ends: 283 [2024-11-19 00:41:37,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:41:37,505 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:37,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:41:37,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-19 00:41:37,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-11-19 00:41:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 255 states have (on average 1.2392156862745098) internal successors, (316), 256 states have internal predecessors, (316), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:41:37,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 352 transitions. [2024-11-19 00:41:37,535 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 352 transitions. Word has length 67 [2024-11-19 00:41:37,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:37,535 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 352 transitions. [2024-11-19 00:41:37,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 352 transitions. [2024-11-19 00:41:37,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 00:41:37,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:37,536 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:37,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-19 00:41:37,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:37,737 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:37,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:37,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1081730762, now seen corresponding path program 1 times [2024-11-19 00:41:37,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:37,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58703316] [2024-11-19 00:41:37,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:37,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:37,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:37,740 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:37,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-19 00:41:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:37,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 00:41:37,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:38,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:38,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 98 [2024-11-19 00:41:38,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:38,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 278 treesize of output 100 [2024-11-19 00:41:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 00:41:38,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:41:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:41:38,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:38,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58703316] [2024-11-19 00:41:38,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58703316] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:41:38,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:41:38,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2024-11-19 00:41:38,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341104114] [2024-11-19 00:41:38,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:38,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:41:38,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:38,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:41:38,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:41:38,497 INFO L87 Difference]: Start difference. First operand 283 states and 352 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:38,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:38,532 INFO L93 Difference]: Finished difference Result 499 states and 620 transitions. [2024-11-19 00:41:38,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:41:38,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2024-11-19 00:41:38,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:38,535 INFO L225 Difference]: With dead ends: 499 [2024-11-19 00:41:38,535 INFO L226 Difference]: Without dead ends: 283 [2024-11-19 00:41:38,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:41:38,536 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:38,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:41:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-19 00:41:38,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-11-19 00:41:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 255 states have (on average 1.219607843137255) internal successors, (311), 256 states have internal predecessors, (311), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:41:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 347 transitions. [2024-11-19 00:41:38,554 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 347 transitions. Word has length 67 [2024-11-19 00:41:38,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:38,554 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 347 transitions. [2024-11-19 00:41:38,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:38,555 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 347 transitions. [2024-11-19 00:41:38,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 00:41:38,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:38,556 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:38,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-19 00:41:38,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:38,761 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:38,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash -912413944, now seen corresponding path program 1 times [2024-11-19 00:41:38,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:38,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776721119] [2024-11-19 00:41:38,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:38,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:38,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:38,765 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:38,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-19 00:41:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:38,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 00:41:38,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:39,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 00:41:39,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-19 00:41:39,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 00:41:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 00:41:39,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:41:39,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:39,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776721119] [2024-11-19 00:41:39,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776721119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:41:39,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:41:39,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:41:39,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049756368] [2024-11-19 00:41:39,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:39,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:41:39,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:39,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:41:39,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:41:39,124 INFO L87 Difference]: Start difference. First operand 283 states and 347 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:39,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:39,273 INFO L93 Difference]: Finished difference Result 457 states and 552 transitions. [2024-11-19 00:41:39,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:41:39,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2024-11-19 00:41:39,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:39,275 INFO L225 Difference]: With dead ends: 457 [2024-11-19 00:41:39,275 INFO L226 Difference]: Without dead ends: 223 [2024-11-19 00:41:39,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:41:39,276 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 40 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:39,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 285 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:41:39,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-19 00:41:39,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2024-11-19 00:41:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 191 states have (on average 1.1465968586387434) internal successors, (219), 192 states have internal predecessors, (219), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 00:41:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 255 transitions. [2024-11-19 00:41:39,294 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 255 transitions. Word has length 67 [2024-11-19 00:41:39,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:39,294 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 255 transitions. [2024-11-19 00:41:39,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:41:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 255 transitions. [2024-11-19 00:41:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 00:41:39,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:39,296 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 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] [2024-11-19 00:41:39,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-19 00:41:39,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:39,500 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:39,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:39,500 INFO L85 PathProgramCache]: Analyzing trace with hash -253739721, now seen corresponding path program 1 times [2024-11-19 00:41:39,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:39,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137626967] [2024-11-19 00:41:39,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:39,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:39,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:39,502 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:39,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-19 00:41:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:39,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 00:41:39,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:39,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 00:41:39,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 00:41:39,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2024-11-19 00:41:40,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 102 [2024-11-19 00:41:40,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:40,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 37 [2024-11-19 00:41:40,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:40,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 27 [2024-11-19 00:41:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 22 proven. 116 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-19 00:41:41,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:41:41,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:41,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 43 [2024-11-19 00:41:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-19 00:41:42,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:42,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137626967] [2024-11-19 00:41:42,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137626967] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:41:42,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:41:42,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 26 [2024-11-19 00:41:42,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511383906] [2024-11-19 00:41:42,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:42,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 00:41:42,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:42,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 00:41:42,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2024-11-19 00:41:42,627 INFO L87 Difference]: Start difference. First operand 219 states and 255 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 00:41:56,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:41:56,887 INFO L93 Difference]: Finished difference Result 583 states and 679 transitions. [2024-11-19 00:41:56,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 00:41:56,889 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 125 [2024-11-19 00:41:56,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:41:56,890 INFO L225 Difference]: With dead ends: 583 [2024-11-19 00:41:56,890 INFO L226 Difference]: Without dead ends: 427 [2024-11-19 00:41:56,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=450, Invalid=2000, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 00:41:56,892 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 488 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:41:56,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 545 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-11-19 00:41:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-19 00:41:56,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 322. [2024-11-19 00:41:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 278 states have (on average 1.1510791366906474) internal successors, (320), 280 states have internal predecessors, (320), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:41:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 376 transitions. [2024-11-19 00:41:56,930 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 376 transitions. Word has length 125 [2024-11-19 00:41:56,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:41:56,931 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 376 transitions. [2024-11-19 00:41:56,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 00:41:56,931 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 376 transitions. [2024-11-19 00:41:56,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 00:41:56,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:41:56,932 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:41:56,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-19 00:41:57,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:57,133 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:41:57,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:41:57,133 INFO L85 PathProgramCache]: Analyzing trace with hash -226674119, now seen corresponding path program 1 times [2024-11-19 00:41:57,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:41:57,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408621757] [2024-11-19 00:41:57,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:41:57,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:41:57,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:41:57,136 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:41:57,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-19 00:41:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:41:57,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 00:41:57,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:41:57,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 00:41:57,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 00:41:57,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2024-11-19 00:41:57,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2024-11-19 00:41:57,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:57,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 42 [2024-11-19 00:41:58,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-11-19 00:41:58,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:41:58,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 31 [2024-11-19 00:41:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 22 proven. 116 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-19 00:41:58,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:41:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-19 00:41:59,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:41:59,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408621757] [2024-11-19 00:41:59,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408621757] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:41:59,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:41:59,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 20 [2024-11-19 00:41:59,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299614091] [2024-11-19 00:41:59,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:41:59,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:41:59,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:41:59,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:41:59,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:41:59,214 INFO L87 Difference]: Start difference. First operand 322 states and 376 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 00:42:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:42:00,422 INFO L93 Difference]: Finished difference Result 770 states and 909 transitions. [2024-11-19 00:42:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:42:00,422 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 125 [2024-11-19 00:42:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:42:00,430 INFO L225 Difference]: With dead ends: 770 [2024-11-19 00:42:00,430 INFO L226 Difference]: Without dead ends: 592 [2024-11-19 00:42:00,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2024-11-19 00:42:00,431 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 450 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:42:00,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 498 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 00:42:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-11-19 00:42:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 384. [2024-11-19 00:42:00,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 340 states have (on average 1.1764705882352942) internal successors, (400), 342 states have internal predecessors, (400), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:42:00,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 456 transitions. [2024-11-19 00:42:00,491 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 456 transitions. Word has length 125 [2024-11-19 00:42:00,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:42:00,492 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 456 transitions. [2024-11-19 00:42:00,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 00:42:00,492 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 456 transitions. [2024-11-19 00:42:00,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 00:42:00,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:42:00,493 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:42:00,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-11-19 00:42:00,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:42:00,694 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:42:00,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:42:00,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2105805065, now seen corresponding path program 1 times [2024-11-19 00:42:00,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:42:00,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113969944] [2024-11-19 00:42:00,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:00,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:42:00,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:42:00,698 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:42:00,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-19 00:42:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:42:01,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 00:42:01,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:42:01,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 00:42:01,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 00:42:01,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 39 [2024-11-19 00:42:01,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2024-11-19 00:42:01,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-19 00:42:01,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 68 [2024-11-19 00:42:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 134 proven. 4 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-19 00:42:02,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:42:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-19 00:42:02,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:42:02,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113969944] [2024-11-19 00:42:02,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113969944] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 00:42:02,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:42:02,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2024-11-19 00:42:02,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310715346] [2024-11-19 00:42:02,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:42:02,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:42:02,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:42:02,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:42:02,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:42:02,456 INFO L87 Difference]: Start difference. First operand 384 states and 456 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:42:02,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:42:02,734 INFO L93 Difference]: Finished difference Result 679 states and 814 transitions. [2024-11-19 00:42:02,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:42:02,736 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 125 [2024-11-19 00:42:02,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:42:02,738 INFO L225 Difference]: With dead ends: 679 [2024-11-19 00:42:02,738 INFO L226 Difference]: Without dead ends: 439 [2024-11-19 00:42:02,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-11-19 00:42:02,740 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 73 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:42:02,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 641 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:42:02,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-19 00:42:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 378. [2024-11-19 00:42:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 334 states have (on average 1.1736526946107784) internal successors, (392), 336 states have internal predecessors, (392), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:42:02,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 448 transitions. [2024-11-19 00:42:02,792 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 448 transitions. Word has length 125 [2024-11-19 00:42:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:42:02,793 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 448 transitions. [2024-11-19 00:42:02,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 00:42:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 448 transitions. [2024-11-19 00:42:02,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 00:42:02,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:42:02,796 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:42:02,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-19 00:42:02,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:42:02,996 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:42:02,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:42:02,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1683103239, now seen corresponding path program 1 times [2024-11-19 00:42:02,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:42:02,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089764935] [2024-11-19 00:42:02,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:02,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:42:02,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:42:03,000 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:42:03,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-19 00:42:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:42:03,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 00:42:03,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:42:03,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 00:42:03,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 00:42:03,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-19 00:42:04,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 59 [2024-11-19 00:42:04,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-19 00:42:04,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 59 [2024-11-19 00:42:04,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:42:04,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 62 [2024-11-19 00:42:04,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2024-11-19 00:42:04,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:42:04,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 89 [2024-11-19 00:42:04,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2024-11-19 00:42:04,609 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 153 proven. 9 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-19 00:42:04,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:42:11,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:42:11,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089764935] [2024-11-19 00:42:11,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089764935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:42:11,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1862898290] [2024-11-19 00:42:11,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:11,927 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:42:11,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:42:11,928 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:42:11,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2024-11-19 00:42:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:42:12,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 00:42:12,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:42:13,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 00:42:13,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 00:42:14,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-19 00:42:15,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 50 [2024-11-19 00:42:15,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-19 00:42:15,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2024-11-19 00:42:16,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:42:16,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 44 [2024-11-19 00:42:16,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:42:16,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 00:42:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 153 proven. 9 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-19 00:42:16,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:42:22,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1862898290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:42:22,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:42:22,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2024-11-19 00:42:22,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221057526] [2024-11-19 00:42:22,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:42:22,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 00:42:22,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:42:22,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 00:42:22,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 00:42:22,339 INFO L87 Difference]: Start difference. First operand 378 states and 448 transitions. Second operand has 25 states, 25 states have (on average 6.2) internal successors, (155), 24 states have internal predecessors, (155), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-19 00:42:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:42:26,076 INFO L93 Difference]: Finished difference Result 935 states and 1111 transitions. [2024-11-19 00:42:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 00:42:26,077 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.2) internal successors, (155), 24 states have internal predecessors, (155), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 125 [2024-11-19 00:42:26,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:42:26,079 INFO L225 Difference]: With dead ends: 935 [2024-11-19 00:42:26,079 INFO L226 Difference]: Without dead ends: 701 [2024-11-19 00:42:26,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 270 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=267, Invalid=1455, Unknown=0, NotChecked=0, Total=1722 [2024-11-19 00:42:26,081 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 344 mSDsluCounter, 1519 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:42:26,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1674 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 00:42:26,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-19 00:42:26,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 396. [2024-11-19 00:42:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 352 states have (on average 1.1761363636363635) internal successors, (414), 354 states have internal predecessors, (414), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 00:42:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 470 transitions. [2024-11-19 00:42:26,126 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 470 transitions. Word has length 125 [2024-11-19 00:42:26,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:42:26,126 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 470 transitions. [2024-11-19 00:42:26,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.2) internal successors, (155), 24 states have internal predecessors, (155), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-19 00:42:26,126 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 470 transitions. [2024-11-19 00:42:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 00:42:26,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:42:26,127 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:42:26,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2024-11-19 00:42:26,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-11-19 00:42:26,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:42:26,530 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:42:26,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:42:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1817116745, now seen corresponding path program 1 times [2024-11-19 00:42:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:42:26,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643277862] [2024-11-19 00:42:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:26,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:42:26,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:42:26,532 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:42:26,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-19 00:42:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:42:26,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 00:42:26,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:42:27,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 00:42:27,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-19 00:42:27,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-19 00:42:27,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2024-11-19 00:42:27,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-19 00:42:27,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2024-11-19 00:42:27,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:42:27,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 42 [2024-11-19 00:42:28,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-19 00:42:28,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 00:42:28,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 30 [2024-11-19 00:42:28,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-19 00:42:28,152 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 153 proven. 9 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-19 00:42:28,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:42:29,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:42:29,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643277862] [2024-11-19 00:42:29,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643277862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:42:29,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [992331314] [2024-11-19 00:42:29,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:42:29,607 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:42:29,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:42:29,608 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:42:29,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process