./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound10.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/nla-digbench-scaling/freire1_unwindbound10.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 6733f5cb9fc343de68240fd800b3186de8da0c1fcb51c576de9d571eaa34d1a7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 04:48:04,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 04:48:04,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 04:48:04,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 04:48:04,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 04:48:04,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 04:48:04,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 04:48:04,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 04:48:04,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 04:48:04,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 04:48:04,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 04:48:04,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 04:48:04,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 04:48:04,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 04:48:04,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 04:48:04,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 04:48:04,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 04:48:04,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 04:48:04,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 04:48:04,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 04:48:04,788 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 04:48:04,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 04:48:04,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 04:48:04,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 04:48:04,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 04:48:04,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 04:48:04,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 04:48:04,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 04:48:04,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 04:48:04,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 04:48:04,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 04:48:04,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 04:48:04,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 04:48:04,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 04:48:04,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 04:48:04,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 04:48:04,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 04:48:04,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 04:48:04,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 04:48:04,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 04:48:04,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 04:48:04,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 04:48:04,808 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 04:48:04,842 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 04:48:04,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 04:48:04,843 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 04:48:04,843 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 04:48:04,844 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 04:48:04,844 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 04:48:04,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 04:48:04,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 04:48:04,845 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 04:48:04,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 04:48:04,846 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 04:48:04,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 04:48:04,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 04:48:04,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 04:48:04,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 04:48:04,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 04:48:04,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 04:48:04,847 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 04:48:04,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 04:48:04,848 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 04:48:04,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 04:48:04,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 04:48:04,848 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 04:48:04,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 04:48:04,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 04:48:04,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 04:48:04,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 04:48:04,849 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 04:48:04,849 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 04:48:04,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 04:48:04,850 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 04:48:04,850 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 04:48:04,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 04:48:04,851 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 -> 6733f5cb9fc343de68240fd800b3186de8da0c1fcb51c576de9d571eaa34d1a7 [2022-07-12 04:48:05,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 04:48:05,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 04:48:05,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 04:48:05,112 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 04:48:05,113 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 04:48:05,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound10.c [2022-07-12 04:48:05,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf39a1d3b/1580378bba634d8c89ae0ab60fb98d79/FLAG6b86ce8b1 [2022-07-12 04:48:05,557 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 04:48:05,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound10.c [2022-07-12 04:48:05,563 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf39a1d3b/1580378bba634d8c89ae0ab60fb98d79/FLAG6b86ce8b1 [2022-07-12 04:48:05,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf39a1d3b/1580378bba634d8c89ae0ab60fb98d79 [2022-07-12 04:48:05,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 04:48:05,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 04:48:05,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 04:48:05,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 04:48:05,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 04:48:05,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:48:05" (1/1) ... [2022-07-12 04:48:05,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5143f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:05, skipping insertion in model container [2022-07-12 04:48:05,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:48:05" (1/1) ... [2022-07-12 04:48:05,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 04:48:05,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 04:48:05,754 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/nla-digbench-scaling/freire1_unwindbound10.c[712,725] [2022-07-12 04:48:05,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 04:48:05,778 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 04:48:05,792 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/nla-digbench-scaling/freire1_unwindbound10.c[712,725] [2022-07-12 04:48:05,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 04:48:05,812 INFO L208 MainTranslator]: Completed translation [2022-07-12 04:48:05,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:05 WrapperNode [2022-07-12 04:48:05,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 04:48:05,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 04:48:05,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 04:48:05,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 04:48:05,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:05" (1/1) ... [2022-07-12 04:48:05,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:05" (1/1) ... [2022-07-12 04:48:05,841 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2022-07-12 04:48:05,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 04:48:05,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 04:48:05,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 04:48:05,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 04:48:05,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:05" (1/1) ... [2022-07-12 04:48:05,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:05" (1/1) ... [2022-07-12 04:48:05,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:05" (1/1) ... [2022-07-12 04:48:05,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:05" (1/1) ... [2022-07-12 04:48:05,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:05" (1/1) ... [2022-07-12 04:48:05,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:05" (1/1) ... [2022-07-12 04:48:05,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:05" (1/1) ... [2022-07-12 04:48:05,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 04:48:05,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 04:48:05,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 04:48:05,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 04:48:05,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:05" (1/1) ... [2022-07-12 04:48:05,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 04:48:05,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:48:05,913 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 04:48:05,925 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 04:48:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 04:48:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 04:48:05,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 04:48:05,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 04:48:05,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 04:48:05,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 04:48:06,009 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 04:48:06,011 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 04:48:06,141 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 04:48:06,146 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 04:48:06,151 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 04:48:06,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:48:06 BoogieIcfgContainer [2022-07-12 04:48:06,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 04:48:06,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 04:48:06,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 04:48:06,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 04:48:06,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 04:48:05" (1/3) ... [2022-07-12 04:48:06,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f69cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:48:06, skipping insertion in model container [2022-07-12 04:48:06,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:05" (2/3) ... [2022-07-12 04:48:06,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f69cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:48:06, skipping insertion in model container [2022-07-12 04:48:06,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:48:06" (3/3) ... [2022-07-12 04:48:06,162 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound10.c [2022-07-12 04:48:06,177 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 04:48:06,177 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 04:48:06,232 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 04:48:06,239 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@62b3765a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@472b7e18 [2022-07-12 04:48:06,240 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 04:48:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 04:48:06,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 04:48:06,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:48:06,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:48:06,260 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:48:06,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:48:06,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2022-07-12 04:48:06,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:48:06,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178399075] [2022-07-12 04:48:06,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:48:06,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:48:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:48:06,387 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 04:48:06,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:48:06,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178399075] [2022-07-12 04:48:06,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178399075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:48:06,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:48:06,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 04:48:06,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922883783] [2022-07-12 04:48:06,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:48:06,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 04:48:06,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:48:06,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 04:48:06,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 04:48:06,425 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:48:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:48:06,440 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-07-12 04:48:06,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 04:48:06,442 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 04:48:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:48:06,448 INFO L225 Difference]: With dead ends: 32 [2022-07-12 04:48:06,449 INFO L226 Difference]: Without dead ends: 13 [2022-07-12 04:48:06,455 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 04:48:06,458 INFO L413 NwaCegarLoop]: 19 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, 19 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 04:48:06,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:48:06,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-12 04:48:06,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-12 04:48:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 04:48:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-12 04:48:06,491 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-07-12 04:48:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:48:06,491 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-12 04:48:06,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:48:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-07-12 04:48:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 04:48:06,492 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:48:06,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:48:06,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 04:48:06,494 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:48:06,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:48:06,495 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2022-07-12 04:48:06,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:48:06,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220029034] [2022-07-12 04:48:06,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:48:06,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:48:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:48:06,591 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 04:48:06,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 04:48:06,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220029034] [2022-07-12 04:48:06,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220029034] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:48:06,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:48:06,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 04:48:06,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105154181] [2022-07-12 04:48:06,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:48:06,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 04:48:06,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 04:48:06,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 04:48:06,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 04:48:06,602 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:48:06,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:48:06,628 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-07-12 04:48:06,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 04:48:06,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 04:48:06,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:48:06,629 INFO L225 Difference]: With dead ends: 22 [2022-07-12 04:48:06,629 INFO L226 Difference]: Without dead ends: 15 [2022-07-12 04:48:06,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 04:48:06,631 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 04:48:06,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:48:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-12 04:48:06,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-12 04:48:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 04:48:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-12 04:48:06,643 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2022-07-12 04:48:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:48:06,643 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-12 04:48:06,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:48:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-07-12 04:48:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 04:48:06,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:48:06,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:48:06,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 04:48:06,645 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:48:06,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:48:06,655 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2022-07-12 04:48:06,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 04:48:06,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780345864] [2022-07-12 04:48:06,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:48:06,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 04:48:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 04:48:06,677 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 04:48:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 04:48:06,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 04:48:06,711 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 04:48:06,712 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 04:48:06,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 04:48:06,718 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-12 04:48:06,721 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 04:48:06,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 04:48:06 BoogieIcfgContainer [2022-07-12 04:48:06,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 04:48:06,739 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 04:48:06,740 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 04:48:06,740 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 04:48:06,740 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:48:06" (3/4) ... [2022-07-12 04:48:06,743 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 04:48:06,743 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 04:48:06,744 INFO L158 Benchmark]: Toolchain (without parser) took 1161.80ms. Allocated memory was 88.1MB in the beginning and 109.1MB in the end (delta: 21.0MB). Free memory was 52.9MB in the beginning and 44.4MB in the end (delta: 8.5MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2022-07-12 04:48:06,745 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 88.1MB. Free memory was 57.3MB in the beginning and 57.3MB in the end (delta: 18.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 04:48:06,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.57ms. Allocated memory was 88.1MB in the beginning and 109.1MB in the end (delta: 21.0MB). Free memory was 52.9MB in the beginning and 84.3MB in the end (delta: -31.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 04:48:06,754 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.85ms. Allocated memory is still 109.1MB. Free memory was 84.3MB in the beginning and 83.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 04:48:06,754 INFO L158 Benchmark]: Boogie Preprocessor took 37.56ms. Allocated memory is still 109.1MB. Free memory was 82.5MB in the beginning and 81.6MB in the end (delta: 913.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 04:48:06,755 INFO L158 Benchmark]: RCFGBuilder took 273.30ms. Allocated memory is still 109.1MB. Free memory was 81.6MB in the beginning and 73.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 04:48:06,756 INFO L158 Benchmark]: TraceAbstraction took 582.53ms. Allocated memory is still 109.1MB. Free memory was 72.6MB in the beginning and 44.8MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-12 04:48:06,756 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 109.1MB. Free memory was 44.8MB in the beginning and 44.4MB in the end (delta: 322.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 04:48:06,760 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.19ms. Allocated memory is still 88.1MB. Free memory was 57.3MB in the beginning and 57.3MB in the end (delta: 18.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.57ms. Allocated memory was 88.1MB in the beginning and 109.1MB in the end (delta: 21.0MB). Free memory was 52.9MB in the beginning and 84.3MB in the end (delta: -31.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.85ms. Allocated memory is still 109.1MB. Free memory was 84.3MB in the beginning and 83.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.56ms. Allocated memory is still 109.1MB. Free memory was 82.5MB in the beginning and 81.6MB in the end (delta: 913.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 273.30ms. Allocated memory is still 109.1MB. Free memory was 81.6MB in the beginning and 73.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 582.53ms. Allocated memory is still 109.1MB. Free memory was 72.6MB in the beginning and 44.8MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 109.1MB. Free memory was 44.8MB in the beginning and 44.4MB in the end (delta: 322.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L24] int counter = 0; VAL [counter=0] [L26] int r; [L27] double a, x; [L28] a = __VERIFIER_nondet_double() [L29] x = a / 2.0 [L30] r = 0 VAL [counter=0, r=0] [L32] EXPR counter++ VAL [counter=1, counter++=0, r=0] [L32] COND TRUE counter++<10 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0, counter=1] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, counter=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, 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, 54 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 32 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 04:48:06,798 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 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/nla-digbench-scaling/freire1_unwindbound10.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 6733f5cb9fc343de68240fd800b3186de8da0c1fcb51c576de9d571eaa34d1a7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 04:48:08,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 04:48:08,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 04:48:08,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 04:48:08,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 04:48:08,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 04:48:08,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 04:48:08,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 04:48:08,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 04:48:08,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 04:48:08,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 04:48:08,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 04:48:08,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 04:48:08,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 04:48:08,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 04:48:08,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 04:48:08,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 04:48:08,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 04:48:08,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 04:48:08,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 04:48:08,757 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 04:48:08,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 04:48:08,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 04:48:08,761 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 04:48:08,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 04:48:08,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 04:48:08,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 04:48:08,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 04:48:08,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 04:48:08,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 04:48:08,768 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 04:48:08,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 04:48:08,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 04:48:08,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 04:48:08,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 04:48:08,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 04:48:08,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 04:48:08,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 04:48:08,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 04:48:08,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 04:48:08,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 04:48:08,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 04:48:08,787 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 04:48:08,819 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 04:48:08,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 04:48:08,820 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 04:48:08,820 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 04:48:08,821 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 04:48:08,821 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 04:48:08,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 04:48:08,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 04:48:08,822 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 04:48:08,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 04:48:08,823 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 04:48:08,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 04:48:08,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 04:48:08,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 04:48:08,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 04:48:08,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 04:48:08,829 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 04:48:08,829 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 04:48:08,830 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 04:48:08,830 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 04:48:08,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 04:48:08,830 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 04:48:08,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 04:48:08,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 04:48:08,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 04:48:08,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 04:48:08,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 04:48:08,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 04:48:08,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 04:48:08,832 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 04:48:08,832 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 04:48:08,832 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 04:48:08,832 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 04:48:08,833 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 04:48:08,833 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 04:48:08,833 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 04:48:08,833 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 -> 6733f5cb9fc343de68240fd800b3186de8da0c1fcb51c576de9d571eaa34d1a7 [2022-07-12 04:48:09,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 04:48:09,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 04:48:09,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 04:48:09,125 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 04:48:09,125 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 04:48:09,126 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound10.c [2022-07-12 04:48:09,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d460beebb/c1d41f1b8e3e4e8b9156827b3a3cdf54/FLAG322d06fce [2022-07-12 04:48:09,578 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 04:48:09,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound10.c [2022-07-12 04:48:09,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d460beebb/c1d41f1b8e3e4e8b9156827b3a3cdf54/FLAG322d06fce [2022-07-12 04:48:09,991 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d460beebb/c1d41f1b8e3e4e8b9156827b3a3cdf54 [2022-07-12 04:48:09,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 04:48:09,994 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 04:48:09,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 04:48:09,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 04:48:09,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 04:48:10,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:48:09" (1/1) ... [2022-07-12 04:48:10,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aede230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:10, skipping insertion in model container [2022-07-12 04:48:10,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:48:09" (1/1) ... [2022-07-12 04:48:10,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 04:48:10,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 04:48:10,124 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/nla-digbench-scaling/freire1_unwindbound10.c[712,725] [2022-07-12 04:48:10,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 04:48:10,153 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 04:48:10,163 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/nla-digbench-scaling/freire1_unwindbound10.c[712,725] [2022-07-12 04:48:10,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 04:48:10,225 INFO L208 MainTranslator]: Completed translation [2022-07-12 04:48:10,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:10 WrapperNode [2022-07-12 04:48:10,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 04:48:10,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 04:48:10,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 04:48:10,236 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 04:48:10,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:10" (1/1) ... [2022-07-12 04:48:10,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:10" (1/1) ... [2022-07-12 04:48:10,270 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2022-07-12 04:48:10,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 04:48:10,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 04:48:10,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 04:48:10,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 04:48:10,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:10" (1/1) ... [2022-07-12 04:48:10,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:10" (1/1) ... [2022-07-12 04:48:10,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:10" (1/1) ... [2022-07-12 04:48:10,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:10" (1/1) ... [2022-07-12 04:48:10,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:10" (1/1) ... [2022-07-12 04:48:10,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:10" (1/1) ... [2022-07-12 04:48:10,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:10" (1/1) ... [2022-07-12 04:48:10,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 04:48:10,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 04:48:10,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 04:48:10,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 04:48:10,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:10" (1/1) ... [2022-07-12 04:48:10,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 04:48:10,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 04:48:10,344 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 04:48:10,368 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 04:48:10,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 04:48:10,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 04:48:10,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 04:48:10,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 04:48:10,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 04:48:10,383 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 04:48:10,444 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 04:48:10,446 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 04:48:11,206 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 04:48:11,211 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 04:48:11,211 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 04:48:11,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:48:11 BoogieIcfgContainer [2022-07-12 04:48:11,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 04:48:11,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 04:48:11,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 04:48:11,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 04:48:11,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 04:48:09" (1/3) ... [2022-07-12 04:48:11,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cd0fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:48:11, skipping insertion in model container [2022-07-12 04:48:11,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:48:10" (2/3) ... [2022-07-12 04:48:11,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cd0fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:48:11, skipping insertion in model container [2022-07-12 04:48:11,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:48:11" (3/3) ... [2022-07-12 04:48:11,224 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound10.c [2022-07-12 04:48:11,235 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 04:48:11,235 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 04:48:11,267 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 04:48:11,273 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@697d56c3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3a813c07 [2022-07-12 04:48:11,273 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 04:48:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 04:48:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 04:48:11,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:48:11,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:48:11,294 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:48:11,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:48:11,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2022-07-12 04:48:11,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 04:48:11,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644068998] [2022-07-12 04:48:11,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:48:11,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 04:48:11,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 04:48:11,312 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 04:48:11,359 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 04:48:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:48:11,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 04:48:11,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:48:11,772 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 04:48:11,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 04:48:11,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 04:48:11,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644068998] [2022-07-12 04:48:11,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644068998] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:48:11,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:48:11,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 04:48:11,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689399901] [2022-07-12 04:48:11,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:48:11,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 04:48:11,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 04:48:11,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 04:48:11,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 04:48:11,809 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:48:11,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:48:11,833 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-07-12 04:48:11,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 04:48:11,835 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 04:48:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:48:11,842 INFO L225 Difference]: With dead ends: 32 [2022-07-12 04:48:11,842 INFO L226 Difference]: Without dead ends: 13 [2022-07-12 04:48:11,845 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 04:48:11,849 INFO L413 NwaCegarLoop]: 19 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, 19 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 04:48:11,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 04:48:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-12 04:48:11,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-12 04:48:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 04:48:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-12 04:48:11,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-07-12 04:48:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:48:11,884 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-12 04:48:11,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:48:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-07-12 04:48:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 04:48:11,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:48:11,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:48:11,909 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 04:48:12,101 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 04:48:12,102 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:48:12,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:48:12,103 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2022-07-12 04:48:12,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 04:48:12,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384074522] [2022-07-12 04:48:12,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:48:12,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 04:48:12,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 04:48:12,106 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 04:48:12,109 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 04:48:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:48:12,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 04:48:12,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:48:12,427 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 04:48:12,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 04:48:12,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 04:48:12,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384074522] [2022-07-12 04:48:12,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384074522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:48:12,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:48:12,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 04:48:12,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762942399] [2022-07-12 04:48:12,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:48:12,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 04:48:12,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 04:48:12,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 04:48:12,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 04:48:12,431 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:48:13,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:48:13,258 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-07-12 04:48:13,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 04:48:13,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 04:48:13,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:48:13,260 INFO L225 Difference]: With dead ends: 22 [2022-07-12 04:48:13,260 INFO L226 Difference]: Without dead ends: 15 [2022-07-12 04:48:13,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 04:48:13,262 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 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.8s IncrementalHoareTripleChecker+Time [2022-07-12 04:48:13,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 04:48:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-12 04:48:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-12 04:48:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 04:48:13,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-12 04:48:13,267 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2022-07-12 04:48:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:48:13,267 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-12 04:48:13,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:48:13,268 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-07-12 04:48:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 04:48:13,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:48:13,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:48:13,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-12 04:48:13,475 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 04:48:13,476 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:48:13,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:48:13,476 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2022-07-12 04:48:13,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 04:48:13,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260316562] [2022-07-12 04:48:13,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:48:13,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 04:48:13,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 04:48:13,479 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 04:48:13,480 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 04:48:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:48:15,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 04:48:15,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:48:36,563 WARN L833 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from false [2022-07-12 04:48:43,424 WARN L833 $PredicateComparison]: unable to prove that (or (= (_ bv1 32) c___VERIFIER_assert_~cond) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (= (_ bv0 32) c___VERIFIER_assert_~cond))) is different from false [2022-07-12 04:48:49,859 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) is different from false [2022-07-12 04:48:51,899 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) is different from true [2022-07-12 04:48:51,900 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 04:48:51,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 04:48:51,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 04:48:51,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260316562] [2022-07-12 04:48:51,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260316562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 04:48:51,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 04:48:51,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 04:48:51,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316536126] [2022-07-12 04:48:51,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 04:48:51,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 04:48:51,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 04:48:51,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 04:48:51,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=8, Unknown=4, NotChecked=18, Total=42 [2022-07-12 04:48:51,903 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:48:54,874 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:48:57,050 WARN L833 $PredicateComparison]: unable to prove that (and (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-12 04:48:59,662 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:49:01,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:49:03,960 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:49:06,150 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 04:49:08,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:49:10,457 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:49:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:49:10,458 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-07-12 04:49:10,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 04:49:10,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 04:49:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:49:10,552 INFO L225 Difference]: With dead ends: 24 [2022-07-12 04:49:10,552 INFO L226 Difference]: Without dead ends: 22 [2022-07-12 04:49:10,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14, Invalid=9, Unknown=5, NotChecked=28, Total=56 [2022-07-12 04:49:10,554 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2022-07-12 04:49:10,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 34 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 6 Unknown, 61 Unchecked, 16.4s Time] [2022-07-12 04:49:10,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-12 04:49:10,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-07-12 04:49:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 04:49:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-07-12 04:49:10,560 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 8 [2022-07-12 04:49:10,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:49:10,560 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-07-12 04:49:10,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 04:49:10,560 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-07-12 04:49:10,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 04:49:10,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:49:10,561 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:49:10,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 04:49:10,767 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 04:49:10,767 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:49:10,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:49:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1780785341, now seen corresponding path program 1 times [2022-07-12 04:49:10,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 04:49:10,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481056593] [2022-07-12 04:49:10,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:49:10,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 04:49:10,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 04:49:10,770 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 04:49:10,772 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 04:49:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:49:11,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 04:49:11,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:49:17,331 WARN L833 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2022-07-12 04:49:19,397 WARN L855 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2022-07-12 04:49:31,847 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2022-07-12 04:49:40,192 WARN L833 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32)))) is different from false [2022-07-12 04:49:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 04:49:40,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:50:05,154 WARN L233 SmtUtils]: Spent 16.52s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-12 04:50:21,678 WARN L233 SmtUtils]: Spent 16.52s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-12 04:50:27,934 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-07-12 04:50:38,368 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-07-12 04:50:38,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 04:50:38,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 04:50:38,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481056593] [2022-07-12 04:50:38,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481056593] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:50:38,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:50:38,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-07-12 04:50:38,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623818480] [2022-07-12 04:50:38,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:50:38,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 04:50:38,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 04:50:38,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 04:50:38,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=17, Unknown=6, NotChecked=50, Total=90 [2022-07-12 04:50:38,375 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 04:50:40,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:50:42,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:50:44,677 WARN L855 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) is different from true [2022-07-12 04:50:46,766 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0) .cse0)) is different from true [2022-07-12 04:50:48,837 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from false [2022-07-12 04:50:50,923 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (= (_ bv1 32) c___VERIFIER_assert_~cond) (not .cse0) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))) is different from false [2022-07-12 04:50:52,994 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (= (_ bv1 32) c___VERIFIER_assert_~cond) (not .cse0) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))) is different from true [2022-07-12 04:50:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:50:52,996 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-07-12 04:50:52,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 04:50:52,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-07-12 04:50:52,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:50:52,998 INFO L225 Difference]: With dead ends: 25 [2022-07-12 04:50:52,998 INFO L226 Difference]: Without dead ends: 20 [2022-07-12 04:50:52,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=25, Invalid=20, Unknown=11, NotChecked=126, Total=182 [2022-07-12 04:50:52,999 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-12 04:50:53,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 40 Unchecked, 4.2s Time] [2022-07-12 04:50:53,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-12 04:50:53,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-12 04:50:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 04:50:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-07-12 04:50:53,004 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2022-07-12 04:50:53,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:50:53,004 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-07-12 04:50:53,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 04:50:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-07-12 04:50:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 04:50:53,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:50:53,005 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:50:53,021 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 04:50:53,207 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 04:50:53,208 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:50:53,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:50:53,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1542398814, now seen corresponding path program 1 times [2022-07-12 04:50:53,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 04:50:53,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599546852] [2022-07-12 04:50:53,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:50:53,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 04:50:53,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 04:50:53,210 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 04:50:53,211 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 04:50:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 04:50:53,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 04:50:53,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 04:50:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:50:54,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 04:50:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 04:50:54,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 04:50:54,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599546852] [2022-07-12 04:50:54,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599546852] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 04:50:54,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 04:50:54,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-12 04:50:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581100755] [2022-07-12 04:50:54,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 04:50:54,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 04:50:54,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 04:50:54,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 04:50:54,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 04:50:54,268 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 04:50:55,836 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:50:58,703 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:51:00,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:51:03,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:51:05,347 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:51:07,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:51:09,573 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:51:11,870 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:51:13,878 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:51:15,880 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:51:18,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:51:20,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 04:51:20,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 04:51:20,231 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-07-12 04:51:20,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 04:51:20,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-07-12 04:51:20,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 04:51:20,233 INFO L225 Difference]: With dead ends: 50 [2022-07-12 04:51:20,233 INFO L226 Difference]: Without dead ends: 43 [2022-07-12 04:51:20,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-12 04:51:20,234 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2022-07-12 04:51:20,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 78 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 11 Unknown, 0 Unchecked, 25.6s Time] [2022-07-12 04:51:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-12 04:51:20,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-12 04:51:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 04:51:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-07-12 04:51:20,249 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 16 [2022-07-12 04:51:20,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 04:51:20,250 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-07-12 04:51:20,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 04:51:20,250 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-07-12 04:51:20,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 04:51:20,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 04:51:20,251 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 04:51:20,284 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 04:51:20,451 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 04:51:20,452 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 04:51:20,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 04:51:20,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1540611354, now seen corresponding path program 1 times [2022-07-12 04:51:20,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 04:51:20,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728333524] [2022-07-12 04:51:20,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 04:51:20,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 04:51:20,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 04:51:20,454 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 04:51:20,454 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 04:51:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 04:51:26,424 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 04:51:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 04:51:35,862 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-12 04:51:35,862 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 04:51:35,863 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 04:51:35,921 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 04:51:36,065 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 04:51:36,068 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-12 04:51:36,071 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 04:51:36,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 04:51:36 BoogieIcfgContainer [2022-07-12 04:51:36,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 04:51:36,097 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 04:51:36,097 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 04:51:36,097 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 04:51:36,097 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:48:11" (3/4) ... [2022-07-12 04:51:36,098 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 04:51:36,140 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 04:51:36,141 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 04:51:36,141 INFO L158 Benchmark]: Toolchain (without parser) took 206147.52ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 35.0MB in the beginning and 47.0MB in the end (delta: -12.0MB). Peak memory consumption was 999.5kB. Max. memory is 16.1GB. [2022-07-12 04:51:36,141 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 44.0MB. Free memory was 25.8MB in the beginning and 25.8MB in the end (delta: 34.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 04:51:36,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.11ms. Allocated memory is still 54.5MB. Free memory was 34.7MB in the beginning and 38.3MB in the end (delta: -3.5MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2022-07-12 04:51:36,142 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.74ms. Allocated memory is still 54.5MB. Free memory was 38.3MB in the beginning and 36.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 04:51:36,142 INFO L158 Benchmark]: Boogie Preprocessor took 44.09ms. Allocated memory is still 54.5MB. Free memory was 36.8MB in the beginning and 35.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 04:51:36,143 INFO L158 Benchmark]: RCFGBuilder took 894.63ms. Allocated memory is still 54.5MB. Free memory was 35.5MB in the beginning and 26.9MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 04:51:36,143 INFO L158 Benchmark]: TraceAbstraction took 204883.00ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 26.3MB in the beginning and 49.1MB in the end (delta: -22.8MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-07-12 04:51:36,144 INFO L158 Benchmark]: Witness Printer took 43.84ms. Allocated memory is still 67.1MB. Free memory was 49.1MB in the beginning and 47.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 04:51:36,145 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.45ms. Allocated memory is still 44.0MB. Free memory was 25.8MB in the beginning and 25.8MB in the end (delta: 34.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.11ms. Allocated memory is still 54.5MB. Free memory was 34.7MB in the beginning and 38.3MB in the end (delta: -3.5MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.74ms. Allocated memory is still 54.5MB. Free memory was 38.3MB in the beginning and 36.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.09ms. Allocated memory is still 54.5MB. Free memory was 36.8MB in the beginning and 35.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 894.63ms. Allocated memory is still 54.5MB. Free memory was 35.5MB in the beginning and 26.9MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 204883.00ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 26.3MB in the beginning and 49.1MB in the end (delta: -22.8MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Witness Printer took 43.84ms. Allocated memory is still 67.1MB. Free memory was 49.1MB in the beginning and 47.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int counter = 0; VAL [counter=0] [L26] int r; [L27] double a, x; [L28] a = __VERIFIER_nondet_double() [L29] x = a / 2.0 [L30] r = 0 VAL [a=16039263319621250, counter=0, r=0, x=8019631659810625] [L32] EXPR counter++ VAL [a=16039263319621250, counter=1, counter++=0, r=0, x=8019631659810625] [L32] COND TRUE counter++<10 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=1, counter=1] [L17] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L33] RET __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [a=16039263319621250, counter=1, r=0, x=8019631659810625] [L35] COND FALSE !(!(x > r)) [L37] x = x - r [L38] r = r + 1 VAL [a=16039263319621250, counter=1, r=1, x=8019631659810625] [L32] EXPR counter++ VAL [a=16039263319621250, counter=2, counter++=1, r=1, x=8019631659810625] [L32] COND TRUE counter++<10 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0, counter=2] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=2] [L19] reach_error() VAL [\old(cond)=0, cond=0, counter=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 204.8s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 60.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 47.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 46.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 101 IncrementalHoareTripleChecker+Unchecked, 137 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 70 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 35.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=5, InterpolantAutomatonStates: 30, 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, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 9.4s SatisfiabilityAnalysisTime, 124.3s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 76 ConstructedInterpolants, 8 QuantifiedInterpolants, 576 SizeOfPredicates, 7 NumberOfNonLiveVariables, 154 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 6/12 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 04:51:36,336 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 0 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