./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-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 50c37bde9278eab1809caec3e26685a471aa2f6bca248c9ca7684bcb902cbec2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:17:09,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:17:09,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:17:09,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:17:09,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:17:09,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:17:09,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:17:09,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:17:09,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:17:09,889 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:17:09,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:17:09,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:17:09,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:17:09,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:17:09,892 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:17:09,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:17:09,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:17:09,893 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:17:09,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:17:09,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:17:09,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:17:09,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:17:09,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:17:09,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:17:09,899 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:17:09,899 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:17:09,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:17:09,899 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:17:09,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:17:09,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:17:09,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:17:09,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:17:09,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:17:09,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:17:09,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:17:09,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:17:09,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:17:09,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:17:09,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:17:09,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:17:09,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:17:09,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:17:09,903 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-clean/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-clean/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 -> 50c37bde9278eab1809caec3e26685a471aa2f6bca248c9ca7684bcb902cbec2 [2024-10-11 13:17:10,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:17:10,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:17:10,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:17:10,196 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:17:10,197 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:17:10,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i [2024-10-11 13:17:11,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:17:11,728 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:17:11,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i [2024-10-11 13:17:11,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/411297343/789ea105d95742b48cbc0d93d4908270/FLAG872115d80 [2024-10-11 13:17:12,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/411297343/789ea105d95742b48cbc0d93d4908270 [2024-10-11 13:17:12,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:17:12,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:17:12,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:17:12,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:17:12,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:17:12,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:17:12" (1/1) ... [2024-10-11 13:17:12,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2021208b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:12, skipping insertion in model container [2024-10-11 13:17:12,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:17:12" (1/1) ... [2024-10-11 13:17:12,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:17:12,415 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-42.i[916,929] [2024-10-11 13:17:12,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:17:12,515 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:17:12,526 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-42.i[916,929] [2024-10-11 13:17:12,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:17:12,601 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:17:12,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:12 WrapperNode [2024-10-11 13:17:12,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:17:12,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:17:12,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:17:12,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:17:12,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:12" (1/1) ... [2024-10-11 13:17:12,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:12" (1/1) ... [2024-10-11 13:17:12,731 INFO L138 Inliner]: procedures = 29, calls = 141, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2024-10-11 13:17:12,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:17:12,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:17:12,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:17:12,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:17:12,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:12" (1/1) ... [2024-10-11 13:17:12,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:12" (1/1) ... [2024-10-11 13:17:12,796 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:12" (1/1) ... [2024-10-11 13:17:12,845 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 40, 21, 9, 43]. 37 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 6, 2, 1, 2]. The 15 writes are split as follows [0, 9, 2, 2, 2]. [2024-10-11 13:17:12,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:12" (1/1) ... [2024-10-11 13:17:12,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:12" (1/1) ... [2024-10-11 13:17:12,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:12" (1/1) ... [2024-10-11 13:17:12,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:12" (1/1) ... [2024-10-11 13:17:12,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:12" (1/1) ... [2024-10-11 13:17:12,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:12" (1/1) ... [2024-10-11 13:17:12,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:17:12,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:17:12,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:17:12,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:17:12,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:12" (1/1) ... [2024-10-11 13:17:12,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:17:12,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:17:13,005 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:17:13,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:17:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:17:13,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:17:13,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:17:13,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:17:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:17:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:17:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:17:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:17:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:17:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:17:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:17:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:17:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:17:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:17:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:17:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:17:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:17:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:17:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:17:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:17:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:17:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:17:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:17:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:17:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:17:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:17:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:17:13,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:17:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:17:13,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:17:13,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:17:13,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:17:13,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:17:13,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:17:13,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:17:13,345 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:17:13,347 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:17:14,135 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-10-11 13:17:14,136 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:17:14,192 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:17:14,192 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:17:14,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:17:14 BoogieIcfgContainer [2024-10-11 13:17:14,196 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:17:14,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:17:14,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:17:14,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:17:14,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:17:12" (1/3) ... [2024-10-11 13:17:14,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b05d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:17:14, skipping insertion in model container [2024-10-11 13:17:14,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:12" (2/3) ... [2024-10-11 13:17:14,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b05d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:17:14, skipping insertion in model container [2024-10-11 13:17:14,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:17:14" (3/3) ... [2024-10-11 13:17:14,204 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-42.i [2024-10-11 13:17:14,218 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:17:14,218 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:17:14,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:17:14,288 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;@2c27df30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:17:14,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:17:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:17:14,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:17:14,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:14,318 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:14,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:14,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:14,333 INFO L85 PathProgramCache]: Analyzing trace with hash 128850661, now seen corresponding path program 1 times [2024-10-11 13:17:14,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:17:14,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265036122] [2024-10-11 13:17:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:14,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:17:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:14,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:17:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:14,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:17:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:14,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:17:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:14,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:17:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:14,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:17:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:14,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:17:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:14,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:17:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:14,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:17:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:14,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:17:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:14,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:17:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:14,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:17:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:17:14,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:17:14,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265036122] [2024-10-11 13:17:14,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265036122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:14,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:14,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:17:14,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385825590] [2024-10-11 13:17:14,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:14,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:17:14,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:17:14,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:17:14,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:17:14,648 INFO L87 Difference]: Start difference. First operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:17:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:14,677 INFO L93 Difference]: Finished difference Result 183 states and 283 transitions. [2024-10-11 13:17:14,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:17:14,680 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-11 13:17:14,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:14,686 INFO L225 Difference]: With dead ends: 183 [2024-10-11 13:17:14,686 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 13:17:14,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-11 13:17:14,692 INFO L432 NwaCegarLoop]: 126 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, 126 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-11 13:17:14,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:17:14,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 13:17:14,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 13:17:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:17:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2024-10-11 13:17:14,725 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 98 [2024-10-11 13:17:14,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:14,726 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2024-10-11 13:17:14,726 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:17:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2024-10-11 13:17:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:17:14,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:14,729 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:14,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:17:14,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:14,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1294475227, now seen corresponding path program 1 times [2024-10-11 13:17:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:17:14,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351253772] [2024-10-11 13:17:14,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:14,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:17:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:15,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:17:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:15,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:17:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:15,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:17:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:15,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:17:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:15,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:17:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:15,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:17:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:15,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:17:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:15,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:17:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:15,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:17:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:15,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:17:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:15,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:17:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:17:15,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:17:15,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351253772] [2024-10-11 13:17:15,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351253772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:15,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:15,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:17:15,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252703436] [2024-10-11 13:17:15,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:15,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:17:15,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:17:15,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:17:15,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:17:15,348 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:17:15,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:15,443 INFO L93 Difference]: Finished difference Result 181 states and 259 transitions. [2024-10-11 13:17:15,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:17:15,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:17:15,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:15,448 INFO L225 Difference]: With dead ends: 181 [2024-10-11 13:17:15,449 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 13:17:15,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-11 13:17:15,452 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:15,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:17:15,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 13:17:15,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 13:17:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 78 states have internal predecessors, (107), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:17:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2024-10-11 13:17:15,470 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 98 [2024-10-11 13:17:15,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:15,472 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-10-11 13:17:15,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:17:15,472 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-10-11 13:17:15,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:17:15,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:15,477 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:15,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:17:15,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:15,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:15,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1160461721, now seen corresponding path program 1 times [2024-10-11 13:17:15,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:17:15,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181527304] [2024-10-11 13:17:15,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:15,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:17:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:17:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:17:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:17:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:17:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:17:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:17:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:17:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:17:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:17:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:17:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:17:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:17:16,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:17:16,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181527304] [2024-10-11 13:17:16,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181527304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:16,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:16,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:17:16,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697249553] [2024-10-11 13:17:16,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:16,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:17:16,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:17:16,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:17:16,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:17:16,184 INFO L87 Difference]: Start difference. First operand 91 states and 129 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:17:16,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:16,263 INFO L93 Difference]: Finished difference Result 181 states and 257 transitions. [2024-10-11 13:17:16,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:17:16,263 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:17:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:16,265 INFO L225 Difference]: With dead ends: 181 [2024-10-11 13:17:16,265 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 13:17:16,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-11 13:17:16,268 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:16,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 443 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:17:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 13:17:16,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 13:17:16,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.358974358974359) internal successors, (106), 78 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:17:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-10-11 13:17:16,279 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 98 [2024-10-11 13:17:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:16,279 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-10-11 13:17:16,280 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:17:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-10-11 13:17:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:17:16,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:16,283 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:16,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:17:16,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:16,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:16,287 INFO L85 PathProgramCache]: Analyzing trace with hash 573655707, now seen corresponding path program 1 times [2024-10-11 13:17:16,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:17:16,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808104373] [2024-10-11 13:17:16,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:16,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:17:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:17:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:17:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:17:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:17:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:17:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:17:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:17:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:17:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:17:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:17:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:17:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:17:16,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:17:16,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808104373] [2024-10-11 13:17:16,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808104373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:16,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:16,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:17:16,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150382170] [2024-10-11 13:17:16,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:16,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:17:16,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:17:16,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:17:16,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:17:16,897 INFO L87 Difference]: Start difference. First operand 91 states and 128 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:17:17,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:17,138 INFO L93 Difference]: Finished difference Result 211 states and 297 transitions. [2024-10-11 13:17:17,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:17:17,139 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:17:17,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:17,141 INFO L225 Difference]: With dead ends: 211 [2024-10-11 13:17:17,141 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 13:17:17,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:17:17,142 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 105 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:17,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 576 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:17:17,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 13:17:17,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-10-11 13:17:17,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 98 states have internal predecessors, (128), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:17:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2024-10-11 13:17:17,162 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 98 [2024-10-11 13:17:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:17,163 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2024-10-11 13:17:17,164 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:17:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2024-10-11 13:17:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:17:17,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:17,166 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:17,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:17:17,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:17,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:17,167 INFO L85 PathProgramCache]: Analyzing trace with hash 180628697, now seen corresponding path program 1 times [2024-10-11 13:17:17,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:17:17,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518769809] [2024-10-11 13:17:17,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:17,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:17:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:17,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:17:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:17,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:17:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:17,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:17:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:17,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:17:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:17,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:17:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:17,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:17:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:17,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:17:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:17,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:17:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:17,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:17:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:17,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:17:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:17,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:17:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:17,761 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:17:17,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:17:17,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518769809] [2024-10-11 13:17:17,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518769809] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:17:17,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781965016] [2024-10-11 13:17:17,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:17,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:17:17,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:17:17,765 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:17:17,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:17:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:17,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 13:17:17,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:17,982 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 21 treesize of output 21 [2024-10-11 13:17:18,035 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 11 treesize of output 7 [2024-10-11 13:17:18,193 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:17:18,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:17:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:17:18,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781965016] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:17:18,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:17:18,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 11] total 19 [2024-10-11 13:17:18,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734214940] [2024-10-11 13:17:18,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:18,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:17:18,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:17:18,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:17:18,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:17:18,336 INFO L87 Difference]: Start difference. First operand 120 states and 168 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:17:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:18,484 INFO L93 Difference]: Finished difference Result 314 states and 435 transitions. [2024-10-11 13:17:18,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:17:18,485 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:17:18,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:18,487 INFO L225 Difference]: With dead ends: 314 [2024-10-11 13:17:18,487 INFO L226 Difference]: Without dead ends: 218 [2024-10-11 13:17:18,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:17:18,489 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 120 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:18,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1095 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:17:18,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-11 13:17:18,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 208. [2024-10-11 13:17:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 172 states have (on average 1.3255813953488371) internal successors, (228), 174 states have internal predecessors, (228), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 13:17:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 290 transitions. [2024-10-11 13:17:18,538 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 290 transitions. Word has length 98 [2024-10-11 13:17:18,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:18,539 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 290 transitions. [2024-10-11 13:17:18,539 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:17:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 290 transitions. [2024-10-11 13:17:18,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:17:18,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:18,540 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:18,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:17:18,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:17:18,741 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:18,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:18,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1793589664, now seen corresponding path program 1 times [2024-10-11 13:17:18,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:17:18,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255748656] [2024-10-11 13:17:18,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:18,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:17:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:18,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:17:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:18,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:17:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:18,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:17:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:18,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:17:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:18,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:17:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:18,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:17:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:18,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:17:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:18,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:17:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:18,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:17:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:18,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:17:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:18,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:17:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:17:18,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:17:18,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255748656] [2024-10-11 13:17:18,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255748656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:18,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:18,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:17:18,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456572846] [2024-10-11 13:17:18,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:18,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:17:18,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:17:18,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:17:18,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:17:18,904 INFO L87 Difference]: Start difference. First operand 208 states and 290 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:17:18,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:18,944 INFO L93 Difference]: Finished difference Result 384 states and 532 transitions. [2024-10-11 13:17:18,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:17:18,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:17:18,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:18,948 INFO L225 Difference]: With dead ends: 384 [2024-10-11 13:17:18,948 INFO L226 Difference]: Without dead ends: 200 [2024-10-11 13:17:18,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-11 13:17:18,950 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:18,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:17:18,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-11 13:17:18,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-10-11 13:17:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 164 states have (on average 1.3048780487804879) internal successors, (214), 166 states have internal predecessors, (214), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 13:17:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 276 transitions. [2024-10-11 13:17:18,969 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 276 transitions. Word has length 98 [2024-10-11 13:17:18,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:18,970 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 276 transitions. [2024-10-11 13:17:18,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:17:18,970 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 276 transitions. [2024-10-11 13:17:18,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:17:18,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:18,971 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:18,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:17:18,972 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:18,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:18,973 INFO L85 PathProgramCache]: Analyzing trace with hash -180227854, now seen corresponding path program 1 times [2024-10-11 13:17:18,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:17:18,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894241945] [2024-10-11 13:17:18,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:18,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:17:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:17:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:17:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:17:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:17:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:17:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:17:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:17:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:17:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:17:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:17:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:17:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:17:19,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:17:19,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894241945] [2024-10-11 13:17:19,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894241945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:19,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:19,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:17:19,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322383789] [2024-10-11 13:17:19,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:19,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:17:19,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:17:19,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:17:19,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:17:19,118 INFO L87 Difference]: Start difference. First operand 200 states and 276 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:17:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:19,138 INFO L93 Difference]: Finished difference Result 298 states and 406 transitions. [2024-10-11 13:17:19,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:17:19,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-10-11 13:17:19,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:19,140 INFO L225 Difference]: With dead ends: 298 [2024-10-11 13:17:19,141 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 13:17:19,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:17:19,142 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:19,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:17:19,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 13:17:19,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-11 13:17:19,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.2604166666666667) internal successors, (121), 97 states have internal predecessors, (121), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:17:19,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 165 transitions. [2024-10-11 13:17:19,159 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 165 transitions. Word has length 98 [2024-10-11 13:17:19,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:19,159 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 165 transitions. [2024-10-11 13:17:19,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:17:19,159 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 165 transitions. [2024-10-11 13:17:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:17:19,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:19,160 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:19,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:17:19,164 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:19,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:19,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1713664576, now seen corresponding path program 1 times [2024-10-11 13:17:19,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:17:19,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565553892] [2024-10-11 13:17:19,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:19,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:17:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:17:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:17:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:17:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:17:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:17:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:17:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:17:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:17:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:17:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:17:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:17:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:17:19,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:17:19,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565553892] [2024-10-11 13:17:19,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565553892] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:17:19,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798194165] [2024-10-11 13:17:19,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:19,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:17:19,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:17:19,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:17:19,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 13:17:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:19,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 13:17:19,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:19,861 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 15 treesize of output 1 [2024-10-11 13:17:19,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 13:17:20,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 13:17:20,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 13:17:20,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:17:20,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2024-10-11 13:17:20,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:17:20,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 26 [2024-10-11 13:17:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-10-11 13:17:20,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:17:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:17:20,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798194165] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:17:20,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 13:17:20,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 16 [2024-10-11 13:17:20,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132238094] [2024-10-11 13:17:20,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 13:17:20,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 13:17:20,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:17:20,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 13:17:20,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:17:20,489 INFO L87 Difference]: Start difference. First operand 122 states and 165 transitions. Second operand has 16 states, 13 states have (on average 6.923076923076923) internal successors, (90), 16 states have internal predecessors, (90), 7 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (23), 4 states have call predecessors, (23), 7 states have call successors, (23) [2024-10-11 13:17:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:20,811 INFO L93 Difference]: Finished difference Result 276 states and 362 transitions. [2024-10-11 13:17:20,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 13:17:20,812 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 6.923076923076923) internal successors, (90), 16 states have internal predecessors, (90), 7 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (23), 4 states have call predecessors, (23), 7 states have call successors, (23) Word has length 100 [2024-10-11 13:17:20,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:20,813 INFO L225 Difference]: With dead ends: 276 [2024-10-11 13:17:20,813 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 13:17:20,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 212 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:17:20,814 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 298 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:20,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 544 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:17:20,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 13:17:20,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 130. [2024-10-11 13:17:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 102 states have (on average 1.2352941176470589) internal successors, (126), 103 states have internal predecessors, (126), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:17:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 170 transitions. [2024-10-11 13:17:20,822 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 170 transitions. Word has length 100 [2024-10-11 13:17:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:20,823 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 170 transitions. [2024-10-11 13:17:20,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 6.923076923076923) internal successors, (90), 16 states have internal predecessors, (90), 7 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (23), 4 states have call predecessors, (23), 7 states have call successors, (23) [2024-10-11 13:17:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 170 transitions. [2024-10-11 13:17:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:17:20,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:20,824 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:20,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 13:17:21,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:17:21,025 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:21,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:21,025 INFO L85 PathProgramCache]: Analyzing trace with hash 879965113, now seen corresponding path program 1 times [2024-10-11 13:17:21,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:17:21,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481071364] [2024-10-11 13:17:21,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:21,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:17:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:21,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:17:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:21,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:17:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:21,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:17:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:21,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:17:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:21,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:17:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:21,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:17:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:21,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:17:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:21,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:17:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:21,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:17:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:21,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:17:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:21,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:17:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:17:21,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:17:21,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481071364] [2024-10-11 13:17:21,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481071364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:21,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:21,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:17:21,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582170624] [2024-10-11 13:17:21,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:21,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:17:21,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:17:21,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:17:21,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:17:21,292 INFO L87 Difference]: Start difference. First operand 130 states and 170 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:17:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:21,356 INFO L93 Difference]: Finished difference Result 224 states and 292 transitions. [2024-10-11 13:17:21,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:17:21,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-10-11 13:17:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:21,357 INFO L225 Difference]: With dead ends: 224 [2024-10-11 13:17:21,357 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 13:17:21,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:17:21,358 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 110 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:21,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 403 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:17:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 13:17:21,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-11 13:17:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 103 states have internal predecessors, (125), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:17:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 169 transitions. [2024-10-11 13:17:21,368 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 169 transitions. Word has length 100 [2024-10-11 13:17:21,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:21,368 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 169 transitions. [2024-10-11 13:17:21,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:17:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 169 transitions. [2024-10-11 13:17:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:17:21,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:21,369 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:21,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:17:21,369 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:21,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:21,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1726058441, now seen corresponding path program 1 times [2024-10-11 13:17:21,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:17:21,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700088741] [2024-10-11 13:17:21,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:21,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:17:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:17:21,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:17:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:17:21,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:17:21,510 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:17:21,511 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:17:21,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:17:21,520 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:17:21,605 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:17:21,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:17:21 BoogieIcfgContainer [2024-10-11 13:17:21,612 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:17:21,612 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:17:21,612 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:17:21,612 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:17:21,613 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:17:14" (3/4) ... [2024-10-11 13:17:21,618 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:17:21,619 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:17:21,624 INFO L158 Benchmark]: Toolchain (without parser) took 9479.65ms. Allocated memory was 184.5MB in the beginning and 388.0MB in the end (delta: 203.4MB). Free memory was 115.7MB in the beginning and 175.6MB in the end (delta: -59.9MB). Peak memory consumption was 145.9MB. Max. memory is 16.1GB. [2024-10-11 13:17:21,624 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 184.5MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:17:21,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.98ms. Allocated memory is still 184.5MB. Free memory was 115.5MB in the beginning and 99.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:17:21,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 130.55ms. Allocated memory is still 184.5MB. Free memory was 99.5MB in the beginning and 154.1MB in the end (delta: -54.6MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-10-11 13:17:21,624 INFO L158 Benchmark]: Boogie Preprocessor took 184.71ms. Allocated memory is still 184.5MB. Free memory was 154.1MB in the beginning and 149.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:17:21,625 INFO L158 Benchmark]: RCFGBuilder took 1273.90ms. Allocated memory is still 184.5MB. Free memory was 149.1MB in the beginning and 110.1MB in the end (delta: 39.0MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-11 13:17:21,625 INFO L158 Benchmark]: TraceAbstraction took 7414.62ms. Allocated memory was 184.5MB in the beginning and 388.0MB in the end (delta: 203.4MB). Free memory was 109.3MB in the beginning and 175.6MB in the end (delta: -66.3MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. [2024-10-11 13:17:21,625 INFO L158 Benchmark]: Witness Printer took 10.99ms. Allocated memory is still 388.0MB. Free memory is still 175.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:17:21,626 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.23ms. Allocated memory is still 184.5MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.98ms. Allocated memory is still 184.5MB. Free memory was 115.5MB in the beginning and 99.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 130.55ms. Allocated memory is still 184.5MB. Free memory was 99.5MB in the beginning and 154.1MB in the end (delta: -54.6MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 184.71ms. Allocated memory is still 184.5MB. Free memory was 154.1MB in the beginning and 149.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1273.90ms. Allocated memory is still 184.5MB. Free memory was 149.1MB in the beginning and 110.1MB in the end (delta: 39.0MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7414.62ms. Allocated memory was 184.5MB in the beginning and 388.0MB in the end (delta: 203.4MB). Free memory was 109.3MB in the beginning and 175.6MB in the end (delta: -66.3MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. * Witness Printer took 10.99ms. Allocated memory is still 388.0MB. Free memory is still 175.6MB. 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 someBinaryFLOATComparisonOperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L25-L27] float float_Array_0[2] = { 16.5, 127.25 }; [L25-L27] float float_Array_0[2] = { 16.5, 127.25 }; [L25-L27] float float_Array_0[2] = { 16.5, 127.25 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -1 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { -1 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 5 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 5 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 5 }; [L87] isInitial = 1 [L88] FCALL initially() [L89] COND TRUE 1 [L90] FCALL updateLastVariables() [L91] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] BOOL_unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] BOOL_unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] float_Array_0[1] = __VERIFIER_nondet_float() [L75] EXPR float_Array_0[1] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L75] EXPR float_Array_0[1] [L75] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L77] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] RET updateVariables() [L92] CALL step() [L37] EXPR unsigned_char_Array_0[0] [L37] unsigned_char_Array_0[1] = (unsigned_char_Array_0[0] + 100) [L38] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L38] EXPR ((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f) [L38] EXPR float_Array_0[1] [L38] EXPR ((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L38] float_Array_0[0] = ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f))) [L39] EXPR unsigned_char_Array_0[1] [L39] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L39] COND FALSE !(unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L42] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR unsigned_char_Array_0[1] [L42] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L42] signed_long_int_Array_0[0] = (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])))) [L44] EXPR float_Array_0[1] [L44] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L44] COND TRUE float_Array_0[1] <= float_Array_0[0] [L45] EXPR signed_long_int_Array_0[0] [L45] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L45] COND TRUE signed_long_int_Array_0[0] != unsigned_char_Array_0[1] [L46] EXPR BOOL_unsigned_char_Array_0[1][2] [L46] BOOL_unsigned_char_Array_0[1][1] = BOOL_unsigned_char_Array_0[1][2] [L55] EXPR float_Array_0[0] [L55] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L55] COND FALSE !((- float_Array_0[0]) > float_Array_0[1]) [L58] EXPR signed_long_int_Array_0[0] [L58] EXPR unsigned_char_Array_0[0] [L58] EXPR (signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L58] EXPR (signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1] [L58] EXPR BOOL_unsigned_char_Array_0[0][1] [L58] EXPR (signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L58] BOOL_unsigned_char_Array_0[0][0] = ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1]) [L92] RET step() [L93] CALL, EXPR property() [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])))))) [L83] EXPR signed_long_int_Array_0[0] [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR (((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100))) [L83] EXPR unsigned_char_Array_0[1] [L83] EXPR unsigned_char_Array_0[0] [L83] EXPR ((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f))))) [L83] EXPR float_Array_0[0] [L83] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f) [L83] EXPR float_Array_0[1] [L83] EXPR ((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR ((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1]))))) && ((float_Array_0[1] <= float_Array_0[0]) ? ((signed_long_int_Array_0[0] != unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][2])) : 1) : ((unsigned_char_Array_0[1] <= 1000000) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] EXPR (((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1]))))) && ((float_Array_0[1] <= float_Array_0[0]) ? ((signed_long_int_Array_0[0] != unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][2])) : 1) : ((unsigned_char_Array_0[1] <= 1000000) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83-L84] return (((((unsigned_char_Array_0[1] > unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) - 10))) : (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) > ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))) ? ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1])) : ((unsigned_char_Array_0[1] - unsigned_char_Array_0[1]))))))) && (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[0] + 100)))) && (float_Array_0[0] == ((float) ((((float_Array_0[1]) < (64.15f)) ? (float_Array_0[1]) : (64.15f)))))) && (((- float_Array_0[0]) > float_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || (BOOL_unsigned_char_Array_0[1][1] && (BOOL_unsigned_char_Array_0[0][2] || BOOL_unsigned_char_Array_0[0][1]))))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((signed_long_int_Array_0[0] <= unsigned_char_Array_0[0]) && BOOL_unsigned_char_Array_0[0][1]))))) && ((float_Array_0[1] <= float_Array_0[0]) ? ((signed_long_int_Array_0[0] != unsigned_char_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) BOOL_unsigned_char_Array_0[1][2])) : 1) : ((unsigned_char_Array_0[1] <= 1000000) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) 0)))) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 10, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 634 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 633 mSDsluCounter, 4091 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3007 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 873 IncrementalHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 1084 mSDtfsCounter, 873 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 674 GetRequests, 605 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=5, InterpolantAutomatonStates: 54, 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, 9 MinimizatonAttempts, 67 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1184 NumberOfCodeBlocks, 1184 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1269 ConstructedInterpolants, 0 QuantifiedInterpolants, 5176 SizeOfPredicates, 13 NumberOfNonLiveVariables, 763 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 2722/2860 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-11 13:17:21,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 50c37bde9278eab1809caec3e26685a471aa2f6bca248c9ca7684bcb902cbec2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:17:23,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:17:23,893 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:17:23,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:17:23,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:17:23,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:17:23,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:17:23,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:17:23,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:17:23,930 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:17:23,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:17:23,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:17:23,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:17:23,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:17:23,933 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:17:23,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:17:23,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:17:23,934 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:17:23,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:17:23,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:17:23,934 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:17:23,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:17:23,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:17:23,938 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:17:23,938 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:17:23,938 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:17:23,938 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:17:23,939 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:17:23,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:17:23,939 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:17:23,939 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:17:23,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:17:23,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:17:23,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:17:23,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:17:23,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:17:23,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:17:23,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:17:23,941 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:17:23,941 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:17:23,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:17:23,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:17:23,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:17:23,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:17:23,942 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:17:23,942 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-clean/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-clean/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 -> 50c37bde9278eab1809caec3e26685a471aa2f6bca248c9ca7684bcb902cbec2 [2024-10-11 13:17:24,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:17:24,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:17:24,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:17:24,253 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:17:24,254 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:17:24,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i [2024-10-11 13:17:25,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:17:25,938 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:17:25,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-42.i [2024-10-11 13:17:25,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b23170c93/6f5be24dd6ec4003833ea174d86afcdb/FLAGcc5388ff8 [2024-10-11 13:17:26,249 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b23170c93/6f5be24dd6ec4003833ea174d86afcdb [2024-10-11 13:17:26,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:17:26,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:17:26,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:17:26,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:17:26,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:17:26,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:17:26" (1/1) ... [2024-10-11 13:17:26,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@246247b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:26, skipping insertion in model container [2024-10-11 13:17:26,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:17:26" (1/1) ... [2024-10-11 13:17:26,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:17:26,440 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-42.i[916,929] [2024-10-11 13:17:26,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:17:26,497 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:17:26,506 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-42.i[916,929] [2024-10-11 13:17:26,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:17:26,560 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:17:26,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:26 WrapperNode [2024-10-11 13:17:26,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:17:26,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:17:26,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:17:26,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:17:26,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:26" (1/1) ... [2024-10-11 13:17:26,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:26" (1/1) ... [2024-10-11 13:17:26,628 INFO L138 Inliner]: procedures = 33, calls = 141, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2024-10-11 13:17:26,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:17:26,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:17:26,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:17:26,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:17:26,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:26" (1/1) ... [2024-10-11 13:17:26,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:26" (1/1) ... [2024-10-11 13:17:26,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:26" (1/1) ... [2024-10-11 13:17:26,673 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 40, 21, 9, 43]. 37 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 6, 2, 1, 2]. The 15 writes are split as follows [0, 9, 2, 2, 2]. [2024-10-11 13:17:26,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:26" (1/1) ... [2024-10-11 13:17:26,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:26" (1/1) ... [2024-10-11 13:17:26,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:26" (1/1) ... [2024-10-11 13:17:26,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:26" (1/1) ... [2024-10-11 13:17:26,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:26" (1/1) ... [2024-10-11 13:17:26,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:26" (1/1) ... [2024-10-11 13:17:26,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:17:26,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:17:26,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:17:26,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:17:26,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:26" (1/1) ... [2024-10-11 13:17:26,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:17:26,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:17:26,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:17:26,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:17:26,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:17:26,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:17:26,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:17:26,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:17:26,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:17:26,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:17:26,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:17:26,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:17:26,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:17:26,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:17:26,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:17:26,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:17:26,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:17:26,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 13:17:26,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-11 13:17:26,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-11 13:17:26,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:17:26,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:17:26,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:17:26,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:17:26,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:17:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:17:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:17:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 13:17:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 13:17:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-11 13:17:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:17:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:17:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:17:26,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:17:26,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:17:26,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:17:26,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:17:26,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:17:26,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:17:26,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:17:26,816 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:17:26,816 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:17:26,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:17:26,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:17:26,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:17:26,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:17:26,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:17:26,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:17:26,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:17:26,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:17:26,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:17:26,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 13:17:26,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 13:17:26,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-11 13:17:26,975 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:17:26,976 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:17:27,475 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-10-11 13:17:27,475 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:17:27,554 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:17:27,555 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:17:27,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:17:27 BoogieIcfgContainer [2024-10-11 13:17:27,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:17:27,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:17:27,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:17:27,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:17:27,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:17:26" (1/3) ... [2024-10-11 13:17:27,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f8bf1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:17:27, skipping insertion in model container [2024-10-11 13:17:27,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:26" (2/3) ... [2024-10-11 13:17:27,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f8bf1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:17:27, skipping insertion in model container [2024-10-11 13:17:27,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:17:27" (3/3) ... [2024-10-11 13:17:27,562 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-42.i [2024-10-11 13:17:27,574 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:17:27,574 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:17:27,632 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:17:27,640 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;@619dfdfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:17:27,641 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:17:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:17:27,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:17:27,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:27,659 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:27,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:27,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:27,665 INFO L85 PathProgramCache]: Analyzing trace with hash 128850661, now seen corresponding path program 1 times [2024-10-11 13:17:27,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:17:27,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830070479] [2024-10-11 13:17:27,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:27,684 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-11 13:17:27,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:17:27,690 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 13:17:27,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:17:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:27,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:17:27,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-11 13:17:27,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:17:27,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:17:27,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830070479] [2024-10-11 13:17:27,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830070479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:27,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:27,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:17:27,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536160261] [2024-10-11 13:17:27,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:27,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:17:27,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:17:27,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:17:27,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:17:27,992 INFO L87 Difference]: Start difference. First operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:17:28,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:28,036 INFO L93 Difference]: Finished difference Result 183 states and 283 transitions. [2024-10-11 13:17:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:17:28,040 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-11 13:17:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:28,048 INFO L225 Difference]: With dead ends: 183 [2024-10-11 13:17:28,048 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 13:17:28,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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-11 13:17:28,057 INFO L432 NwaCegarLoop]: 126 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, 126 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-11 13:17:28,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:17:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 13:17:28,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 13:17:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:17:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2024-10-11 13:17:28,104 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 98 [2024-10-11 13:17:28,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:28,104 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2024-10-11 13:17:28,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:17:28,105 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2024-10-11 13:17:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:17:28,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:28,111 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:28,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:17:28,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 13:17:28,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:28,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:28,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1294475227, now seen corresponding path program 1 times [2024-10-11 13:17:28,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:17:28,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489160824] [2024-10-11 13:17:28,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:28,319 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-11 13:17:28,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:17:28,333 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 13:17:28,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:17:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:28,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 13:17:28,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:28,912 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 33 treesize of output 28 [2024-10-11 13:17:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:17:29,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:17:29,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:17:29,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489160824] [2024-10-11 13:17:29,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489160824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:29,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:29,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:17:29,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347877350] [2024-10-11 13:17:29,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:29,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:17:29,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:17:29,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:17:29,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:17:29,129 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:17:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:29,720 INFO L93 Difference]: Finished difference Result 219 states and 307 transitions. [2024-10-11 13:17:29,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:17:29,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-11 13:17:29,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:29,722 INFO L225 Difference]: With dead ends: 219 [2024-10-11 13:17:29,722 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 13:17:29,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:17:29,724 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 144 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:29,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 522 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:17:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 13:17:29,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 95. [2024-10-11 13:17:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:17:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-10-11 13:17:29,742 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 98 [2024-10-11 13:17:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:29,742 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-10-11 13:17:29,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:17:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-10-11 13:17:29,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:17:29,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:29,745 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:29,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:17:29,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 13:17:29,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:29,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:29,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1160461721, now seen corresponding path program 1 times [2024-10-11 13:17:29,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:17:29,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517918440] [2024-10-11 13:17:29,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:29,954 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-11 13:17:29,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:17:29,960 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 13:17:29,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 13:17:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:30,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:17:30,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:30,210 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 33 treesize of output 28 [2024-10-11 13:17:30,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:17:30,426 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 69 treesize of output 31 [2024-10-11 13:17:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:17:30,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:17:30,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:17:30,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517918440] [2024-10-11 13:17:30,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517918440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:30,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:30,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:17:30,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479688694] [2024-10-11 13:17:30,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:30,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:17:30,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:17:30,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:17:30,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:17:30,519 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:17:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:31,325 INFO L93 Difference]: Finished difference Result 223 states and 308 transitions. [2024-10-11 13:17:31,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:17:31,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-11 13:17:31,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:31,327 INFO L225 Difference]: With dead ends: 223 [2024-10-11 13:17:31,327 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 13:17:31,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:17:31,329 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 133 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:31,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 543 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:17:31,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 13:17:31,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 95. [2024-10-11 13:17:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:17:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 131 transitions. [2024-10-11 13:17:31,351 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 131 transitions. Word has length 98 [2024-10-11 13:17:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:31,352 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 131 transitions. [2024-10-11 13:17:31,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:17:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2024-10-11 13:17:31,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:17:31,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:31,355 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:31,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 13:17:31,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 13:17:31,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:31,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:31,561 INFO L85 PathProgramCache]: Analyzing trace with hash 573655707, now seen corresponding path program 1 times [2024-10-11 13:17:31,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:17:31,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255401767] [2024-10-11 13:17:31,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:31,561 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-11 13:17:31,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:17:31,564 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 13:17:31,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:17:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:31,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 13:17:31,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:31,755 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-11 13:17:31,795 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 31 treesize of output 15 [2024-10-11 13:17:31,847 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 31 treesize of output 15 [2024-10-11 13:17:31,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-11 13:17:32,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:17:32,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2024-10-11 13:17:32,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:17:32,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 31 [2024-10-11 13:17:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 128 proven. 27 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-11 13:17:32,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:17:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:17:32,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:17:32,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255401767] [2024-10-11 13:17:32,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255401767] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:17:32,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:17:32,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2024-10-11 13:17:32,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114088381] [2024-10-11 13:17:32,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:17:32,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:17:32,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:17:32,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:17:32,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:17:32,776 INFO L87 Difference]: Start difference. First operand 95 states and 131 transitions. Second operand has 12 states, 10 states have (on average 7.8) internal successors, (78), 12 states have internal predecessors, (78), 5 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 5 states have call successors, (21) [2024-10-11 13:17:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:33,327 INFO L93 Difference]: Finished difference Result 253 states and 342 transitions. [2024-10-11 13:17:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 13:17:33,328 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.8) internal successors, (78), 12 states have internal predecessors, (78), 5 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 5 states have call successors, (21) Word has length 98 [2024-10-11 13:17:33,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:33,329 INFO L225 Difference]: With dead ends: 253 [2024-10-11 13:17:33,330 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 13:17:33,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:17:33,331 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 337 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:33,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 484 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:17:33,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 13:17:33,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 103. [2024-10-11 13:17:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 87 states have internal predecessors, (114), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:17:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 136 transitions. [2024-10-11 13:17:33,344 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 136 transitions. Word has length 98 [2024-10-11 13:17:33,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:33,345 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 136 transitions. [2024-10-11 13:17:33,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.8) internal successors, (78), 12 states have internal predecessors, (78), 5 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 5 states have call successors, (21) [2024-10-11 13:17:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 136 transitions. [2024-10-11 13:17:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:17:33,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:33,346 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:33,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 13:17:33,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 13:17:33,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:33,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:33,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1711008172, now seen corresponding path program 1 times [2024-10-11 13:17:33,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:17:33,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116571265] [2024-10-11 13:17:33,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:33,549 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-11 13:17:33,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:17:33,552 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 13:17:33,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:17:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 13:17:33,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:33,751 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 33 treesize of output 28 [2024-10-11 13:17:33,815 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 30 treesize of output 26 [2024-10-11 13:17:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:17:33,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:17:33,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:17:33,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116571265] [2024-10-11 13:17:33,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116571265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:33,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:33,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:17:33,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121458602] [2024-10-11 13:17:33,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:33,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:17:33,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:17:33,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:17:33,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:17:33,931 INFO L87 Difference]: Start difference. First operand 103 states and 136 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:17:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:34,566 INFO L93 Difference]: Finished difference Result 348 states and 452 transitions. [2024-10-11 13:17:34,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 13:17:34,567 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-11 13:17:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:34,569 INFO L225 Difference]: With dead ends: 348 [2024-10-11 13:17:34,569 INFO L226 Difference]: Without dead ends: 246 [2024-10-11 13:17:34,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:17:34,570 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 323 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:34,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 639 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:17:34,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-11 13:17:34,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 110. [2024-10-11 13:17:34,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 94 states have internal predecessors, (124), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:17:34,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 146 transitions. [2024-10-11 13:17:34,586 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 146 transitions. Word has length 98 [2024-10-11 13:17:34,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:34,586 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 146 transitions. [2024-10-11 13:17:34,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:17:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 146 transitions. [2024-10-11 13:17:34,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:17:34,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:34,587 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:34,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:17:34,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-11 13:17:34,792 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:34,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:34,793 INFO L85 PathProgramCache]: Analyzing trace with hash -122660270, now seen corresponding path program 1 times [2024-10-11 13:17:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:17:34,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095148706] [2024-10-11 13:17:34,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:34,794 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-11 13:17:34,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:17:34,797 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-11 13:17:34,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:17:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 13:17:34,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:35,266 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 121 treesize of output 61 [2024-10-11 13:17:35,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:17:35,401 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 154 treesize of output 58 [2024-10-11 13:17:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-11 13:17:35,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:17:46,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:17:46,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095148706] [2024-10-11 13:17:46,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095148706] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:17:46,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1762915272] [2024-10-11 13:17:46,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:46,714 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:17:46,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:17:46,716 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:17:46,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-11 13:17:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:47,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 13:17:47,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:48,618 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 121 treesize of output 61 [2024-10-11 13:17:48,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:17:48,998 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 154 treesize of output 58 [2024-10-11 13:17:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-11 13:17:49,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:17:56,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1762915272] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:17:56,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:17:56,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-10-11 13:17:56,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460945953] [2024-10-11 13:17:56,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:17:56,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:17:56,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:17:56,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:17:56,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:17:56,103 INFO L87 Difference]: Start difference. First operand 110 states and 146 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:18:00,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:00,201 INFO L93 Difference]: Finished difference Result 413 states and 548 transitions. [2024-10-11 13:18:00,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:18:00,202 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-11 13:18:00,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:00,204 INFO L225 Difference]: With dead ends: 413 [2024-10-11 13:18:00,204 INFO L226 Difference]: Without dead ends: 304 [2024-10-11 13:18:00,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 235 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2024-10-11 13:18:00,205 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 389 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:00,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1276 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 13:18:00,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-11 13:18:00,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 293. [2024-10-11 13:18:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 251 states have (on average 1.3107569721115537) internal successors, (329), 253 states have internal predecessors, (329), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 13:18:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 389 transitions. [2024-10-11 13:18:00,269 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 389 transitions. Word has length 98 [2024-10-11 13:18:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:00,270 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 389 transitions. [2024-10-11 13:18:00,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:18:00,270 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 389 transitions. [2024-10-11 13:18:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:18:00,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:00,271 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:00,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:18:00,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-10-11 13:18:00,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:18:00,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:00,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:00,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1800567764, now seen corresponding path program 1 times [2024-10-11 13:18:00,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:00,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543274837] [2024-10-11 13:18:00,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:00,677 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-11 13:18:00,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:00,679 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-11 13:18:00,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:18:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:00,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:18:00,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:02,663 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 88 treesize of output 34 [2024-10-11 13:18:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-11 13:18:02,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:18:02,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:02,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543274837] [2024-10-11 13:18:02,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543274837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:02,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:02,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:18:02,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849598104] [2024-10-11 13:18:02,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:02,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:18:02,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:02,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:18:02,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:18:02,857 INFO L87 Difference]: Start difference. First operand 293 states and 389 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:18:05,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:05,191 INFO L93 Difference]: Finished difference Result 502 states and 661 transitions. [2024-10-11 13:18:05,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:18:05,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-11 13:18:05,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:05,198 INFO L225 Difference]: With dead ends: 502 [2024-10-11 13:18:05,199 INFO L226 Difference]: Without dead ends: 210 [2024-10-11 13:18:05,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:18:05,200 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 197 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:05,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 587 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 13:18:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-11 13:18:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2024-10-11 13:18:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 175 states have (on average 1.2914285714285714) internal successors, (226), 176 states have internal predecessors, (226), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:18:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 270 transitions. [2024-10-11 13:18:05,236 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 270 transitions. Word has length 98 [2024-10-11 13:18:05,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:05,236 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 270 transitions. [2024-10-11 13:18:05,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:18:05,236 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 270 transitions. [2024-10-11 13:18:05,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:18:05,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:05,237 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:05,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 13:18:05,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-11 13:18:05,438 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:05,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:05,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1816501776, now seen corresponding path program 1 times [2024-10-11 13:18:05,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:05,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408097412] [2024-10-11 13:18:05,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:05,439 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-11 13:18:05,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:05,440 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-11 13:18:05,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:18:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:05,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:18:05,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-11 13:18:05,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:18:05,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:05,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408097412] [2024-10-11 13:18:05,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408097412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:05,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:05,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:18:05,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405318904] [2024-10-11 13:18:05,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:05,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:18:05,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:05,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:18:05,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:18:05,638 INFO L87 Difference]: Start difference. First operand 207 states and 270 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:18:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:05,827 INFO L93 Difference]: Finished difference Result 413 states and 539 transitions. [2024-10-11 13:18:05,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:18:05,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-11 13:18:05,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:05,830 INFO L225 Difference]: With dead ends: 413 [2024-10-11 13:18:05,830 INFO L226 Difference]: Without dead ends: 207 [2024-10-11 13:18:05,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 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-11 13:18:05,831 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 359 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:05,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 359 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:18:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-11 13:18:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-10-11 13:18:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 175 states have (on average 1.2857142857142858) internal successors, (225), 176 states have internal predecessors, (225), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:18:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 269 transitions. [2024-10-11 13:18:05,877 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 269 transitions. Word has length 98 [2024-10-11 13:18:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:05,877 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 269 transitions. [2024-10-11 13:18:05,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:18:05,878 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 269 transitions. [2024-10-11 13:18:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:18:05,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:05,880 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:05,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 13:18:06,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-11 13:18:06,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:06,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:06,081 INFO L85 PathProgramCache]: Analyzing trace with hash 590632511, now seen corresponding path program 1 times [2024-10-11 13:18:06,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:06,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202750011] [2024-10-11 13:18:06,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:06,085 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-11 13:18:06,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:06,086 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-11 13:18:06,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:18:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:06,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:18:06,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:06,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:18:06,901 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 41 treesize of output 32 [2024-10-11 13:18:08,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:18:08,020 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 86 treesize of output 48 [2024-10-11 13:18:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-10-11 13:18:08,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:18:08,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:08,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202750011] [2024-10-11 13:18:08,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202750011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:08,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:08,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:18:08,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343282595] [2024-10-11 13:18:08,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:08,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:18:08,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:08,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:18:08,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:18:08,212 INFO L87 Difference]: Start difference. First operand 207 states and 269 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 13:18:11,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:11,295 INFO L93 Difference]: Finished difference Result 483 states and 618 transitions. [2024-10-11 13:18:11,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 13:18:11,296 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2024-10-11 13:18:11,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:11,298 INFO L225 Difference]: With dead ends: 483 [2024-10-11 13:18:11,298 INFO L226 Difference]: Without dead ends: 277 [2024-10-11 13:18:11,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:18:11,299 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 192 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:11,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 629 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 13:18:11,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-11 13:18:11,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 211. [2024-10-11 13:18:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 179 states have (on average 1.2793296089385475) internal successors, (229), 180 states have internal predecessors, (229), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:18:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 273 transitions. [2024-10-11 13:18:11,319 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 273 transitions. Word has length 100 [2024-10-11 13:18:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:11,319 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 273 transitions. [2024-10-11 13:18:11,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 13:18:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 273 transitions. [2024-10-11 13:18:11,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:18:11,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:11,321 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:11,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:18:11,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/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-11 13:18:11,523 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:11,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:11,524 INFO L85 PathProgramCache]: Analyzing trace with hash 197605501, now seen corresponding path program 1 times [2024-10-11 13:18:11,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:11,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326817558] [2024-10-11 13:18:11,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:11,524 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-11 13:18:11,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:11,525 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/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-11 13:18:11,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:18:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:11,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 13:18:11,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:11,853 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 33 treesize of output 28 [2024-10-11 13:18:12,211 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 30 treesize of output 26 [2024-10-11 13:18:12,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2024-10-11 13:18:12,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:18:12,914 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 73 treesize of output 35 [2024-10-11 13:18:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:18:13,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:18:13,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:13,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326817558] [2024-10-11 13:18:13,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326817558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:13,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:13,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 13:18:13,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034590890] [2024-10-11 13:18:13,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:13,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:18:13,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:13,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:18:13,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:18:13,297 INFO L87 Difference]: Start difference. First operand 211 states and 273 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:18:18,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:18,632 INFO L93 Difference]: Finished difference Result 669 states and 852 transitions. [2024-10-11 13:18:18,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 13:18:18,633 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2024-10-11 13:18:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:18,635 INFO L225 Difference]: With dead ends: 669 [2024-10-11 13:18:18,635 INFO L226 Difference]: Without dead ends: 459 [2024-10-11 13:18:18,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2024-10-11 13:18:18,636 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 236 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:18,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1017 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 13:18:18,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-11 13:18:18,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 241. [2024-10-11 13:18:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 209 states have (on average 1.2727272727272727) internal successors, (266), 210 states have internal predecessors, (266), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:18:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 310 transitions. [2024-10-11 13:18:18,664 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 310 transitions. Word has length 100 [2024-10-11 13:18:18,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:18,665 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 310 transitions. [2024-10-11 13:18:18,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:18:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 310 transitions. [2024-10-11 13:18:18,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:18:18,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:18,666 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:18,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:18:18,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/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-11 13:18:18,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:18,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:18,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1776612860, now seen corresponding path program 1 times [2024-10-11 13:18:18,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:18,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189886300] [2024-10-11 13:18:18,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:18,872 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-11 13:18:18,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:18,875 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/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-11 13:18:18,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:18:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:19,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:18:19,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:19,041 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-11 13:18:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:18:19,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:18:19,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:19,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189886300] [2024-10-11 13:18:19,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189886300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:19,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:19,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:18:19,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098594012] [2024-10-11 13:18:19,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:19,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:18:19,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:19,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:18:19,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:18:19,104 INFO L87 Difference]: Start difference. First operand 241 states and 310 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:18:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:19,198 INFO L93 Difference]: Finished difference Result 477 states and 613 transitions. [2024-10-11 13:18:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:18:19,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-10-11 13:18:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:19,200 INFO L225 Difference]: With dead ends: 477 [2024-10-11 13:18:19,200 INFO L226 Difference]: Without dead ends: 237 [2024-10-11 13:18:19,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:18:19,201 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:19,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:18:19,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-11 13:18:19,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-10-11 13:18:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 205 states have (on average 1.248780487804878) internal successors, (256), 206 states have internal predecessors, (256), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:18:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 300 transitions. [2024-10-11 13:18:19,218 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 300 transitions. Word has length 100 [2024-10-11 13:18:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:19,219 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 300 transitions. [2024-10-11 13:18:19,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:18:19,219 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 300 transitions. [2024-10-11 13:18:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:18:19,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:19,220 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:19,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:18:19,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/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-11 13:18:19,421 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:19,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:19,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1306810966, now seen corresponding path program 1 times [2024-10-11 13:18:19,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:19,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506827801] [2024-10-11 13:18:19,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:19,422 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-11 13:18:19,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:19,424 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/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-11 13:18:19,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:18:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:19,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:18:19,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:19,576 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-11 13:18:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:18:19,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:18:19,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:19,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506827801] [2024-10-11 13:18:19,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506827801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:19,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:19,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:18:19,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482484883] [2024-10-11 13:18:19,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:19,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:18:19,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:19,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:18:19,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:18:19,641 INFO L87 Difference]: Start difference. First operand 237 states and 300 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:18:19,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:19,745 INFO L93 Difference]: Finished difference Result 428 states and 539 transitions. [2024-10-11 13:18:19,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:18:19,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-10-11 13:18:19,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:19,747 INFO L225 Difference]: With dead ends: 428 [2024-10-11 13:18:19,747 INFO L226 Difference]: Without dead ends: 192 [2024-10-11 13:18:19,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:18:19,748 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:19,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:18:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-11 13:18:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-10-11 13:18:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 160 states have (on average 1.2125) internal successors, (194), 161 states have internal predecessors, (194), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:18:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 238 transitions. [2024-10-11 13:18:19,773 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 238 transitions. Word has length 100 [2024-10-11 13:18:19,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:19,774 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 238 transitions. [2024-10-11 13:18:19,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:18:19,774 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 238 transitions. [2024-10-11 13:18:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:18:19,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:19,775 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:19,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 13:18:19,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/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-11 13:18:19,975 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:19,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:19,976 INFO L85 PathProgramCache]: Analyzing trace with hash 848504036, now seen corresponding path program 1 times [2024-10-11 13:18:19,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:19,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409659850] [2024-10-11 13:18:19,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:19,976 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-11 13:18:19,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:19,978 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/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-11 13:18:19,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:18:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:20,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 13:18:20,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:20,802 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-11 13:18:21,930 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 121 treesize of output 61 [2024-10-11 13:18:23,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:18:23,214 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 154 treesize of output 58 [2024-10-11 13:18:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-11 13:18:23,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:18:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:18:25,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:25,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409659850] [2024-10-11 13:18:25,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409659850] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:18:25,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:18:25,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2024-10-11 13:18:25,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328484750] [2024-10-11 13:18:25,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:25,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:18:25,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:25,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:18:25,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:18:25,343 INFO L87 Difference]: Start difference. First operand 192 states and 238 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:18:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:27,714 INFO L93 Difference]: Finished difference Result 545 states and 677 transitions. [2024-10-11 13:18:27,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:18:27,715 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2024-10-11 13:18:27,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:27,717 INFO L225 Difference]: With dead ends: 545 [2024-10-11 13:18:27,717 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 13:18:27,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2024-10-11 13:18:27,718 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 275 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:27,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 854 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 13:18:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 13:18:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 226. [2024-10-11 13:18:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 194 states have (on average 1.211340206185567) internal successors, (235), 195 states have internal predecessors, (235), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:18:27,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 279 transitions. [2024-10-11 13:18:27,750 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 279 transitions. Word has length 102 [2024-10-11 13:18:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:27,750 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 279 transitions. [2024-10-11 13:18:27,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:18:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 279 transitions. [2024-10-11 13:18:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:18:27,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:27,751 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:27,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:18:27,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/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-11 13:18:27,954 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:27,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:27,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1528562406, now seen corresponding path program 1 times [2024-10-11 13:18:27,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:27,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867892448] [2024-10-11 13:18:27,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:27,955 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-11 13:18:27,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:27,956 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/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-11 13:18:27,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:18:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:28,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:18:28,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:29,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:18:29,823 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 119 treesize of output 41 [2024-10-11 13:18:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:18:29,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:18:29,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867892448] [2024-10-11 13:18:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867892448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:29,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:29,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:18:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929335839] [2024-10-11 13:18:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:29,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:18:29,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:29,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:18:29,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:18:29,987 INFO L87 Difference]: Start difference. First operand 226 states and 279 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:18:32,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:32,326 INFO L93 Difference]: Finished difference Result 702 states and 871 transitions. [2024-10-11 13:18:32,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:18:32,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2024-10-11 13:18:32,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:32,329 INFO L225 Difference]: With dead ends: 702 [2024-10-11 13:18:32,329 INFO L226 Difference]: Without dead ends: 477 [2024-10-11 13:18:32,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:18:32,330 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 210 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:32,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 526 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 13:18:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-11 13:18:32,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 252. [2024-10-11 13:18:32,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 220 states have (on average 1.2) internal successors, (264), 221 states have internal predecessors, (264), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:18:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 308 transitions. [2024-10-11 13:18:32,351 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 308 transitions. Word has length 102 [2024-10-11 13:18:32,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:32,351 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 308 transitions. [2024-10-11 13:18:32,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:18:32,351 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 308 transitions. [2024-10-11 13:18:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:18:32,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:32,352 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:32,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:18:32,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/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-11 13:18:32,553 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:32,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:32,553 INFO L85 PathProgramCache]: Analyzing trace with hash 709395635, now seen corresponding path program 1 times [2024-10-11 13:18:32,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:32,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450834242] [2024-10-11 13:18:32,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:32,554 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-11 13:18:32,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:32,556 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/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-11 13:18:32,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:18:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:32,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 13:18:32,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:34,846 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 119 treesize of output 59 [2024-10-11 13:18:36,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:18:36,330 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 131 treesize of output 47 [2024-10-11 13:18:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-11 13:18:36,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:18:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:18:38,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:38,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450834242] [2024-10-11 13:18:38,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450834242] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:18:38,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:18:38,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2024-10-11 13:18:38,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800729428] [2024-10-11 13:18:38,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:38,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:18:38,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:38,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:18:38,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:18:38,205 INFO L87 Difference]: Start difference. First operand 252 states and 308 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:18:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:40,504 INFO L93 Difference]: Finished difference Result 621 states and 761 transitions. [2024-10-11 13:18:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:18:40,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2024-10-11 13:18:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:40,507 INFO L225 Difference]: With dead ends: 621 [2024-10-11 13:18:40,507 INFO L226 Difference]: Without dead ends: 370 [2024-10-11 13:18:40,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:18:40,508 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 378 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:40,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 551 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 13:18:40,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-10-11 13:18:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 243. [2024-10-11 13:18:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 211 states have (on average 1.2037914691943128) internal successors, (254), 212 states have internal predecessors, (254), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:18:40,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 298 transitions. [2024-10-11 13:18:40,527 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 298 transitions. Word has length 102 [2024-10-11 13:18:40,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:40,528 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 298 transitions. [2024-10-11 13:18:40,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:18:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 298 transitions. [2024-10-11 13:18:40,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:18:40,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:40,529 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:40,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 13:18:40,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/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-11 13:18:40,730 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:40,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash -2022029903, now seen corresponding path program 1 times [2024-10-11 13:18:40,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:40,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977755949] [2024-10-11 13:18:40,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:40,731 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-11 13:18:40,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:40,736 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/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-11 13:18:40,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-11 13:18:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:40,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 13:18:40,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:41,544 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-11 13:18:42,903 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 119 treesize of output 59 [2024-10-11 13:18:43,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:18:43,199 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 152 treesize of output 56 [2024-10-11 13:18:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-11 13:18:43,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:18:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:18:44,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:44,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977755949] [2024-10-11 13:18:44,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977755949] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:18:44,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:18:44,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-10-11 13:18:44,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441125065] [2024-10-11 13:18:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:44,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:18:44,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:44,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:18:44,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:18:44,606 INFO L87 Difference]: Start difference. First operand 243 states and 298 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:18:46,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:46,001 INFO L93 Difference]: Finished difference Result 545 states and 673 transitions. [2024-10-11 13:18:46,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:18:46,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2024-10-11 13:18:46,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:46,005 INFO L225 Difference]: With dead ends: 545 [2024-10-11 13:18:46,005 INFO L226 Difference]: Without dead ends: 303 [2024-10-11 13:18:46,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:18:46,006 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 95 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:46,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 495 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 13:18:46,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-11 13:18:46,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 234. [2024-10-11 13:18:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 202 states have (on average 1.193069306930693) internal successors, (241), 203 states have internal predecessors, (241), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:18:46,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 285 transitions. [2024-10-11 13:18:46,031 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 285 transitions. Word has length 102 [2024-10-11 13:18:46,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:46,031 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 285 transitions. [2024-10-11 13:18:46,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:18:46,031 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 285 transitions. [2024-10-11 13:18:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 13:18:46,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:46,032 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:46,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-11 13:18:46,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/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-11 13:18:46,237 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:46,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:46,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1415540659, now seen corresponding path program 1 times [2024-10-11 13:18:46,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:46,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940834237] [2024-10-11 13:18:46,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:46,237 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-11 13:18:46,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:46,239 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/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-11 13:18:46,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (19)] Waiting until timeout for monitored process [2024-10-11 13:18:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:46,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 13:18:46,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:47,044 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 19 treesize of output 1 [2024-10-11 13:18:49,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 33