./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.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 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:16:51,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:16:51,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:16:51,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:16:51,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:16:51,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:16:51,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:16:51,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:16:51,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:16:51,134 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:16:51,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:16:51,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:16:51,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:16:51,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:16:51,137 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:16:51,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:16:51,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:16:51,140 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:16:51,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:16:51,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:16:51,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:16:51,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:16:51,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:16:51,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:16:51,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:16:51,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:16:51,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:16:51,146 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:16:51,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:16:51,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:16:51,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:16:51,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:16:51,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:16:51,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:16:51,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:16:51,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:16:51,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:16:51,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:16:51,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:16:51,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:16:51,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:16:51,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:16:51,151 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 -> 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe [2024-10-24 11:16:51,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:16:51,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:16:51,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:16:51,468 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:16:51,468 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:16:51,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i [2024-10-24 11:16:52,981 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:16:53,215 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:16:53,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i [2024-10-24 11:16:53,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014b3a312/6248a1e11404464080ecf0c7e07c6564/FLAG1766ddd5e [2024-10-24 11:16:53,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014b3a312/6248a1e11404464080ecf0c7e07c6564 [2024-10-24 11:16:53,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:16:53,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:16:53,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:16:53,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:16:53,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:16:53,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:16:53" (1/1) ... [2024-10-24 11:16:53,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe3fdfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:16:53, skipping insertion in model container [2024-10-24 11:16:53,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:16:53" (1/1) ... [2024-10-24 11:16:53,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:16:53,416 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i[916,929] [2024-10-24 11:16:53,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:16:53,481 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:16:53,491 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i[916,929] [2024-10-24 11:16:53,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:16:53,538 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:16:53,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:16:53 WrapperNode [2024-10-24 11:16:53,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:16:53,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:16:53,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:16:53,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:16:53,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:16:53" (1/1) ... [2024-10-24 11:16:53,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:16:53" (1/1) ... [2024-10-24 11:16:53,589 INFO L138 Inliner]: procedures = 29, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 402 [2024-10-24 11:16:53,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:16:53,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:16:53,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:16:53,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:16:53,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:16:53" (1/1) ... [2024-10-24 11:16:53,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:16:53" (1/1) ... [2024-10-24 11:16:53,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:16:53" (1/1) ... [2024-10-24 11:16:53,627 INFO L175 MemorySlicer]: Split 101 memory accesses to 5 slices as follows [2, 37, 8, 40, 14]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 3, 2]. The 16 writes are split as follows [0, 9, 1, 3, 3]. [2024-10-24 11:16:53,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:16:53" (1/1) ... [2024-10-24 11:16:53,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:16:53" (1/1) ... [2024-10-24 11:16:53,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:16:53" (1/1) ... [2024-10-24 11:16:53,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:16:53" (1/1) ... [2024-10-24 11:16:53,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:16:53" (1/1) ... [2024-10-24 11:16:53,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:16:53" (1/1) ... [2024-10-24 11:16:53,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:16:53,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:16:53,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:16:53,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:16:53,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:16:53" (1/1) ... [2024-10-24 11:16:53,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:16:53,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:16:53,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:16:53,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:16:53,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:16:53,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:16:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:16:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:16:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:16:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:16:53,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:16:53,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:16:53,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:16:53,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:16:53,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:16:53,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:16:53,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:16:53,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:16:53,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:16:53,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:16:53,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:16:53,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:16:53,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:16:53,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:16:53,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:16:53,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:16:53,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:16:53,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:16:53,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:16:53,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:16:53,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:16:53,778 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:16:53,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:16:53,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:16:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:16:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:16:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:16:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:16:53,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:16:53,904 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:16:53,906 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:16:54,382 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-10-24 11:16:54,383 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:16:54,422 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:16:54,423 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:16:54,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:16:54 BoogieIcfgContainer [2024-10-24 11:16:54,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:16:54,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:16:54,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:16:54,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:16:54,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:16:53" (1/3) ... [2024-10-24 11:16:54,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ab80b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:16:54, skipping insertion in model container [2024-10-24 11:16:54,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:16:53" (2/3) ... [2024-10-24 11:16:54,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ab80b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:16:54, skipping insertion in model container [2024-10-24 11:16:54,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:16:54" (3/3) ... [2024-10-24 11:16:54,433 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-46.i [2024-10-24 11:16:54,450 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:16:54,450 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:16:54,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:16:54,552 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;@4f222fdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:16:54,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:16:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:16:54,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 11:16:54,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:54,574 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:54,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:54,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:54,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2041865467, now seen corresponding path program 1 times [2024-10-24 11:16:54,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:16:54,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675803491] [2024-10-24 11:16:54,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:54,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:16:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:54,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:16:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:54,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:16:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:54,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:16:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:54,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:16:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:54,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:16:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:54,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:16:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:54,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:16:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:54,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:16:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:54,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:16:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:54,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:16:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:54,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:16:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:54,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:16:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:54,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:16:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:54,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:16:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:16:55,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:16:55,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675803491] [2024-10-24 11:16:55,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675803491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:55,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:55,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:16:55,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974414493] [2024-10-24 11:16:55,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:55,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:16:55,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:16:55,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:16:55,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:16:55,044 INFO L87 Difference]: Start difference. First operand has 94 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:16:55,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:55,095 INFO L93 Difference]: Finished difference Result 185 states and 292 transitions. [2024-10-24 11:16:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:16:55,099 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-10-24 11:16:55,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:55,107 INFO L225 Difference]: With dead ends: 185 [2024-10-24 11:16:55,108 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 11:16:55,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:16:55,118 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:55,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:16:55,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 11:16:55,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-24 11:16:55,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:16:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2024-10-24 11:16:55,174 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 111 [2024-10-24 11:16:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:55,174 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2024-10-24 11:16:55,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:16:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2024-10-24 11:16:55,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 11:16:55,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:55,179 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:55,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:16:55,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:55,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:55,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1023704969, now seen corresponding path program 1 times [2024-10-24 11:16:55,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:16:55,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119923986] [2024-10-24 11:16:55,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:55,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:16:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:56,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:16:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:56,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:16:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:56,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:16:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:56,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:16:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:56,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:16:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:56,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:16:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:56,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:16:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:56,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:16:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:56,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:16:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:56,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:16:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:56,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:16:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:56,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:16:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:56,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:16:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:56,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:16:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:56,284 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:16:56,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:16:56,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119923986] [2024-10-24 11:16:56,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119923986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:56,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:56,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:16:56,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268063710] [2024-10-24 11:16:56,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:56,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:16:56,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:16:56,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:16:56,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:16:56,293 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:16:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:56,806 INFO L93 Difference]: Finished difference Result 353 states and 518 transitions. [2024-10-24 11:16:56,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:16:56,807 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-10-24 11:16:56,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:56,813 INFO L225 Difference]: With dead ends: 353 [2024-10-24 11:16:56,814 INFO L226 Difference]: Without dead ends: 262 [2024-10-24 11:16:56,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:16:56,817 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 279 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:56,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 729 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:16:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-24 11:16:56,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 255. [2024-10-24 11:16:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 214 states have (on average 1.411214953271028) internal successors, (302), 215 states have internal predecessors, (302), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-24 11:16:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 376 transitions. [2024-10-24 11:16:56,864 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 376 transitions. Word has length 111 [2024-10-24 11:16:56,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:56,865 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 376 transitions. [2024-10-24 11:16:56,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:16:56,865 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 376 transitions. [2024-10-24 11:16:56,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 11:16:56,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:56,870 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:56,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:16:56,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:56,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:56,871 INFO L85 PathProgramCache]: Analyzing trace with hash -765539531, now seen corresponding path program 1 times [2024-10-24 11:16:56,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:16:56,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112826617] [2024-10-24 11:16:56,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:56,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:16:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:57,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:16:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:57,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:16:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:57,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:16:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:57,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:16:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:57,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:16:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:57,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:16:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:57,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:16:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:57,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:16:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:57,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:16:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:57,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:16:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:57,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:16:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:57,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:16:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:57,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:16:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:57,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:16:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:16:57,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:16:57,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112826617] [2024-10-24 11:16:57,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112826617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:16:57,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:16:57,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:16:57,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179663038] [2024-10-24 11:16:57,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:16:57,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:16:57,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:16:57,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:16:57,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:16:57,270 INFO L87 Difference]: Start difference. First operand 255 states and 376 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:16:57,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:16:57,430 INFO L93 Difference]: Finished difference Result 769 states and 1135 transitions. [2024-10-24 11:16:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:16:57,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-10-24 11:16:57,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:16:57,435 INFO L225 Difference]: With dead ends: 769 [2024-10-24 11:16:57,436 INFO L226 Difference]: Without dead ends: 515 [2024-10-24 11:16:57,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:16:57,438 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 120 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:16:57,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 500 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:16:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-24 11:16:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 291. [2024-10-24 11:16:57,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 250 states have (on average 1.404) internal successors, (351), 251 states have internal predecessors, (351), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-24 11:16:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 425 transitions. [2024-10-24 11:16:57,465 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 425 transitions. Word has length 111 [2024-10-24 11:16:57,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:16:57,465 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 425 transitions. [2024-10-24 11:16:57,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:16:57,466 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2024-10-24 11:16:57,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 11:16:57,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:16:57,468 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:16:57,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:16:57,468 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:16:57,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:16:57,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1293635306, now seen corresponding path program 1 times [2024-10-24 11:16:57,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:16:57,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007159296] [2024-10-24 11:16:57,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:57,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:16:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:16:57,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1600954210] [2024-10-24 11:16:57,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:16:57,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:16:57,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:16:57,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:16:57,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:16:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:16:57,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 11:16:57,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:16:57,934 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 13 [2024-10-24 11:16:57,973 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 13 [2024-10-24 11:16:58,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:16:58,522 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 92 treesize of output 36 [2024-10-24 11:17:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:17:03,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:17:03,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:17:03,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007159296] [2024-10-24 11:17:03,136 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:17:03,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600954210] [2024-10-24 11:17:03,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600954210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:17:03,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:17:03,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:17:03,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403123580] [2024-10-24 11:17:03,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:17:03,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:17:03,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:17:03,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:17:03,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=44, Unknown=5, NotChecked=0, Total=72 [2024-10-24 11:17:03,139 INFO L87 Difference]: Start difference. First operand 291 states and 425 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:17:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:17:10,947 INFO L93 Difference]: Finished difference Result 752 states and 1090 transitions. [2024-10-24 11:17:10,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:17:10,948 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-10-24 11:17:10,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:17:10,954 INFO L225 Difference]: With dead ends: 752 [2024-10-24 11:17:10,955 INFO L226 Difference]: Without dead ends: 462 [2024-10-24 11:17:10,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=29, Invalid=56, Unknown=5, NotChecked=0, Total=90 [2024-10-24 11:17:10,956 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 204 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 1 mSolverCounterUnsat, 104 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 104 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:17:10,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 811 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 434 Invalid, 104 Unknown, 0 Unchecked, 7.1s Time] [2024-10-24 11:17:10,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-24 11:17:10,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 319. [2024-10-24 11:17:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 278 states have (on average 1.3992805755395683) internal successors, (389), 279 states have internal predecessors, (389), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-24 11:17:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 463 transitions. [2024-10-24 11:17:10,983 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 463 transitions. Word has length 113 [2024-10-24 11:17:10,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:17:10,983 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 463 transitions. [2024-10-24 11:17:10,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:17:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 463 transitions. [2024-10-24 11:17:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 11:17:10,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:17:10,986 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:17:11,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:17:11,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:17:11,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:17:11,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:17:11,191 INFO L85 PathProgramCache]: Analyzing trace with hash 282518056, now seen corresponding path program 1 times [2024-10-24 11:17:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:17:11,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044867229] [2024-10-24 11:17:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:17:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:17:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:12,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:17:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:12,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:17:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:12,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:17:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:12,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:17:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:12,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:17:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:12,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:17:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:12,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:17:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:12,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:17:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:12,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:17:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:12,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:17:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:12,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:17:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:12,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:17:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:12,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:17:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:12,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:17:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:17:12,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:17:12,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044867229] [2024-10-24 11:17:12,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044867229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:17:12,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:17:12,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:17:12,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641932697] [2024-10-24 11:17:12,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:17:12,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:17:12,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:17:12,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:17:12,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:17:12,905 INFO L87 Difference]: Start difference. First operand 319 states and 463 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:17:18,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:17:18,505 INFO L93 Difference]: Finished difference Result 709 states and 1025 transitions. [2024-10-24 11:17:18,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:17:18,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-10-24 11:17:18,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:17:18,510 INFO L225 Difference]: With dead ends: 709 [2024-10-24 11:17:18,510 INFO L226 Difference]: Without dead ends: 387 [2024-10-24 11:17:18,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:17:18,514 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 254 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:17:18,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 686 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-24 11:17:18,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-10-24 11:17:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 319. [2024-10-24 11:17:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 278 states have (on average 1.3920863309352518) internal successors, (387), 279 states have internal predecessors, (387), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-24 11:17:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 461 transitions. [2024-10-24 11:17:18,539 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 461 transitions. Word has length 113 [2024-10-24 11:17:18,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:17:18,540 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 461 transitions. [2024-10-24 11:17:18,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:17:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 461 transitions. [2024-10-24 11:17:18,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 11:17:18,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:17:18,545 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:17:18,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:17:18,546 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:17:18,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:17:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash 846172300, now seen corresponding path program 1 times [2024-10-24 11:17:18,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:17:18,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124273209] [2024-10-24 11:17:18,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:17:18,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:17:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:17:18,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [181179204] [2024-10-24 11:17:18,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:17:18,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:17:18,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:17:18,635 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:17:18,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 11:17:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:17:18,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:17:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:17:19,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:17:19,177 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:17:19,177 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:17:19,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 11:17:19,379 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,SelfDestructingSolverStorable5 [2024-10-24 11:17:19,383 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 11:17:19,507 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:17:19,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:17:19 BoogieIcfgContainer [2024-10-24 11:17:19,511 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:17:19,511 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:17:19,511 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:17:19,511 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:17:19,512 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:16:54" (3/4) ... [2024-10-24 11:17:19,513 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:17:19,514 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:17:19,514 INFO L158 Benchmark]: Toolchain (without parser) took 26271.95ms. Allocated memory was 144.7MB in the beginning and 230.7MB in the end (delta: 86.0MB). Free memory was 114.7MB in the beginning and 192.5MB in the end (delta: -77.7MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-10-24 11:17:19,514 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 144.7MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:17:19,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.93ms. Allocated memory is still 144.7MB. Free memory was 114.7MB in the beginning and 99.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 11:17:19,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.39ms. Allocated memory is still 144.7MB. Free memory was 99.1MB in the beginning and 95.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:17:19,515 INFO L158 Benchmark]: Boogie Preprocessor took 75.63ms. Allocated memory is still 144.7MB. Free memory was 95.4MB in the beginning and 91.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:17:19,515 INFO L158 Benchmark]: RCFGBuilder took 756.98ms. Allocated memory is still 144.7MB. Free memory was 91.2MB in the beginning and 56.6MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 11:17:19,515 INFO L158 Benchmark]: TraceAbstraction took 25084.50ms. Allocated memory was 144.7MB in the beginning and 230.7MB in the end (delta: 86.0MB). Free memory was 56.0MB in the beginning and 192.5MB in the end (delta: -136.4MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-10-24 11:17:19,516 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 230.7MB. Free memory is still 192.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:17:19,517 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.17ms. Allocated memory is still 144.7MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.93ms. Allocated memory is still 144.7MB. Free memory was 114.7MB in the beginning and 99.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.39ms. Allocated memory is still 144.7MB. Free memory was 99.1MB in the beginning and 95.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.63ms. Allocated memory is still 144.7MB. Free memory was 95.4MB in the beginning and 91.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 756.98ms. Allocated memory is still 144.7MB. Free memory was 91.2MB in the beginning and 56.6MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 25084.50ms. Allocated memory was 144.7MB in the beginning and 230.7MB in the end (delta: 86.0MB). Free memory was 56.0MB in the beginning and 192.5MB in the end (delta: -136.4MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 230.7MB. Free memory is still 192.5MB. 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 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L25-L27] double double_Array_0[1] = { 31.75 }; [L25-L27] double double_Array_0[1] = { 31.75 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L34] unsigned char last_1_BOOL_unsigned_char_Array_0_4_ = 1; [L35] signed short int last_1_signed_short_int_Array_0_1_ = -4; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] EXPR BOOL_unsigned_char_Array_0[4] [L97] last_1_BOOL_unsigned_char_Array_0_4_ = BOOL_unsigned_char_Array_0[4] [L98] EXPR signed_short_int_Array_0[1] [L98] last_1_signed_short_int_Array_0_1_ = signed_short_int_Array_0[1] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L74] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] 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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] 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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] 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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] 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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L78] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L80] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L81] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] double_Array_0[0] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[0] [L84] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L84] EXPR double_Array_0[0] [L84] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L88] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[2] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[2] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(signed_char_Array_0[2] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] RET assume_abort_if_not(signed_char_Array_0[2] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L92] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L93] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7: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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L109] RET updateVariables() [L110] CALL step() [L39] EXPR signed_short_int_Array_0[0] [L39] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L39] COND FALSE !(last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) [L44] EXPR signed_char_Array_0[2] [L44] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L44] EXPR ((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]) [L44] EXPR signed_char_Array_0[2] [L44] EXPR ((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L44] signed long int stepLocal_1 = (((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0])); [L45] EXPR signed_char_Array_0[0] [L45] EXPR signed_char_Array_0[2] [L45] signed long int stepLocal_0 = signed_char_Array_0[0] / signed_char_Array_0[2]; [L46] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L46] COND TRUE (- double_Array_0[0]) >= 16.75 [L47] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L47] COND TRUE stepLocal_0 >= signed_char_Array_0[0] [L48] COND TRUE stepLocal_1 > -32 [L49] BOOL_unsigned_char_Array_0[4] = 0 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L63] EXPR signed_char_Array_0[0] [L63] signed char stepLocal_2 = signed_char_Array_0[0]; [L64] EXPR signed_char_Array_0[0] [L64] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L64] EXPR signed_char_Array_0[0] | signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_2=-25] [L64] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L64] COND TRUE ((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < stepLocal_2 [L65] EXPR signed_short_int_Array_0[0] [L65] signed_short_int_Array_0[1] = (signed_short_int_Array_0[0] - 256) [L69] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L69] COND FALSE !(1 == signed_char_Array_0[2]) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) [L101] EXPR BOOL_unsigned_char_Array_0[4] [L101] EXPR ((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101-L102] return (((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) : 1) : 1) ; [L111] RET, EXPR property() [L111] 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_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.9s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 104 mSolverCounterUnknown, 857 SdHoareTripleChecker+Valid, 12.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 857 mSDsluCounter, 2857 SdHoareTripleChecker+Invalid, 12.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2192 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1348 IncrementalHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 665 mSDtfsCounter, 1348 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=319occurred in iteration=4, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 442 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 898 NumberOfCodeBlocks, 898 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 554 ConstructedInterpolants, 1 QuantifiedInterpolants, 2947 SizeOfPredicates, 3 NumberOfNonLiveVariables, 385 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1820/1820 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-10-24 11:17:19,732 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-24 11:17:19,760 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.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 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:17:21,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:17:21,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:17:21,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:17:21,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:17:21,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:17:21,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:17:21,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:17:21,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:17:21,803 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:17:21,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:17:21,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:17:21,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:17:21,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:17:21,805 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:17:21,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:17:21,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:17:21,807 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:17:21,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:17:21,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:17:21,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:17:21,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:17:21,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:17:21,811 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:17:21,813 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:17:21,813 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:17:21,813 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:17:21,814 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:17:21,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:17:21,814 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:17:21,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:17:21,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:17:21,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:17:21,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:17:21,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:17:21,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:17:21,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:17:21,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:17:21,817 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:17:21,818 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:17:21,818 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:17:21,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:17:21,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:17:21,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:17:21,819 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:17:21,819 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 -> 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe [2024-10-24 11:17:22,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:17:22,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:17:22,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:17:22,179 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:17:22,180 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:17:22,182 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i [2024-10-24 11:17:23,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:17:23,976 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:17:23,976 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i [2024-10-24 11:17:23,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed745dc2/9a29ed14b2c24adca6b9917c61d608b3/FLAG30513cdb3 [2024-10-24 11:17:24,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed745dc2/9a29ed14b2c24adca6b9917c61d608b3 [2024-10-24 11:17:24,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:17:24,337 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:17:24,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:17:24,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:17:24,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:17:24,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:17:24" (1/1) ... [2024-10-24 11:17:24,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550e628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:24, skipping insertion in model container [2024-10-24 11:17:24,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:17:24" (1/1) ... [2024-10-24 11:17:24,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:17:24,568 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i[916,929] [2024-10-24 11:17:24,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:17:24,654 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:17:24,664 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i[916,929] [2024-10-24 11:17:24,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:17:24,746 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:17:24,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:24 WrapperNode [2024-10-24 11:17:24,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:17:24,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:17:24,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:17:24,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:17:24,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:24" (1/1) ... [2024-10-24 11:17:24,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:24" (1/1) ... [2024-10-24 11:17:24,821 INFO L138 Inliner]: procedures = 33, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 381 [2024-10-24 11:17:24,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:17:24,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:17:24,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:17:24,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:17:24,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:24" (1/1) ... [2024-10-24 11:17:24,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:24" (1/1) ... [2024-10-24 11:17:24,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:24" (1/1) ... [2024-10-24 11:17:24,886 INFO L175 MemorySlicer]: Split 101 memory accesses to 5 slices as follows [2, 37, 8, 40, 14]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 3, 2]. The 16 writes are split as follows [0, 9, 1, 3, 3]. [2024-10-24 11:17:24,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:24" (1/1) ... [2024-10-24 11:17:24,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:24" (1/1) ... [2024-10-24 11:17:24,917 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:24" (1/1) ... [2024-10-24 11:17:24,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:24" (1/1) ... [2024-10-24 11:17:24,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:24" (1/1) ... [2024-10-24 11:17:24,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:24" (1/1) ... [2024-10-24 11:17:24,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:17:24,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:17:24,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:17:24,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:17:24,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:24" (1/1) ... [2024-10-24 11:17:24,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:17:24,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:17:24,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:17:24,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:17:25,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:17:25,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:17:25,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:17:25,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-24 11:17:25,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-24 11:17:25,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-24 11:17:25,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:17:25,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:17:25,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-24 11:17:25,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-24 11:17:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-24 11:17:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:17:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:17:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:17:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:17:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:17:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:17:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:17:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-24 11:17:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-24 11:17:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-24 11:17:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:17:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:17:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:17:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:17:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:17:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:17:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:17:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-24 11:17:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-24 11:17:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-24 11:17:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:17:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:17:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-24 11:17:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-24 11:17:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-24 11:17:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:17:25,060 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:17:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:17:25,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:17:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:17:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:17:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:17:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:17:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:17:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:17:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:17:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-24 11:17:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-24 11:17:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-24 11:17:25,187 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:17:25,189 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:17:25,838 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-10-24 11:17:25,838 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:17:25,882 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:17:25,882 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:17:25,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:17:25 BoogieIcfgContainer [2024-10-24 11:17:25,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:17:25,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:17:25,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:17:25,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:17:25,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:17:24" (1/3) ... [2024-10-24 11:17:25,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf274e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:17:25, skipping insertion in model container [2024-10-24 11:17:25,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:17:24" (2/3) ... [2024-10-24 11:17:25,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf274e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:17:25, skipping insertion in model container [2024-10-24 11:17:25,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:17:25" (3/3) ... [2024-10-24 11:17:25,895 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-46.i [2024-10-24 11:17:25,912 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:17:25,913 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:17:25,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:17:25,986 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;@7c52396e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:17:25,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:17:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 70 states have internal predecessors, (100), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:17:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 11:17:26,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:17:26,007 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:17:26,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:17:26,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:17:26,011 INFO L85 PathProgramCache]: Analyzing trace with hash 309420061, now seen corresponding path program 1 times [2024-10-24 11:17:26,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:17:26,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179630085] [2024-10-24 11:17:26,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:17:26,023 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-10-24 11:17:26,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:17:26,025 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-10-24 11:17:26,043 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-10-24 11:17:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:26,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:17:26,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:17:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-10-24 11:17:26,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:17:26,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:17:26,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179630085] [2024-10-24 11:17:26,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179630085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:17:26,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:17:26,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:17:26,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776921251] [2024-10-24 11:17:26,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:17:26,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:17:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:17:26,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:17:26,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:17:26,407 INFO L87 Difference]: Start difference. First operand has 86 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 70 states have internal predecessors, (100), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:17:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:17:26,464 INFO L93 Difference]: Finished difference Result 169 states and 268 transitions. [2024-10-24 11:17:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:17:26,467 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2024-10-24 11:17:26,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:17:26,477 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:17:26,477 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 11:17:26,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:17:26,485 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:17:26,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:17:26,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 11:17:26,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 11:17:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:17:26,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2024-10-24 11:17:26,544 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 109 [2024-10-24 11:17:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:17:26,544 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2024-10-24 11:17:26,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:17:26,544 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2024-10-24 11:17:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 11:17:26,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:17:26,550 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:17:26,561 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 (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:17:26,751 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-10-24 11:17:26,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:17:26,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:17:26,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1602147687, now seen corresponding path program 1 times [2024-10-24 11:17:26,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:17:26,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516668316] [2024-10-24 11:17:26,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:17:26,754 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-10-24 11:17:26,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:17:26,755 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-10-24 11:17:26,757 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-10-24 11:17:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:27,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 11:17:27,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:17:27,085 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-10-24 11:17:27,713 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-10-24 11:17:28,759 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 30 treesize of output 18 [2024-10-24 11:17:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 127 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-24 11:17:29,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:17:30,805 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 23 treesize of output 15 [2024-10-24 11:17:31,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:17:31,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516668316] [2024-10-24 11:17:31,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516668316] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:17:31,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1561336480] [2024-10-24 11:17:31,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:17:31,192 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:17:31,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:17:31,195 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:17:31,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-24 11:17:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:31,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 11:17:31,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:17:31,818 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-10-24 11:17:32,371 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-10-24 11:17:33,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 30 treesize of output 18 [2024-10-24 11:17:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-24 11:17:33,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:17:34,460 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 23 treesize of output 15 [2024-10-24 11:17:34,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1561336480] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:17:34,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:17:34,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 17 [2024-10-24 11:17:34,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35961301] [2024-10-24 11:17:34,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:17:34,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 11:17:34,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:17:34,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 11:17:34,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2024-10-24 11:17:34,591 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand has 18 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2024-10-24 11:17:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:17:48,574 INFO L93 Difference]: Finished difference Result 338 states and 484 transitions. [2024-10-24 11:17:48,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-24 11:17:48,575 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) Word has length 109 [2024-10-24 11:17:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:17:48,579 INFO L225 Difference]: With dead ends: 338 [2024-10-24 11:17:48,579 INFO L226 Difference]: Without dead ends: 255 [2024-10-24 11:17:48,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 252 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=641, Invalid=2115, Unknown=0, NotChecked=0, Total=2756 [2024-10-24 11:17:48,581 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 618 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:17:48,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 972 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2024-10-24 11:17:48,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-24 11:17:48,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 203. [2024-10-24 11:17:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 159 states have (on average 1.3459119496855345) internal successors, (214), 160 states have internal predecessors, (214), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-24 11:17:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 288 transitions. [2024-10-24 11:17:48,614 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 288 transitions. Word has length 109 [2024-10-24 11:17:48,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:17:48,615 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 288 transitions. [2024-10-24 11:17:48,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2024-10-24 11:17:48,616 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 288 transitions. [2024-10-24 11:17:48,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 11:17:48,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:17:48,619 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:17:48,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-24 11:17:48,827 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-10-24 11:17:49,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-10-24 11:17:49,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:17:49,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:17:49,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1343982249, now seen corresponding path program 1 times [2024-10-24 11:17:49,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:17:49,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723566261] [2024-10-24 11:17:49,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:17:49,021 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-10-24 11:17:49,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:17:49,023 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-10-24 11:17:49,024 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-10-24 11:17:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:49,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:17:49,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:17:49,240 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-10-24 11:17:49,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 43 treesize of output 25 [2024-10-24 11:17:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:17:49,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:17:49,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:17:49,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723566261] [2024-10-24 11:17:49,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723566261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:17:49,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:17:49,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:17:49,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000295266] [2024-10-24 11:17:49,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:17:49,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:17:49,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:17:49,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:17:49,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:17:49,310 INFO L87 Difference]: Start difference. First operand 203 states and 288 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:17:49,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:17:49,642 INFO L93 Difference]: Finished difference Result 472 states and 680 transitions. [2024-10-24 11:17:49,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:17:49,643 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2024-10-24 11:17:49,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:17:49,648 INFO L225 Difference]: With dead ends: 472 [2024-10-24 11:17:49,650 INFO L226 Difference]: Without dead ends: 349 [2024-10-24 11:17:49,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:17:49,654 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 110 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:17:49,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 434 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:17:49,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-24 11:17:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 219. [2024-10-24 11:17:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 175 states have (on average 1.3428571428571427) internal successors, (235), 176 states have internal predecessors, (235), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-24 11:17:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 309 transitions. [2024-10-24 11:17:49,705 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 309 transitions. Word has length 109 [2024-10-24 11:17:49,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:17:49,706 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 309 transitions. [2024-10-24 11:17:49,706 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:17:49,706 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 309 transitions. [2024-10-24 11:17:49,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 11:17:49,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:17:49,712 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:17:49,725 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 (5)] Ended with exit code 0 [2024-10-24 11:17:49,912 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-10-24 11:17:49,912 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:17:49,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:17:49,913 INFO L85 PathProgramCache]: Analyzing trace with hash -314329396, now seen corresponding path program 1 times [2024-10-24 11:17:49,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:17:49,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278445706] [2024-10-24 11:17:49,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:17:49,914 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-10-24 11:17:49,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:17:49,916 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-10-24 11:17:49,917 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-10-24 11:17:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:50,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 11:17:50,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:17:51,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:17:51,546 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 144 treesize of output 54 [2024-10-24 11:17:51,622 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-24 11:17:51,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:17:51,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:17:51,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278445706] [2024-10-24 11:17:51,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278445706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:17:51,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:17:51,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:17:51,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405334] [2024-10-24 11:17:51,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:17:51,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:17:51,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:17:51,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:17:51,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:17:51,624 INFO L87 Difference]: Start difference. First operand 219 states and 309 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:17:52,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:17:52,974 INFO L93 Difference]: Finished difference Result 652 states and 921 transitions. [2024-10-24 11:17:52,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:17:52,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-10-24 11:17:52,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:17:52,980 INFO L225 Difference]: With dead ends: 652 [2024-10-24 11:17:52,980 INFO L226 Difference]: Without dead ends: 515 [2024-10-24 11:17:52,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:17:52,981 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 252 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:17:52,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1017 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 11:17:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-24 11:17:53,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 495. [2024-10-24 11:17:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 400 states have (on average 1.345) internal successors, (538), 406 states have internal predecessors, (538), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 11:17:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 698 transitions. [2024-10-24 11:17:53,035 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 698 transitions. Word has length 111 [2024-10-24 11:17:53,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:17:53,036 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 698 transitions. [2024-10-24 11:17:53,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:17:53,036 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 698 transitions. [2024-10-24 11:17:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 11:17:53,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:17:53,038 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:17:53,049 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-10-24 11:17:53,239 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-10-24 11:17:53,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:17:53,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:17:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2056572836, now seen corresponding path program 1 times [2024-10-24 11:17:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:17:53,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473846018] [2024-10-24 11:17:53,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:17:53,241 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-10-24 11:17:53,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:17:53,243 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-10-24 11:17:53,244 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-10-24 11:17:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:53,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:17:53,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:17:53,451 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 23 treesize of output 11 [2024-10-24 11:17:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:17:53,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:17:53,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:17:53,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473846018] [2024-10-24 11:17:53,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473846018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:17:53,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:17:53,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:17:53,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527289587] [2024-10-24 11:17:53,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:17:53,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:17:53,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:17:53,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:17:53,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:17:53,528 INFO L87 Difference]: Start difference. First operand 495 states and 698 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:17:55,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:17:55,225 INFO L93 Difference]: Finished difference Result 981 states and 1393 transitions. [2024-10-24 11:17:55,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:17:55,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-10-24 11:17:55,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:17:55,233 INFO L225 Difference]: With dead ends: 981 [2024-10-24 11:17:55,234 INFO L226 Difference]: Without dead ends: 655 [2024-10-24 11:17:55,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:17:55,236 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 76 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:17:55,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 380 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 11:17:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-10-24 11:17:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 495. [2024-10-24 11:17:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 400 states have (on average 1.3375) internal successors, (535), 406 states have internal predecessors, (535), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 11:17:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 695 transitions. [2024-10-24 11:17:55,292 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 695 transitions. Word has length 111 [2024-10-24 11:17:55,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:17:55,293 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 695 transitions. [2024-10-24 11:17:55,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:17:55,294 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 695 transitions. [2024-10-24 11:17:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 11:17:55,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:17:55,296 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:17:55,305 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-10-24 11:17:55,497 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-10-24 11:17:55,497 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:17:55,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:17:55,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1376514466, now seen corresponding path program 1 times [2024-10-24 11:17:55,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:17:55,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864859035] [2024-10-24 11:17:55,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:17:55,499 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-10-24 11:17:55,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:17:55,502 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-10-24 11:17:55,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 (8)] Waiting until timeout for monitored process [2024-10-24 11:17:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:55,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:17:55,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:17:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:17:55,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:17:55,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:17:55,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864859035] [2024-10-24 11:17:55,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864859035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:17:55,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:17:55,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:17:55,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115535974] [2024-10-24 11:17:55,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:17:55,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:17:55,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:17:55,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:17:55,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:17:55,694 INFO L87 Difference]: Start difference. First operand 495 states and 695 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:17:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:17:55,769 INFO L93 Difference]: Finished difference Result 884 states and 1254 transitions. [2024-10-24 11:17:55,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:17:55,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-10-24 11:17:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:17:55,776 INFO L225 Difference]: With dead ends: 884 [2024-10-24 11:17:55,776 INFO L226 Difference]: Without dead ends: 510 [2024-10-24 11:17:55,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 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-10-24 11:17:55,778 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:17:55,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 453 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:17:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-24 11:17:55,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2024-10-24 11:17:55,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 415 states have (on average 1.3253012048192772) internal successors, (550), 421 states have internal predecessors, (550), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 11:17:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 710 transitions. [2024-10-24 11:17:55,828 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 710 transitions. Word has length 111 [2024-10-24 11:17:55,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:17:55,829 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 710 transitions. [2024-10-24 11:17:55,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:17:55,829 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 710 transitions. [2024-10-24 11:17:55,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 11:17:55,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:17:55,831 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:17:55,842 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 (8)] Ended with exit code 0 [2024-10-24 11:17:56,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-10-24 11:17:56,035 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:17:56,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:17:56,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2069595342, now seen corresponding path program 1 times [2024-10-24 11:17:56,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:17:56,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874547427] [2024-10-24 11:17:56,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:17:56,036 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-10-24 11:17:56,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:17:56,039 INFO L229 MonitoredProcess]: Starting monitored process 9 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-10-24 11:17:56,039 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 (9)] Waiting until timeout for monitored process [2024-10-24 11:17:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:56,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:17:56,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:17:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-24 11:17:56,198 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:17:56,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:17:56,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874547427] [2024-10-24 11:17:56,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874547427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:17:56,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:17:56,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:17:56,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881022687] [2024-10-24 11:17:56,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:17:56,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:17:56,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:17:56,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:17:56,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:17:56,200 INFO L87 Difference]: Start difference. First operand 510 states and 710 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:17:56,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:17:56,287 INFO L93 Difference]: Finished difference Result 949 states and 1326 transitions. [2024-10-24 11:17:56,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:17:56,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-10-24 11:17:56,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:17:56,293 INFO L225 Difference]: With dead ends: 949 [2024-10-24 11:17:56,293 INFO L226 Difference]: Without dead ends: 510 [2024-10-24 11:17:56,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:17:56,295 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:17:56,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:17:56,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-10-24 11:17:56,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2024-10-24 11:17:56,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 415 states have (on average 1.3180722891566266) internal successors, (547), 421 states have internal predecessors, (547), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 11:17:56,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 707 transitions. [2024-10-24 11:17:56,340 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 707 transitions. Word has length 111 [2024-10-24 11:17:56,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:17:56,341 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 707 transitions. [2024-10-24 11:17:56,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:17:56,342 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 707 transitions. [2024-10-24 11:17:56,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 11:17:56,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:17:56,343 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:17:56,352 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 (9)] Ended with exit code 0 [2024-10-24 11:17:56,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-10-24 11:17:56,546 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:17:56,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:17:56,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1945679183, now seen corresponding path program 1 times [2024-10-24 11:17:56,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:17:56,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571557636] [2024-10-24 11:17:56,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:17:56,547 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-10-24 11:17:56,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:17:56,550 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-10-24 11:17:56,553 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-10-24 11:17:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:56,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:17:56,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:17:56,780 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-10-24 11:17:56,967 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:17:56,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:17:56,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:17:56,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571557636] [2024-10-24 11:17:56,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571557636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:17:56,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:17:56,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:17:56,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908712590] [2024-10-24 11:17:56,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:17:56,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:17:56,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:17:56,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:17:56,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:17:56,970 INFO L87 Difference]: Start difference. First operand 510 states and 707 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:17:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:17:57,372 INFO L93 Difference]: Finished difference Result 1526 states and 2138 transitions. [2024-10-24 11:17:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:17:57,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2024-10-24 11:17:57,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:17:57,378 INFO L225 Difference]: With dead ends: 1526 [2024-10-24 11:17:57,378 INFO L226 Difference]: Without dead ends: 1137 [2024-10-24 11:17:57,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:17:57,380 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 249 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:17:57,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 297 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:17:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2024-10-24 11:17:57,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1071. [2024-10-24 11:17:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 924 states have (on average 1.352813852813853) internal successors, (1250), 934 states have internal predecessors, (1250), 126 states have call successors, (126), 20 states have call predecessors, (126), 20 states have return successors, (126), 116 states have call predecessors, (126), 126 states have call successors, (126) [2024-10-24 11:17:57,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1502 transitions. [2024-10-24 11:17:57,461 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1502 transitions. Word has length 112 [2024-10-24 11:17:57,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:17:57,462 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1502 transitions. [2024-10-24 11:17:57,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:17:57,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1502 transitions. [2024-10-24 11:17:57,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 11:17:57,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:17:57,464 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:17:57,474 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 (10)] Forceful destruction successful, exit code 0 [2024-10-24 11:17:57,667 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-10-24 11:17:57,668 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:17:57,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:17:57,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2130433395, now seen corresponding path program 1 times [2024-10-24 11:17:57,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:17:57,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611665496] [2024-10-24 11:17:57,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:17:57,669 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-10-24 11:17:57,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:17:57,670 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-10-24 11:17:57,671 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-10-24 11:17:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:57,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 11:17:57,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:17:57,902 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-10-24 11:17:58,022 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 38 treesize of output 18 [2024-10-24 11:17:58,084 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 38 treesize of output 18 [2024-10-24 11:17:58,368 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 38 treesize of output 18 [2024-10-24 11:17:58,388 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 38 treesize of output 29 [2024-10-24 11:17:58,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:17:58,478 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 78 treesize of output 40 [2024-10-24 11:17:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 28 proven. 72 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:17:58,552 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:17:58,708 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:17:58,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:17:58,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611665496] [2024-10-24 11:17:58,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611665496] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:17:58,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:17:58,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 16 [2024-10-24 11:17:58,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260107094] [2024-10-24 11:17:58,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:17:58,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:17:58,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:17:58,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:17:58,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:17:58,710 INFO L87 Difference]: Start difference. First operand 1071 states and 1502 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:17:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:17:59,114 INFO L93 Difference]: Finished difference Result 2039 states and 2874 transitions. [2024-10-24 11:17:59,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:17:59,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2024-10-24 11:17:59,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:17:59,119 INFO L225 Difference]: With dead ends: 2039 [2024-10-24 11:17:59,120 INFO L226 Difference]: Without dead ends: 1093 [2024-10-24 11:17:59,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:17:59,122 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 41 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:17:59,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 654 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:17:59,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2024-10-24 11:17:59,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1061. [2024-10-24 11:17:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 914 states have (on average 1.3566739606126914) internal successors, (1240), 924 states have internal predecessors, (1240), 126 states have call successors, (126), 20 states have call predecessors, (126), 20 states have return successors, (126), 116 states have call predecessors, (126), 126 states have call successors, (126) [2024-10-24 11:17:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1492 transitions. [2024-10-24 11:17:59,176 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1492 transitions. Word has length 112 [2024-10-24 11:17:59,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:17:59,176 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1492 transitions. [2024-10-24 11:17:59,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:17:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1492 transitions. [2024-10-24 11:17:59,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 11:17:59,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:17:59,178 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:17:59,188 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 (11)] Ended with exit code 0 [2024-10-24 11:17:59,379 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-10-24 11:17:59,379 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:17:59,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:17:59,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2016083421, now seen corresponding path program 1 times [2024-10-24 11:17:59,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:17:59,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547736200] [2024-10-24 11:17:59,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:17:59,380 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-10-24 11:17:59,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:17:59,382 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-10-24 11:17:59,383 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-10-24 11:17:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:17:59,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 11:17:59,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:17:59,657 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-10-24 11:18:00,188 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-10-24 11:18:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 127 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-24 11:18:01,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:18:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:18:02,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:02,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547736200] [2024-10-24 11:18:02,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547736200] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:18:02,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:18:02,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2024-10-24 11:18:02,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034430765] [2024-10-24 11:18:02,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:02,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:18:02,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:02,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:18:02,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:18:02,471 INFO L87 Difference]: Start difference. First operand 1061 states and 1492 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:18:02,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:02,862 INFO L93 Difference]: Finished difference Result 2839 states and 4000 transitions. [2024-10-24 11:18:02,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:18:02,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-10-24 11:18:02,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:02,872 INFO L225 Difference]: With dead ends: 2839 [2024-10-24 11:18:02,872 INFO L226 Difference]: Without dead ends: 1903 [2024-10-24 11:18:02,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-10-24 11:18:02,875 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 73 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:02,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 473 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:18:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2024-10-24 11:18:02,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1447. [2024-10-24 11:18:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1300 states have (on average 1.3753846153846154) internal successors, (1788), 1310 states have internal predecessors, (1788), 126 states have call successors, (126), 20 states have call predecessors, (126), 20 states have return successors, (126), 116 states have call predecessors, (126), 126 states have call successors, (126) [2024-10-24 11:18:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2040 transitions. [2024-10-24 11:18:02,965 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2040 transitions. Word has length 113 [2024-10-24 11:18:02,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:02,966 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 2040 transitions. [2024-10-24 11:18:02,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:18:02,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2040 transitions. [2024-10-24 11:18:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 11:18:02,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:02,969 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:02,980 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 (12)] Ended with exit code 0 [2024-10-24 11:18:03,169 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-10-24 11:18:03,170 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:03,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:03,171 INFO L85 PathProgramCache]: Analyzing trace with hash -241076059, now seen corresponding path program 1 times [2024-10-24 11:18:03,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:03,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648662857] [2024-10-24 11:18:03,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:03,172 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-10-24 11:18:03,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:03,175 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-10-24 11:18:03,176 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-10-24 11:18:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:03,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:18:03,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:03,372 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-10-24 11:18:03,419 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 43 treesize of output 25 [2024-10-24 11:18:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:18:03,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:03,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:03,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648662857] [2024-10-24 11:18:03,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648662857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:03,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:03,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:18:03,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860220199] [2024-10-24 11:18:03,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:03,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:18:03,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:03,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:18:03,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:03,451 INFO L87 Difference]: Start difference. First operand 1447 states and 2040 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:18:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:03,682 INFO L93 Difference]: Finished difference Result 3100 states and 4387 transitions. [2024-10-24 11:18:03,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:03,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-10-24 11:18:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:03,691 INFO L225 Difference]: With dead ends: 3100 [2024-10-24 11:18:03,691 INFO L226 Difference]: Without dead ends: 1788 [2024-10-24 11:18:03,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:18:03,694 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 110 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:03,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 839 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2024-10-24 11:18:03,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1718. [2024-10-24 11:18:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1499 states have (on average 1.3495663775850566) internal successors, (2023), 1516 states have internal predecessors, (2023), 188 states have call successors, (188), 30 states have call predecessors, (188), 30 states have return successors, (188), 171 states have call predecessors, (188), 188 states have call successors, (188) [2024-10-24 11:18:03,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2399 transitions. [2024-10-24 11:18:03,798 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2399 transitions. Word has length 113 [2024-10-24 11:18:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:03,798 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 2399 transitions. [2024-10-24 11:18:03,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:18:03,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2399 transitions. [2024-10-24 11:18:03,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 11:18:03,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:03,801 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:03,810 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-10-24 11:18:04,002 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-10-24 11:18:04,003 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:04,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:04,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1716671094, now seen corresponding path program 1 times [2024-10-24 11:18:04,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:04,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754990204] [2024-10-24 11:18:04,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:04,004 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-10-24 11:18:04,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:04,007 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-10-24 11:18:04,008 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-10-24 11:18:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:04,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:18:04,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:04,245 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-10-24 11:18:04,281 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 43 treesize of output 25 [2024-10-24 11:18:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:18:04,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:04,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:04,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754990204] [2024-10-24 11:18:04,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754990204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:04,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:04,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:18:04,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374375729] [2024-10-24 11:18:04,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:04,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:18:04,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:04,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:18:04,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:18:04,329 INFO L87 Difference]: Start difference. First operand 1718 states and 2399 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:18:04,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:04,700 INFO L93 Difference]: Finished difference Result 3399 states and 4748 transitions. [2024-10-24 11:18:04,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:18:04,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-10-24 11:18:04,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:04,708 INFO L225 Difference]: With dead ends: 3399 [2024-10-24 11:18:04,709 INFO L226 Difference]: Without dead ends: 1816 [2024-10-24 11:18:04,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:18:04,713 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 109 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:04,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 554 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:18:04,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2024-10-24 11:18:04,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1782. [2024-10-24 11:18:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1563 states have (on average 1.3352527191298784) internal successors, (2087), 1580 states have internal predecessors, (2087), 188 states have call successors, (188), 30 states have call predecessors, (188), 30 states have return successors, (188), 171 states have call predecessors, (188), 188 states have call successors, (188) [2024-10-24 11:18:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2463 transitions. [2024-10-24 11:18:04,816 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2463 transitions. Word has length 113 [2024-10-24 11:18:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:04,816 INFO L471 AbstractCegarLoop]: Abstraction has 1782 states and 2463 transitions. [2024-10-24 11:18:04,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:18:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2463 transitions. [2024-10-24 11:18:04,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 11:18:04,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:04,819 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:04,829 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 (14)] Forceful destruction successful, exit code 0 [2024-10-24 11:18:05,022 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-10-24 11:18:05,023 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:05,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:05,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1974836532, now seen corresponding path program 1 times [2024-10-24 11:18:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:05,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410555825] [2024-10-24 11:18:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:05,024 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-10-24 11:18:05,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:05,027 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-10-24 11:18:05,029 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-10-24 11:18:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:05,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 11:18:05,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:06,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:06,464 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 145 treesize of output 55 [2024-10-24 11:18:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-24 11:18:06,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:06,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:06,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410555825] [2024-10-24 11:18:06,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410555825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:06,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:06,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:18:06,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411450400] [2024-10-24 11:18:06,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:06,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:18:06,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:06,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:18:06,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:18:06,538 INFO L87 Difference]: Start difference. First operand 1782 states and 2463 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:18:07,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:07,681 INFO L93 Difference]: Finished difference Result 3334 states and 4599 transitions. [2024-10-24 11:18:07,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:18:07,683 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2024-10-24 11:18:07,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:07,694 INFO L225 Difference]: With dead ends: 3334 [2024-10-24 11:18:07,694 INFO L226 Difference]: Without dead ends: 1687 [2024-10-24 11:18:07,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:18:07,698 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 230 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:07,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 723 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 11:18:07,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2024-10-24 11:18:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1533. [2024-10-24 11:18:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1332 states have (on average 1.3273273273273274) internal successors, (1768), 1346 states have internal predecessors, (1768), 170 states have call successors, (170), 30 states have call predecessors, (170), 30 states have return successors, (170), 156 states have call predecessors, (170), 170 states have call successors, (170) [2024-10-24 11:18:07,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2108 transitions. [2024-10-24 11:18:07,796 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2108 transitions. Word has length 113 [2024-10-24 11:18:07,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:07,797 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 2108 transitions. [2024-10-24 11:18:07,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:18:07,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2108 transitions. [2024-10-24 11:18:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 11:18:07,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:07,799 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:07,809 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-10-24 11:18:07,999 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-10-24 11:18:08,000 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:08,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:08,000 INFO L85 PathProgramCache]: Analyzing trace with hash -21938715, now seen corresponding path program 1 times [2024-10-24 11:18:08,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:08,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473788563] [2024-10-24 11:18:08,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:08,001 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-10-24 11:18:08,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:08,002 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-10-24 11:18:08,003 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-10-24 11:18:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:08,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:18:08,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:08,240 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-10-24 11:18:08,244 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 23 [2024-10-24 11:18:08,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:18:08,287 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 72 treesize of output 42 [2024-10-24 11:18:08,321 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:18:08,321 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:18:08,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:18:08,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473788563] [2024-10-24 11:18:08,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473788563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:18:08,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:18:08,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:18:08,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460077950] [2024-10-24 11:18:08,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:18:08,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:18:08,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:18:08,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:18:08,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:18:08,323 INFO L87 Difference]: Start difference. First operand 1533 states and 2108 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:18:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:18:08,505 INFO L93 Difference]: Finished difference Result 2997 states and 4122 transitions. [2024-10-24 11:18:08,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:18:08,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-10-24 11:18:08,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:18:08,512 INFO L225 Difference]: With dead ends: 2997 [2024-10-24 11:18:08,513 INFO L226 Difference]: Without dead ends: 1599 [2024-10-24 11:18:08,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:18:08,516 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 86 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:18:08,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 887 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:18:08,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2024-10-24 11:18:08,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1597. [2024-10-24 11:18:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1392 states have (on average 1.3132183908045978) internal successors, (1828), 1406 states have internal predecessors, (1828), 170 states have call successors, (170), 34 states have call predecessors, (170), 34 states have return successors, (170), 156 states have call predecessors, (170), 170 states have call successors, (170) [2024-10-24 11:18:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2168 transitions. [2024-10-24 11:18:08,616 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2168 transitions. Word has length 113 [2024-10-24 11:18:08,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:18:08,617 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 2168 transitions. [2024-10-24 11:18:08,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:18:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2168 transitions. [2024-10-24 11:18:08,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 11:18:08,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:18:08,619 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:18:08,629 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-10-24 11:18:08,819 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-10-24 11:18:08,820 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:18:08,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:18:08,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1753068647, now seen corresponding path program 1 times [2024-10-24 11:18:08,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:18:08,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116012576] [2024-10-24 11:18:08,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:18:08,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-10-24 11:18:08,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:18:08,822 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-10-24 11:18:08,823 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-10-24 11:18:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:18:09,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 11:18:09,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:18:09,064 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-10-24 11:18:09,477 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