./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 13801fa2c96f7c93ace2086dcc65f456b83ac056f84901412492a5919d95dd03 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 09:50:18,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 09:50:18,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 09:50:19,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 09:50:19,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 09:50:19,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 09:50:19,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 09:50:19,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 09:50:19,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 09:50:19,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 09:50:19,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 09:50:19,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 09:50:19,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 09:50:19,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 09:50:19,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 09:50:19,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 09:50:19,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 09:50:19,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 09:50:19,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 09:50:19,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 09:50:19,027 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 09:50:19,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 09:50:19,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 09:50:19,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 09:50:19,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 09:50:19,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 09:50:19,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 09:50:19,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 09:50:19,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 09:50:19,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 09:50:19,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 09:50:19,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 09:50:19,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 09:50:19,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 09:50:19,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 09:50:19,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 09:50:19,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 09:50:19,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 09:50:19,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 09:50:19,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 09:50:19,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 09:50:19,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 09:50:19,037 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 09:50:19,051 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 09:50:19,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 09:50:19,052 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 09:50:19,052 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 09:50:19,052 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 09:50:19,052 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 09:50:19,053 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 09:50:19,053 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 09:50:19,053 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 09:50:19,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 09:50:19,054 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 09:50:19,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 09:50:19,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 09:50:19,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 09:50:19,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 09:50:19,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 09:50:19,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 09:50:19,055 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 09:50:19,055 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 09:50:19,055 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 09:50:19,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 09:50:19,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 09:50:19,056 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 09:50:19,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 09:50:19,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 09:50:19,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 09:50:19,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 09:50:19,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 09:50:19,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 09:50:19,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 09:50:19,057 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 09:50:19,057 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 09:50:19,057 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 09:50:19,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 13801fa2c96f7c93ace2086dcc65f456b83ac056f84901412492a5919d95dd03 [2022-07-12 09:50:19,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 09:50:19,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 09:50:19,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 09:50:19,231 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 09:50:19,232 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 09:50:19,233 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c [2022-07-12 09:50:19,288 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1ad71e7/7305e0035ce0417186d268a4c9dfb238/FLAG150cbcd64 [2022-07-12 09:50:19,679 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 09:50:19,680 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c [2022-07-12 09:50:19,685 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1ad71e7/7305e0035ce0417186d268a4c9dfb238/FLAG150cbcd64 [2022-07-12 09:50:19,696 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1ad71e7/7305e0035ce0417186d268a4c9dfb238 [2022-07-12 09:50:19,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 09:50:19,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 09:50:19,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 09:50:19,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 09:50:19,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 09:50:19,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 09:50:19" (1/1) ... [2022-07-12 09:50:19,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652cd7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:19, skipping insertion in model container [2022-07-12 09:50:19,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 09:50:19" (1/1) ... [2022-07-12 09:50:19,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 09:50:19,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 09:50:19,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c[1995,2008] [2022-07-12 09:50:19,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c[2364,2377] [2022-07-12 09:50:19,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 09:50:19,909 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 09:50:19,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c[1995,2008] [2022-07-12 09:50:19,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c[2364,2377] [2022-07-12 09:50:19,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 09:50:19,962 INFO L208 MainTranslator]: Completed translation [2022-07-12 09:50:19,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:19 WrapperNode [2022-07-12 09:50:19,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 09:50:19,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 09:50:19,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 09:50:19,967 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 09:50:19,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:19" (1/1) ... [2022-07-12 09:50:19,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:19" (1/1) ... [2022-07-12 09:50:19,996 INFO L137 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 234 [2022-07-12 09:50:19,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 09:50:19,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 09:50:19,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 09:50:19,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 09:50:20,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:19" (1/1) ... [2022-07-12 09:50:20,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:19" (1/1) ... [2022-07-12 09:50:20,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:19" (1/1) ... [2022-07-12 09:50:20,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:19" (1/1) ... [2022-07-12 09:50:20,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:19" (1/1) ... [2022-07-12 09:50:20,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:19" (1/1) ... [2022-07-12 09:50:20,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:19" (1/1) ... [2022-07-12 09:50:20,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 09:50:20,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 09:50:20,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 09:50:20,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 09:50:20,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:19" (1/1) ... [2022-07-12 09:50:20,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 09:50:20,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:50:20,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 09:50:20,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 09:50:20,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 09:50:20,111 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-12 09:50:20,111 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-12 09:50:20,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 09:50:20,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 09:50:20,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 09:50:20,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 09:50:20,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 09:50:20,218 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 09:50:20,220 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 09:50:20,588 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 09:50:20,593 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 09:50:20,593 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 09:50:20,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 09:50:20 BoogieIcfgContainer [2022-07-12 09:50:20,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 09:50:20,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 09:50:20,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 09:50:20,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 09:50:20,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 09:50:19" (1/3) ... [2022-07-12 09:50:20,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d29df9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 09:50:20, skipping insertion in model container [2022-07-12 09:50:20,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:19" (2/3) ... [2022-07-12 09:50:20,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d29df9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 09:50:20, skipping insertion in model container [2022-07-12 09:50:20,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 09:50:20" (3/3) ... [2022-07-12 09:50:20,603 INFO L111 eAbstractionObserver]: Analyzing ICFG square_8+soft_float_1-3a.c.cil.c [2022-07-12 09:50:20,613 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 09:50:20,613 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 09:50:20,666 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 09:50:20,678 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2b4c45d9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@457c9881 [2022-07-12 09:50:20,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-12 09:50:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 101 states have (on average 1.702970297029703) internal successors, (172), 105 states have internal predecessors, (172), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-12 09:50:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 09:50:20,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:50:20,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:50:20,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:50:20,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:50:20,696 INFO L85 PathProgramCache]: Analyzing trace with hash -685161840, now seen corresponding path program 1 times [2022-07-12 09:50:20,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:50:20,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102334948] [2022-07-12 09:50:20,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:50:20,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:50:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:50:20,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 09:50:20,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:50:20,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102334948] [2022-07-12 09:50:20,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102334948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:50:20,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:50:20,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 09:50:20,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845652648] [2022-07-12 09:50:20,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:50:20,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 09:50:20,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:50:20,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 09:50:20,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 09:50:20,827 INFO L87 Difference]: Start difference. First operand has 115 states, 101 states have (on average 1.702970297029703) internal successors, (172), 105 states have internal predecessors, (172), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 09:50:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:50:20,866 INFO L93 Difference]: Finished difference Result 225 states and 381 transitions. [2022-07-12 09:50:20,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 09:50:20,868 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-12 09:50:20,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:50:20,874 INFO L225 Difference]: With dead ends: 225 [2022-07-12 09:50:20,875 INFO L226 Difference]: Without dead ends: 108 [2022-07-12 09:50:20,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 09:50:20,880 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 09:50:20,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 09:50:20,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-12 09:50:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-07-12 09:50:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.5157894736842106) internal successors, (144), 98 states have internal predecessors, (144), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 09:50:20,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 161 transitions. [2022-07-12 09:50:20,909 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 161 transitions. Word has length 7 [2022-07-12 09:50:20,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:50:20,910 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 161 transitions. [2022-07-12 09:50:20,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 09:50:20,911 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 161 transitions. [2022-07-12 09:50:20,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 09:50:20,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:50:20,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:50:20,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 09:50:20,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:50:20,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:50:20,913 INFO L85 PathProgramCache]: Analyzing trace with hash -685102258, now seen corresponding path program 1 times [2022-07-12 09:50:20,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:50:20,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813623379] [2022-07-12 09:50:20,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:50:20,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:50:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 09:50:20,931 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 09:50:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 09:50:20,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 09:50:20,969 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 09:50:20,970 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-12 09:50:20,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-12 09:50:20,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 09:50:20,974 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-12 09:50:20,976 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 09:50:20,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 09:50:20 BoogieIcfgContainer [2022-07-12 09:50:20,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 09:50:20,995 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 09:50:20,995 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 09:50:20,995 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 09:50:20,996 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 09:50:20" (3/4) ... [2022-07-12 09:50:20,997 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 09:50:20,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 09:50:20,999 INFO L158 Benchmark]: Toolchain (without parser) took 1299.66ms. Allocated memory is still 132.1MB. Free memory was 99.3MB in the beginning and 91.5MB in the end (delta: 7.8MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2022-07-12 09:50:20,999 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 40.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 09:50:21,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.34ms. Allocated memory is still 132.1MB. Free memory was 99.3MB in the beginning and 101.6MB in the end (delta: -2.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 09:50:21,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.06ms. Allocated memory is still 132.1MB. Free memory was 101.6MB in the beginning and 99.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 09:50:21,004 INFO L158 Benchmark]: Boogie Preprocessor took 21.13ms. Allocated memory is still 132.1MB. Free memory was 99.2MB in the beginning and 97.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 09:50:21,004 INFO L158 Benchmark]: RCFGBuilder took 576.30ms. Allocated memory is still 132.1MB. Free memory was 97.5MB in the beginning and 76.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-12 09:50:21,004 INFO L158 Benchmark]: TraceAbstraction took 397.91ms. Allocated memory is still 132.1MB. Free memory was 76.1MB in the beginning and 91.5MB in the end (delta: -15.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 09:50:21,004 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 132.1MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 09:50:21,009 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 40.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.34ms. Allocated memory is still 132.1MB. Free memory was 99.3MB in the beginning and 101.6MB in the end (delta: -2.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.06ms. Allocated memory is still 132.1MB. Free memory was 101.6MB in the beginning and 99.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.13ms. Allocated memory is still 132.1MB. Free memory was 99.2MB in the beginning and 97.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 576.30ms. Allocated memory is still 132.1MB. Free memory was 97.5MB in the beginning and 76.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 397.91ms. Allocated memory is still 132.1MB. Free memory was 76.1MB in the beginning and 91.5MB in the end (delta: -15.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 132.1MB. Free memory is still 91.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 48]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryArithmeticFLOAToperation at line 45. Possible FailurePath: [L402] COND TRUE __VERIFIER_nondet_int() [L403] CALL main1() [L39] float IN = __VERIFIER_nondet_float(); [L40] CALL assume_abort_if_not(IN >= 0.0f && IN < 1.0f) [L34] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L40] RET assume_abort_if_not(IN >= 0.0f && IN < 1.0f) [L42] float x = IN; [L44-L45] float result = 1.0f + 0.5f*x - 0.125f*x*x + 0.0625f*x*x*x - 0.0390625f*x*x*x*x; VAL [IN=49, x=49] [L47] COND TRUE !(result >= 0.0f && result < 1.5f) VAL [IN=49, x=49] [L48] reach_error() VAL [IN=49, x=49] - UnprovableResult [Line: 60]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 170 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 [2022-07-12 09:50:21,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 13801fa2c96f7c93ace2086dcc65f456b83ac056f84901412492a5919d95dd03 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 09:50:22,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 09:50:22,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 09:50:22,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 09:50:22,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 09:50:22,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 09:50:22,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 09:50:22,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 09:50:22,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 09:50:22,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 09:50:22,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 09:50:22,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 09:50:22,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 09:50:22,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 09:50:22,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 09:50:22,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 09:50:22,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 09:50:22,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 09:50:22,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 09:50:22,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 09:50:22,727 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 09:50:22,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 09:50:22,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 09:50:22,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 09:50:22,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 09:50:22,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 09:50:22,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 09:50:22,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 09:50:22,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 09:50:22,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 09:50:22,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 09:50:22,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 09:50:22,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 09:50:22,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 09:50:22,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 09:50:22,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 09:50:22,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 09:50:22,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 09:50:22,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 09:50:22,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 09:50:22,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 09:50:22,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 09:50:22,746 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 09:50:22,772 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 09:50:22,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 09:50:22,772 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 09:50:22,773 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 09:50:22,773 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 09:50:22,773 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 09:50:22,774 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 09:50:22,774 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 09:50:22,774 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 09:50:22,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 09:50:22,782 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 09:50:22,782 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 09:50:22,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 09:50:22,782 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 09:50:22,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 09:50:22,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 09:50:22,783 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 09:50:22,783 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 09:50:22,783 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 09:50:22,783 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 09:50:22,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 09:50:22,784 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 09:50:22,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 09:50:22,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 09:50:22,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 09:50:22,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 09:50:22,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 09:50:22,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 09:50:22,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 09:50:22,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 09:50:22,785 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 09:50:22,785 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 09:50:22,785 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 09:50:22,786 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 09:50:22,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 09:50:22,786 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 09:50:22,786 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 13801fa2c96f7c93ace2086dcc65f456b83ac056f84901412492a5919d95dd03 [2022-07-12 09:50:23,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 09:50:23,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 09:50:23,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 09:50:23,087 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 09:50:23,088 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 09:50:23,089 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c [2022-07-12 09:50:23,154 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bf5c012a/b8ca3c5f75924d6e810bd9b160050dd8/FLAGbf5e3300c [2022-07-12 09:50:23,497 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 09:50:23,498 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c [2022-07-12 09:50:23,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bf5c012a/b8ca3c5f75924d6e810bd9b160050dd8/FLAGbf5e3300c [2022-07-12 09:50:23,893 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bf5c012a/b8ca3c5f75924d6e810bd9b160050dd8 [2022-07-12 09:50:23,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 09:50:23,896 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 09:50:23,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 09:50:23,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 09:50:23,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 09:50:23,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 09:50:23" (1/1) ... [2022-07-12 09:50:23,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1248b806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:23, skipping insertion in model container [2022-07-12 09:50:23,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 09:50:23" (1/1) ... [2022-07-12 09:50:23,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 09:50:23,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 09:50:24,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c[1995,2008] [2022-07-12 09:50:24,039 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c[2364,2377] [2022-07-12 09:50:24,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 09:50:24,125 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 09:50:24,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c[1995,2008] [2022-07-12 09:50:24,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/square_8+soft_float_1-3a.c.cil.c[2364,2377] [2022-07-12 09:50:24,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 09:50:24,167 INFO L208 MainTranslator]: Completed translation [2022-07-12 09:50:24,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:24 WrapperNode [2022-07-12 09:50:24,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 09:50:24,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 09:50:24,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 09:50:24,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 09:50:24,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:24" (1/1) ... [2022-07-12 09:50:24,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:24" (1/1) ... [2022-07-12 09:50:24,196 INFO L137 Inliner]: procedures = 28, calls = 21, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 164 [2022-07-12 09:50:24,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 09:50:24,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 09:50:24,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 09:50:24,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 09:50:24,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:24" (1/1) ... [2022-07-12 09:50:24,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:24" (1/1) ... [2022-07-12 09:50:24,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:24" (1/1) ... [2022-07-12 09:50:24,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:24" (1/1) ... [2022-07-12 09:50:24,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:24" (1/1) ... [2022-07-12 09:50:24,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:24" (1/1) ... [2022-07-12 09:50:24,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:24" (1/1) ... [2022-07-12 09:50:24,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 09:50:24,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 09:50:24,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 09:50:24,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 09:50:24,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:24" (1/1) ... [2022-07-12 09:50:24,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 09:50:24,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:50:24,269 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 09:50:24,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 09:50:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 09:50:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 09:50:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-12 09:50:24,298 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-12 09:50:24,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 09:50:24,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 09:50:24,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 09:50:24,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 09:50:24,348 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 09:50:24,349 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 09:50:26,790 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 09:50:26,795 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 09:50:26,795 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 09:50:26,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 09:50:26 BoogieIcfgContainer [2022-07-12 09:50:26,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 09:50:26,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 09:50:26,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 09:50:26,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 09:50:26,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 09:50:23" (1/3) ... [2022-07-12 09:50:26,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c391484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 09:50:26, skipping insertion in model container [2022-07-12 09:50:26,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:50:24" (2/3) ... [2022-07-12 09:50:26,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c391484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 09:50:26, skipping insertion in model container [2022-07-12 09:50:26,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 09:50:26" (3/3) ... [2022-07-12 09:50:26,806 INFO L111 eAbstractionObserver]: Analyzing ICFG square_8+soft_float_1-3a.c.cil.c [2022-07-12 09:50:26,820 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 09:50:26,821 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 09:50:26,860 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 09:50:26,864 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@83127e8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2de7827 [2022-07-12 09:50:26,865 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-12 09:50:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 71 states have internal predecessors, (106), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-12 09:50:26,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 09:50:26,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:50:26,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:50:26,872 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:50:26,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:50:26,876 INFO L85 PathProgramCache]: Analyzing trace with hash -548115930, now seen corresponding path program 1 times [2022-07-12 09:50:26,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 09:50:26,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672008193] [2022-07-12 09:50:26,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:50:26,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 09:50:26,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 09:50:26,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 09:50:26,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 09:50:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:50:27,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 09:50:27,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:50:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 09:50:27,264 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:50:27,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 09:50:27,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672008193] [2022-07-12 09:50:27,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672008193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:50:27,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:50:27,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 09:50:27,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898943624] [2022-07-12 09:50:27,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:50:27,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 09:50:27,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 09:50:27,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 09:50:27,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 09:50:27,315 INFO L87 Difference]: Start difference. First operand has 81 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 71 states have internal predecessors, (106), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 09:50:27,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:50:27,343 INFO L93 Difference]: Finished difference Result 157 states and 249 transitions. [2022-07-12 09:50:27,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 09:50:27,345 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-12 09:50:27,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:50:27,353 INFO L225 Difference]: With dead ends: 157 [2022-07-12 09:50:27,353 INFO L226 Difference]: Without dead ends: 74 [2022-07-12 09:50:27,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 09:50:27,357 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 09:50:27,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 09:50:27,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-12 09:50:27,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-07-12 09:50:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 64 states have internal predecessors, (91), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 09:50:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 108 transitions. [2022-07-12 09:50:27,388 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 108 transitions. Word has length 7 [2022-07-12 09:50:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:50:27,389 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 108 transitions. [2022-07-12 09:50:27,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 09:50:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 108 transitions. [2022-07-12 09:50:27,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 09:50:27,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:50:27,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:50:27,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 09:50:27,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 09:50:27,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:50:27,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:50:27,596 INFO L85 PathProgramCache]: Analyzing trace with hash -548056348, now seen corresponding path program 1 times [2022-07-12 09:50:27,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 09:50:27,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20964402] [2022-07-12 09:50:27,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:50:27,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 09:50:27,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 09:50:27,602 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 09:50:27,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 09:52:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:52:11,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 09:52:11,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:52:48,311 WARN L233 SmtUtils]: Spent 12.53s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 09:53:20,847 WARN L833 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (and (not (fp.lt (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)))) (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0)))) (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (and (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (_ +zero 8 24))) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse1))))) is different from false [2022-07-12 09:53:22,919 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (and (not (fp.lt (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)))) (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0)))) (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (and (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (_ +zero 8 24))) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse1))))) is different from true [2022-07-12 09:53:22,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 09:53:22,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:53:22,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 09:53:22,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20964402] [2022-07-12 09:53:22,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20964402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:53:22,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:53:22,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 09:53:22,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555129939] [2022-07-12 09:53:22,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:53:22,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 09:53:22,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 09:53:22,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 09:53:22,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=13, Unknown=7, NotChecked=8, Total=42 [2022-07-12 09:53:22,922 INFO L87 Difference]: Start difference. First operand 74 states and 108 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 09:53:29,606 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 09:53:30,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:53:30,030 INFO L93 Difference]: Finished difference Result 74 states and 108 transitions. [2022-07-12 09:53:30,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 09:53:30,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-12 09:53:30,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:53:30,032 INFO L225 Difference]: With dead ends: 74 [2022-07-12 09:53:30,033 INFO L226 Difference]: Without dead ends: 69 [2022-07-12 09:53:30,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=19, Invalid=18, Unknown=9, NotChecked=10, Total=56 [2022-07-12 09:53:30,034 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 104 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-12 09:53:30,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 273 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 1 Unknown, 211 Unchecked, 2.7s Time] [2022-07-12 09:53:30,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-12 09:53:30,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-07-12 09:53:30,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 59 states have internal predecessors, (86), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 09:53:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2022-07-12 09:53:30,042 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 7 [2022-07-12 09:53:30,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:53:30,042 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2022-07-12 09:53:30,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 09:53:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2022-07-12 09:53:30,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 09:53:30,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:53:30,043 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:53:30,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 09:53:30,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 09:53:30,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:53:30,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:53:30,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1413922597, now seen corresponding path program 1 times [2022-07-12 09:53:30,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 09:53:30,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947870145] [2022-07-12 09:53:30,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:53:30,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 09:53:30,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 09:53:30,248 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 09:53:30,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 09:53:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:53:30,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 09:53:30,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:53:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 09:53:30,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 09:53:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 09:53:30,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 09:53:30,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947870145] [2022-07-12 09:53:30,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947870145] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 09:53:30,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 09:53:30,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-12 09:53:30,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111559815] [2022-07-12 09:53:30,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 09:53:30,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 09:53:30,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 09:53:30,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 09:53:30,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 09:53:30,986 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 09:53:31,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:53:31,450 INFO L93 Difference]: Finished difference Result 162 states and 253 transitions. [2022-07-12 09:53:31,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 09:53:31,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-07-12 09:53:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:53:31,457 INFO L225 Difference]: With dead ends: 162 [2022-07-12 09:53:31,457 INFO L226 Difference]: Without dead ends: 118 [2022-07-12 09:53:31,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 09:53:31,460 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 57 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 09:53:31,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 707 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 09:53:31,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-12 09:53:31,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 81. [2022-07-12 09:53:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 68 states have internal predecessors, (96), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-12 09:53:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 122 transitions. [2022-07-12 09:53:31,484 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 122 transitions. Word has length 33 [2022-07-12 09:53:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:53:31,484 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 122 transitions. [2022-07-12 09:53:31,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 09:53:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 122 transitions. [2022-07-12 09:53:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 09:53:31,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:53:31,486 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:53:31,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-12 09:53:31,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 09:53:31,696 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:53:31,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:53:31,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1578065669, now seen corresponding path program 1 times [2022-07-12 09:53:31,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 09:53:31,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464422694] [2022-07-12 09:53:31,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:53:31,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 09:53:31,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 09:53:31,725 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 09:53:31,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 09:53:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:53:31,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 09:53:31,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:53:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 09:53:32,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 09:53:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 09:53:32,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 09:53:32,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464422694] [2022-07-12 09:53:32,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464422694] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 09:53:32,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 09:53:32,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-12 09:53:32,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518941660] [2022-07-12 09:53:32,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 09:53:32,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 09:53:32,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 09:53:32,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 09:53:32,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 09:53:32,362 INFO L87 Difference]: Start difference. First operand 81 states and 122 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 09:53:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:53:32,929 INFO L93 Difference]: Finished difference Result 179 states and 276 transitions. [2022-07-12 09:53:32,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 09:53:32,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2022-07-12 09:53:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:53:32,930 INFO L225 Difference]: With dead ends: 179 [2022-07-12 09:53:32,930 INFO L226 Difference]: Without dead ends: 132 [2022-07-12 09:53:32,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 09:53:32,931 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 55 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 09:53:32,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 465 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 09:53:32,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-12 09:53:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2022-07-12 09:53:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 102 states have (on average 1.4313725490196079) internal successors, (146), 103 states have internal predecessors, (146), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (24), 20 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-12 09:53:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 188 transitions. [2022-07-12 09:53:32,941 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 188 transitions. Word has length 37 [2022-07-12 09:53:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:53:32,941 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 188 transitions. [2022-07-12 09:53:32,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 09:53:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 188 transitions. [2022-07-12 09:53:32,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 09:53:32,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:53:32,943 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:53:32,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 09:53:33,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 09:53:33,151 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:53:33,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:53:33,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1319900231, now seen corresponding path program 1 times [2022-07-12 09:53:33,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 09:53:33,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737567476] [2022-07-12 09:53:33,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:53:33,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 09:53:33,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 09:53:33,153 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 09:53:33,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 09:53:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:53:33,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 09:53:33,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:53:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 09:53:33,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:53:33,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 09:53:33,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737567476] [2022-07-12 09:53:33,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737567476] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:53:33,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:53:33,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 09:53:33,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821812109] [2022-07-12 09:53:33,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:53:33,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 09:53:33,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 09:53:33,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 09:53:33,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 09:53:33,495 INFO L87 Difference]: Start difference. First operand 124 states and 188 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:53:34,066 INFO L93 Difference]: Finished difference Result 280 states and 429 transitions. [2022-07-12 09:53:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 09:53:34,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-07-12 09:53:34,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:53:34,068 INFO L225 Difference]: With dead ends: 280 [2022-07-12 09:53:34,068 INFO L226 Difference]: Without dead ends: 210 [2022-07-12 09:53:34,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 09:53:34,069 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 52 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 09:53:34,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 462 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 09:53:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-12 09:53:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 206. [2022-07-12 09:53:34,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 174 states have (on average 1.4252873563218391) internal successors, (248), 173 states have internal predecessors, (248), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 34 states have call predecessors, (34), 27 states have call successors, (34) [2022-07-12 09:53:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 310 transitions. [2022-07-12 09:53:34,080 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 310 transitions. Word has length 37 [2022-07-12 09:53:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:53:34,081 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 310 transitions. [2022-07-12 09:53:34,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 310 transitions. [2022-07-12 09:53:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 09:53:34,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:53:34,082 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:53:34,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 09:53:34,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 09:53:34,290 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:53:34,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:53:34,291 INFO L85 PathProgramCache]: Analyzing trace with hash -639841861, now seen corresponding path program 1 times [2022-07-12 09:53:34,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 09:53:34,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805107245] [2022-07-12 09:53:34,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:53:34,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 09:53:34,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 09:53:34,293 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 09:53:34,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 09:53:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:53:34,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 09:53:34,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:53:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 09:53:34,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:53:34,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 09:53:34,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805107245] [2022-07-12 09:53:34,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805107245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:53:34,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:53:34,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 09:53:34,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660896693] [2022-07-12 09:53:34,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:53:34,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 09:53:34,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 09:53:34,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 09:53:34,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 09:53:34,864 INFO L87 Difference]: Start difference. First operand 206 states and 310 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:35,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:53:35,620 INFO L93 Difference]: Finished difference Result 294 states and 444 transitions. [2022-07-12 09:53:35,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 09:53:35,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-07-12 09:53:35,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:53:35,621 INFO L225 Difference]: With dead ends: 294 [2022-07-12 09:53:35,621 INFO L226 Difference]: Without dead ends: 230 [2022-07-12 09:53:35,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 09:53:35,622 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 105 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 09:53:35,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 545 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 09:53:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-12 09:53:35,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 188. [2022-07-12 09:53:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 162 states have (on average 1.3950617283950617) internal successors, (226), 161 states have internal predecessors, (226), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2022-07-12 09:53:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 276 transitions. [2022-07-12 09:53:35,631 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 276 transitions. Word has length 37 [2022-07-12 09:53:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:53:35,631 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 276 transitions. [2022-07-12 09:53:35,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 276 transitions. [2022-07-12 09:53:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 09:53:35,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:53:35,633 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:53:35,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 09:53:35,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 09:53:35,859 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:53:35,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:53:35,860 INFO L85 PathProgramCache]: Analyzing trace with hash 321822244, now seen corresponding path program 1 times [2022-07-12 09:53:35,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 09:53:35,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865828433] [2022-07-12 09:53:35,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:53:35,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 09:53:35,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 09:53:35,861 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 09:53:35,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 09:53:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:53:35,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 09:53:35,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:53:36,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 09:53:36,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 09:53:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 09:53:36,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 09:53:36,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865828433] [2022-07-12 09:53:36,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865828433] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 09:53:36,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 09:53:36,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-12 09:53:36,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672895593] [2022-07-12 09:53:36,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 09:53:36,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 09:53:36,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 09:53:36,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 09:53:36,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 09:53:36,870 INFO L87 Difference]: Start difference. First operand 188 states and 276 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 09:53:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:53:37,979 INFO L93 Difference]: Finished difference Result 276 states and 412 transitions. [2022-07-12 09:53:37,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 09:53:37,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-07-12 09:53:37,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:53:37,981 INFO L225 Difference]: With dead ends: 276 [2022-07-12 09:53:37,981 INFO L226 Difference]: Without dead ends: 238 [2022-07-12 09:53:37,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-12 09:53:37,982 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 195 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 09:53:37,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 652 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 09:53:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-12 09:53:37,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 179. [2022-07-12 09:53:37,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 156 states have (on average 1.3846153846153846) internal successors, (216), 155 states have internal predecessors, (216), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (25), 25 states have call predecessors, (25), 18 states have call successors, (25) [2022-07-12 09:53:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 260 transitions. [2022-07-12 09:53:37,988 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 260 transitions. Word has length 41 [2022-07-12 09:53:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:53:37,989 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 260 transitions. [2022-07-12 09:53:37,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 09:53:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 260 transitions. [2022-07-12 09:53:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 09:53:37,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:53:37,990 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:53:37,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 09:53:38,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 09:53:38,198 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:53:38,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:53:38,199 INFO L85 PathProgramCache]: Analyzing trace with hash 64679693, now seen corresponding path program 1 times [2022-07-12 09:53:38,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 09:53:38,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24689495] [2022-07-12 09:53:38,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:53:38,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 09:53:38,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 09:53:38,201 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 09:53:38,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 09:53:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:53:38,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 09:53:38,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:53:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 09:53:38,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:53:38,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 09:53:38,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24689495] [2022-07-12 09:53:38,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24689495] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:53:38,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:53:38,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 09:53:38,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947649748] [2022-07-12 09:53:38,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:53:38,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 09:53:38,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 09:53:38,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 09:53:38,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 09:53:38,463 INFO L87 Difference]: Start difference. First operand 179 states and 260 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:53:38,645 INFO L93 Difference]: Finished difference Result 332 states and 490 transitions. [2022-07-12 09:53:38,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 09:53:38,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-12 09:53:38,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:53:38,648 INFO L225 Difference]: With dead ends: 332 [2022-07-12 09:53:38,648 INFO L226 Difference]: Without dead ends: 266 [2022-07-12 09:53:38,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 09:53:38,649 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 66 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 09:53:38,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 336 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 09:53:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-12 09:53:38,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 234. [2022-07-12 09:53:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 208 states have (on average 1.3461538461538463) internal successors, (280), 207 states have internal predecessors, (280), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2022-07-12 09:53:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 330 transitions. [2022-07-12 09:53:38,671 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 330 transitions. Word has length 44 [2022-07-12 09:53:38,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:53:38,671 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 330 transitions. [2022-07-12 09:53:38,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 330 transitions. [2022-07-12 09:53:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 09:53:38,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:53:38,672 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:53:38,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-12 09:53:38,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 09:53:38,880 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:53:38,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:53:38,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1143994910, now seen corresponding path program 1 times [2022-07-12 09:53:38,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 09:53:38,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723399264] [2022-07-12 09:53:38,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:53:38,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 09:53:38,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 09:53:38,882 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 09:53:38,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 09:53:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:53:38,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 09:53:38,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:53:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 09:53:39,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:53:39,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 09:53:39,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723399264] [2022-07-12 09:53:39,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723399264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:53:39,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:53:39,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 09:53:39,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914871144] [2022-07-12 09:53:39,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:53:39,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 09:53:39,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 09:53:39,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 09:53:39,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 09:53:39,124 INFO L87 Difference]: Start difference. First operand 234 states and 330 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 09:53:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:53:39,463 INFO L93 Difference]: Finished difference Result 409 states and 574 transitions. [2022-07-12 09:53:39,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 09:53:39,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2022-07-12 09:53:39,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:53:39,465 INFO L225 Difference]: With dead ends: 409 [2022-07-12 09:53:39,465 INFO L226 Difference]: Without dead ends: 179 [2022-07-12 09:53:39,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 09:53:39,466 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 25 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 09:53:39,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 253 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 09:53:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-12 09:53:39,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2022-07-12 09:53:39,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 149 states have internal predecessors, (192), 15 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (20), 17 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-12 09:53:39,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 227 transitions. [2022-07-12 09:53:39,473 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 227 transitions. Word has length 44 [2022-07-12 09:53:39,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:53:39,474 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 227 transitions. [2022-07-12 09:53:39,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 09:53:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 227 transitions. [2022-07-12 09:53:39,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 09:53:39,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:53:39,477 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:53:39,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 09:53:39,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 09:53:39,685 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:53:39,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:53:39,685 INFO L85 PathProgramCache]: Analyzing trace with hash -610339590, now seen corresponding path program 1 times [2022-07-12 09:53:39,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 09:53:39,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496202759] [2022-07-12 09:53:39,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:53:39,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 09:53:39,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 09:53:39,688 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 09:53:39,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 09:53:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:53:39,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 09:53:39,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:53:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 09:53:40,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 09:53:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 09:53:41,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 09:53:41,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496202759] [2022-07-12 09:53:41,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496202759] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 09:53:41,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 09:53:41,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-07-12 09:53:41,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475267661] [2022-07-12 09:53:41,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:53:41,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 09:53:41,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 09:53:41,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 09:53:41,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-12 09:53:41,547 INFO L87 Difference]: Start difference. First operand 167 states and 227 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:53:43,604 INFO L93 Difference]: Finished difference Result 317 states and 460 transitions. [2022-07-12 09:53:43,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 09:53:43,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-07-12 09:53:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:53:43,607 INFO L225 Difference]: With dead ends: 317 [2022-07-12 09:53:43,607 INFO L226 Difference]: Without dead ends: 281 [2022-07-12 09:53:43,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-12 09:53:43,607 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 188 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 09:53:43,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 501 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 09:53:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-07-12 09:53:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 205. [2022-07-12 09:53:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 179 states have (on average 1.3016759776536313) internal successors, (233), 182 states have internal predecessors, (233), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-12 09:53:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 280 transitions. [2022-07-12 09:53:43,616 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 280 transitions. Word has length 45 [2022-07-12 09:53:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:53:43,616 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 280 transitions. [2022-07-12 09:53:43,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 280 transitions. [2022-07-12 09:53:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 09:53:43,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:53:43,617 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:53:43,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 09:53:43,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 09:53:43,827 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:53:43,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:53:43,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1164667772, now seen corresponding path program 1 times [2022-07-12 09:53:43,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 09:53:43,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106816558] [2022-07-12 09:53:43,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:53:43,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 09:53:43,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 09:53:43,830 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 09:53:43,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 09:53:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:53:43,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 09:53:43,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:53:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 09:53:44,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:53:44,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 09:53:44,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106816558] [2022-07-12 09:53:44,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106816558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:53:44,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:53:44,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 09:53:44,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575566833] [2022-07-12 09:53:44,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:53:44,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 09:53:44,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 09:53:44,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 09:53:44,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 09:53:44,058 INFO L87 Difference]: Start difference. First operand 205 states and 280 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:44,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:53:44,243 INFO L93 Difference]: Finished difference Result 212 states and 286 transitions. [2022-07-12 09:53:44,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 09:53:44,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-07-12 09:53:44,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:53:44,245 INFO L225 Difference]: With dead ends: 212 [2022-07-12 09:53:44,245 INFO L226 Difference]: Without dead ends: 205 [2022-07-12 09:53:44,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 09:53:44,246 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 5 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 09:53:44,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 384 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 09:53:44,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-12 09:53:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-07-12 09:53:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 179 states have (on average 1.2849162011173185) internal successors, (230), 182 states have internal predecessors, (230), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-12 09:53:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 277 transitions. [2022-07-12 09:53:44,262 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 277 transitions. Word has length 45 [2022-07-12 09:53:44,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:53:44,262 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 277 transitions. [2022-07-12 09:53:44,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:44,262 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 277 transitions. [2022-07-12 09:53:44,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 09:53:44,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:53:44,263 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:53:44,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 09:53:44,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 09:53:44,472 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:53:44,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:53:44,472 INFO L85 PathProgramCache]: Analyzing trace with hash -617643621, now seen corresponding path program 1 times [2022-07-12 09:53:44,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 09:53:44,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965087406] [2022-07-12 09:53:44,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:53:44,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 09:53:44,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 09:53:44,474 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 09:53:44,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 09:53:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:53:44,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 09:53:44,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:53:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 09:53:44,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:53:44,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 09:53:44,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965087406] [2022-07-12 09:53:44,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965087406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:53:44,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:53:44,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 09:53:44,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371930561] [2022-07-12 09:53:44,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:53:44,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 09:53:44,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 09:53:44,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 09:53:44,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 09:53:44,981 INFO L87 Difference]: Start difference. First operand 205 states and 277 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:53:45,406 INFO L93 Difference]: Finished difference Result 248 states and 338 transitions. [2022-07-12 09:53:45,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 09:53:45,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-07-12 09:53:45,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:53:45,407 INFO L225 Difference]: With dead ends: 248 [2022-07-12 09:53:45,407 INFO L226 Difference]: Without dead ends: 246 [2022-07-12 09:53:45,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 09:53:45,408 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 38 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 09:53:45,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 600 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 14 Unchecked, 0.2s Time] [2022-07-12 09:53:45,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-12 09:53:45,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 209. [2022-07-12 09:53:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 185 states have internal predecessors, (233), 21 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-12 09:53:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 280 transitions. [2022-07-12 09:53:45,417 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 280 transitions. Word has length 45 [2022-07-12 09:53:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:53:45,417 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 280 transitions. [2022-07-12 09:53:45,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 280 transitions. [2022-07-12 09:53:45,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 09:53:45,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:53:45,418 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:53:45,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 09:53:45,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 09:53:45,619 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:53:45,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:53:45,619 INFO L85 PathProgramCache]: Analyzing trace with hash -560385319, now seen corresponding path program 1 times [2022-07-12 09:53:45,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 09:53:45,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774406689] [2022-07-12 09:53:45,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:53:45,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 09:53:45,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 09:53:45,620 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 09:53:45,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 09:53:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:53:45,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 09:53:45,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:53:46,075 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 09:53:46,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:53:46,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 09:53:46,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774406689] [2022-07-12 09:53:46,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774406689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:53:46,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:53:46,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 09:53:46,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345271058] [2022-07-12 09:53:46,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:53:46,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 09:53:46,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 09:53:46,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 09:53:46,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 09:53:46,076 INFO L87 Difference]: Start difference. First operand 209 states and 280 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:53:46,410 INFO L93 Difference]: Finished difference Result 262 states and 354 transitions. [2022-07-12 09:53:46,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 09:53:46,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-07-12 09:53:46,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:53:46,411 INFO L225 Difference]: With dead ends: 262 [2022-07-12 09:53:46,411 INFO L226 Difference]: Without dead ends: 260 [2022-07-12 09:53:46,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 09:53:46,412 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 38 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 09:53:46,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 469 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 12 Unchecked, 0.1s Time] [2022-07-12 09:53:46,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-12 09:53:46,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 213. [2022-07-12 09:53:46,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 185 states have (on average 1.2756756756756757) internal successors, (236), 188 states have internal predecessors, (236), 21 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-12 09:53:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 283 transitions. [2022-07-12 09:53:46,422 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 283 transitions. Word has length 45 [2022-07-12 09:53:46,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:53:46,422 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 283 transitions. [2022-07-12 09:53:46,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 283 transitions. [2022-07-12 09:53:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 09:53:46,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:53:46,423 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:53:46,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 09:53:46,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 09:53:46,631 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:53:46,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:53:46,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1322710928, now seen corresponding path program 1 times [2022-07-12 09:53:46,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 09:53:46,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827038649] [2022-07-12 09:53:46,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:53:46,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 09:53:46,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 09:53:46,633 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 09:53:46,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 09:53:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:53:46,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 09:53:46,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:53:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 09:53:46,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:53:46,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 09:53:46,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827038649] [2022-07-12 09:53:46,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827038649] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:53:46,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:53:46,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 09:53:46,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788882339] [2022-07-12 09:53:46,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:53:46,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 09:53:46,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 09:53:46,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 09:53:46,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 09:53:46,880 INFO L87 Difference]: Start difference. First operand 213 states and 283 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:53:47,019 INFO L93 Difference]: Finished difference Result 352 states and 482 transitions. [2022-07-12 09:53:47,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 09:53:47,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2022-07-12 09:53:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:53:47,021 INFO L225 Difference]: With dead ends: 352 [2022-07-12 09:53:47,021 INFO L226 Difference]: Without dead ends: 300 [2022-07-12 09:53:47,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 09:53:47,021 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 75 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 09:53:47,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 321 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 09:53:47,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-07-12 09:53:47,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 232. [2022-07-12 09:53:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 201 states have (on average 1.2835820895522387) internal successors, (258), 203 states have internal predecessors, (258), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (29), 26 states have call predecessors, (29), 23 states have call successors, (29) [2022-07-12 09:53:47,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 311 transitions. [2022-07-12 09:53:47,040 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 311 transitions. Word has length 46 [2022-07-12 09:53:47,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:53:47,041 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 311 transitions. [2022-07-12 09:53:47,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 311 transitions. [2022-07-12 09:53:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 09:53:47,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:53:47,042 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:53:47,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-12 09:53:47,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 09:53:47,252 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:53:47,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:53:47,253 INFO L85 PathProgramCache]: Analyzing trace with hash -514674649, now seen corresponding path program 1 times [2022-07-12 09:53:47,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 09:53:47,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569780132] [2022-07-12 09:53:47,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:53:47,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 09:53:47,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 09:53:47,264 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 09:53:47,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 09:53:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:53:47,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 09:53:47,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:53:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 09:53:47,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:53:47,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 09:53:47,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569780132] [2022-07-12 09:53:47,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569780132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:53:47,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:53:47,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 09:53:47,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377733919] [2022-07-12 09:53:47,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:53:47,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 09:53:47,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 09:53:47,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 09:53:47,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 09:53:47,400 INFO L87 Difference]: Start difference. First operand 232 states and 311 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:53:47,518 INFO L93 Difference]: Finished difference Result 247 states and 327 transitions. [2022-07-12 09:53:47,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 09:53:47,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2022-07-12 09:53:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:53:47,520 INFO L225 Difference]: With dead ends: 247 [2022-07-12 09:53:47,521 INFO L226 Difference]: Without dead ends: 208 [2022-07-12 09:53:47,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 09:53:47,522 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 09:53:47,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 288 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 09:53:47,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-12 09:53:47,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-07-12 09:53:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 177 states have (on average 1.2994350282485876) internal successors, (230), 180 states have internal predecessors, (230), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (27), 25 states have call predecessors, (27), 23 states have call successors, (27) [2022-07-12 09:53:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 281 transitions. [2022-07-12 09:53:47,532 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 281 transitions. Word has length 49 [2022-07-12 09:53:47,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:53:47,532 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 281 transitions. [2022-07-12 09:53:47,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:47,533 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 281 transitions. [2022-07-12 09:53:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 09:53:47,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:53:47,534 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:53:47,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-12 09:53:47,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 09:53:47,741 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:53:47,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:53:47,741 INFO L85 PathProgramCache]: Analyzing trace with hash -627639643, now seen corresponding path program 1 times [2022-07-12 09:53:47,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 09:53:47,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745274344] [2022-07-12 09:53:47,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:53:47,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 09:53:47,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 09:53:47,743 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 09:53:47,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 09:53:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:53:47,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 09:53:47,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:53:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 09:53:47,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 09:53:47,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 09:53:47,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745274344] [2022-07-12 09:53:47,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745274344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:53:47,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:53:47,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 09:53:47,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700931140] [2022-07-12 09:53:47,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:53:47,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 09:53:47,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 09:53:47,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 09:53:47,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 09:53:47,995 INFO L87 Difference]: Start difference. First operand 208 states and 281 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 09:53:48,587 INFO L93 Difference]: Finished difference Result 335 states and 452 transitions. [2022-07-12 09:53:48,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 09:53:48,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-07-12 09:53:48,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 09:53:48,588 INFO L225 Difference]: With dead ends: 335 [2022-07-12 09:53:48,588 INFO L226 Difference]: Without dead ends: 293 [2022-07-12 09:53:48,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 09:53:48,589 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 200 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 09:53:48,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 421 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 09:53:48,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-07-12 09:53:48,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 208. [2022-07-12 09:53:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 177 states have (on average 1.2881355932203389) internal successors, (228), 180 states have internal predecessors, (228), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (27), 25 states have call predecessors, (27), 23 states have call successors, (27) [2022-07-12 09:53:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 279 transitions. [2022-07-12 09:53:48,600 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 279 transitions. Word has length 50 [2022-07-12 09:53:48,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 09:53:48,601 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 279 transitions. [2022-07-12 09:53:48,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 09:53:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 279 transitions. [2022-07-12 09:53:48,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 09:53:48,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 09:53:48,602 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:53:48,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 09:53:48,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 09:53:48,810 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 09:53:48,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:53:48,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1892770879, now seen corresponding path program 1 times [2022-07-12 09:53:48,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 09:53:48,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342440630] [2022-07-12 09:53:48,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:53:48,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 09:53:48,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 09:53:48,812 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 09:53:48,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 09:53:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 09:53:48,855 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 09:53:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 09:53:48,930 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-12 09:53:48,930 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 09:53:48,941 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-12 09:53:48,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-12 09:53:48,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-12 09:53:49,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 09:53:49,153 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:53:49,156 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 09:53:49,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 09:53:49 BoogieIcfgContainer [2022-07-12 09:53:49,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 09:53:49,183 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 09:53:49,183 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 09:53:49,183 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 09:53:49,184 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 09:50:26" (3/4) ... [2022-07-12 09:53:49,185 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 09:53:49,242 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 09:53:49,242 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 09:53:49,243 INFO L158 Benchmark]: Toolchain (without parser) took 205346.90ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 37.0MB in the beginning and 35.4MB in the end (delta: 1.6MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2022-07-12 09:53:49,243 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 40.7MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 09:53:49,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.14ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 36.9MB in the beginning and 61.5MB in the end (delta: -24.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 09:53:49,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.77ms. Allocated memory is still 81.8MB. Free memory was 61.5MB in the beginning and 59.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 09:53:49,244 INFO L158 Benchmark]: Boogie Preprocessor took 23.89ms. Allocated memory is still 81.8MB. Free memory was 59.2MB in the beginning and 57.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 09:53:49,247 INFO L158 Benchmark]: RCFGBuilder took 2578.03ms. Allocated memory is still 81.8MB. Free memory was 57.3MB in the beginning and 61.2MB in the end (delta: -3.9MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2022-07-12 09:53:49,247 INFO L158 Benchmark]: TraceAbstraction took 202382.53ms. Allocated memory is still 81.8MB. Free memory was 60.9MB in the beginning and 39.0MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-12 09:53:49,247 INFO L158 Benchmark]: Witness Printer took 59.37ms. Allocated memory is still 81.8MB. Free memory was 39.0MB in the beginning and 35.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 09:53:49,248 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 40.7MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.14ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 36.9MB in the beginning and 61.5MB in the end (delta: -24.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.77ms. Allocated memory is still 81.8MB. Free memory was 61.5MB in the beginning and 59.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.89ms. Allocated memory is still 81.8MB. Free memory was 59.2MB in the beginning and 57.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2578.03ms. Allocated memory is still 81.8MB. Free memory was 57.3MB in the beginning and 61.2MB in the end (delta: -3.9MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 202382.53ms. Allocated memory is still 81.8MB. Free memory was 60.9MB in the beginning and 39.0MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Witness Printer took 59.37ms. Allocated memory is still 81.8MB. Free memory was 39.0MB in the beginning and 35.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 60]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L402] COND FALSE !(__VERIFIER_nondet_int()) [L405] CALL main2() [L269] unsigned int a ; [L270] unsigned int ma = __VERIFIER_nondet_uint(); [L271] signed char ea = __VERIFIER_nondet_char(); [L272] unsigned int b ; [L273] unsigned int mb = __VERIFIER_nondet_uint(); [L274] signed char eb = __VERIFIER_nondet_char(); [L275] unsigned int r_add ; [L276] unsigned int zero ; [L277] int sa ; [L278] int sb ; [L279] int tmp ; [L280] int tmp___0 ; [L281] int tmp___1 ; [L282] int tmp___2 ; [L283] int tmp___3 ; [L284] int tmp___4 ; [L285] int tmp___5 ; [L286] int tmp___6 ; [L287] int tmp___7 ; [L288] int tmp___8 ; [L289] int tmp___9 ; [L290] int __retres23 ; [L294] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L68] unsigned int res ; [L69] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L72] COND TRUE ! m [L73] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L123] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L294] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0] [L294] zero = base2flt(0, 0) [L295] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L68] unsigned int res ; [L69] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L72] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L78] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L100] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L102] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L119] m = m & ~ (1U << 24U) [L120] res = m | ((unsigned int )(e + 128) << 24U) [L121] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=2147483648, e=0, m=0, res=2147483648] [L123] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-2147483648, __retres4=2147483648, e=0, m=0, res=2147483648] [L295] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=-2147483648, ea=0, ma=16777216, zero=0] [L295] a = base2flt(ma, ea) [L296] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=64, \old(m)=16777216] [L68] unsigned int res ; [L69] unsigned int __retres4 ; VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L72] COND FALSE !(! m) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L78] COND FALSE !(m < 1U << 24U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L100] COND TRUE 1 VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L102] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L119] m = m & ~ (1U << 24U) [L120] res = m | ((unsigned int )(e + 128) << 24U) [L121] __retres4 = res VAL [\old(e)=64, \old(m)=16777216, __retres4=3221225472, e=64, m=0, res=3221225472] [L123] return (__retres4); VAL [\old(e)=64, \old(m)=16777216, \result=-1073741824, __retres4=3221225472, e=64, m=0, res=3221225472] [L296] RET, EXPR base2flt(mb, eb) VAL [a=2147483648, base2flt(mb, eb)=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L296] b = base2flt(mb, eb) [L298] COND FALSE !(a < zero) VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L301] COND TRUE a > zero [L302] tmp = 1 VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, tmp=1, zero=0] [L306] sa = tmp VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp=1, zero=0] [L308] COND FALSE !(b < zero) VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp=1, zero=0] [L311] COND TRUE b > zero [L312] tmp___0 = 1 VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp=1, tmp___0=1, zero=0] [L316] sb = tmp___0 VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L319] CALL addflt(a, b) [L127] unsigned int res ; [L128] unsigned int ma ; [L129] unsigned int mb ; [L130] unsigned int delta ; [L131] int ea ; [L132] int eb ; [L133] unsigned int tmp ; [L134] unsigned int __retres10 ; VAL [\old(a)=2147483648, \old(b)=3221225472, a=2147483648, b=3221225472] [L137] COND TRUE a < b [L138] tmp = a [L139] a = b [L140] b = tmp VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, tmp=2147483648] [L144] COND FALSE !(! b) [L151] ma = a & ((1U << 24U) - 1U) [L152] ea = (int )(a >> 24U) - 128 [L153] ma = ma | (1U << 24U) [L154] mb = b & ((1U << 24U) - 1U) [L155] eb = (int )(b >> 24U) - 128 [L156] mb = mb | (1U << 24U) VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L157] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L59] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L157] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L158] delta = ea - eb VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, delta=64, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L159] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L59] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L60] reach_error() VAL [\old(cond)=0, cond=0] - UnprovableResult [Line: 48]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 202.3s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1237 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1204 mSDsluCounter, 6794 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 237 IncrementalHoareTripleChecker+Unchecked, 5035 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 835 IncrementalHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 1759 mSDtfsCounter, 835 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 775 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 37.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=8, InterpolantAutomatonStates: 98, 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, 16 MinimizatonAttempts, 507 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 104.6s SatisfiabilityAnalysisTime, 78.2s InterpolantComputationTime, 663 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 748 ConstructedInterpolants, 4 QuantifiedInterpolants, 1404 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1194 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 20 InterpolantComputations, 13 PerfectInterpolantSequences, 255/282 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 proved your program to be incorrect! [2022-07-12 09:53:49,465 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-12 09:53:49,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE