./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d 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.3.100.v20150511-1540.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/float-newlib/float_req_bl_1251.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 32adbfac5f3e3ea232180afd045da0027ca6d993 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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.3.100.v20150511-1540.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/float-newlib/float_req_bl_1251.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 32adbfac5f3e3ea232180afd045da0027ca6d993 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 00:40:23,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 00:40:23,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 00:40:23,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 00:40:23,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 00:40:23,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 00:40:23,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 00:40:23,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 00:40:23,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 00:40:23,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 00:40:23,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 00:40:23,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 00:40:23,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 00:40:23,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 00:40:23,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 00:40:23,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 00:40:23,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 00:40:23,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 00:40:23,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 00:40:23,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 00:40:23,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 00:40:23,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 00:40:23,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 00:40:23,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 00:40:23,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 00:40:23,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 00:40:23,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 00:40:23,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 00:40:23,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 00:40:23,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 00:40:23,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 00:40:23,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 00:40:23,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 00:40:23,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 00:40:23,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 00:40:23,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 00:40:23,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 00:40:23,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 00:40:23,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 00:40:23,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 00:40:23,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 00:40:23,812 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 00:40:23,833 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 00:40:23,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 00:40:23,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 00:40:23,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 00:40:23,835 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 00:40:23,835 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 00:40:23,836 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 00:40:23,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 00:40:23,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 00:40:23,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 00:40:23,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 00:40:23,836 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 00:40:23,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 00:40:23,837 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 00:40:23,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 00:40:23,837 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 00:40:23,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 00:40:23,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 00:40:23,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 00:40:23,838 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 00:40:23,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 00:40:23,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:40:23,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 00:40:23,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 00:40:23,839 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 00:40:23,839 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 00:40:23,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 00:40:23,839 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 00:40:23,840 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 00:40:23,840 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 32adbfac5f3e3ea232180afd045da0027ca6d993 [2020-10-20 00:40:24,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 00:40:24,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 00:40:24,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 00:40:24,061 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 00:40:24,061 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 00:40:24,062 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2020-10-20 00:40:24,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bdd1e07f/87bd61589a8c4229aa9890a82668222d/FLAG8088b2e1e [2020-10-20 00:40:24,685 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 00:40:24,685 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2020-10-20 00:40:24,693 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bdd1e07f/87bd61589a8c4229aa9890a82668222d/FLAG8088b2e1e [2020-10-20 00:40:25,107 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bdd1e07f/87bd61589a8c4229aa9890a82668222d [2020-10-20 00:40:25,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 00:40:25,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 00:40:25,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 00:40:25,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 00:40:25,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 00:40:25,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:40:25" (1/1) ... [2020-10-20 00:40:25,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cc5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:25, skipping insertion in model container [2020-10-20 00:40:25,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:40:25" (1/1) ... [2020-10-20 00:40:25,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 00:40:25,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 00:40:25,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:40:25,379 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 00:40:25,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:40:25,425 INFO L208 MainTranslator]: Completed translation [2020-10-20 00:40:25,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:25 WrapperNode [2020-10-20 00:40:25,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 00:40:25,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 00:40:25,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 00:40:25,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 00:40:25,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:25" (1/1) ... [2020-10-20 00:40:25,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:25" (1/1) ... [2020-10-20 00:40:25,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 00:40:25,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 00:40:25,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 00:40:25,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 00:40:25,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:25" (1/1) ... [2020-10-20 00:40:25,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:25" (1/1) ... [2020-10-20 00:40:25,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:25" (1/1) ... [2020-10-20 00:40:25,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:25" (1/1) ... [2020-10-20 00:40:25,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:25" (1/1) ... [2020-10-20 00:40:25,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:25" (1/1) ... [2020-10-20 00:40:25,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:25" (1/1) ... [2020-10-20 00:40:25,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 00:40:25,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 00:40:25,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 00:40:25,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 00:40:25,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:40:25,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 00:40:25,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 00:40:25,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-10-20 00:40:25,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 00:40:25,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 00:40:25,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 00:40:25,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 00:40:26,060 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 00:40:26,061 INFO L298 CfgBuilder]: Removed 34 assume(true) statements. [2020-10-20 00:40:26,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:40:26 BoogieIcfgContainer [2020-10-20 00:40:26,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 00:40:26,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 00:40:26,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 00:40:26,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 00:40:26,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 12:40:25" (1/3) ... [2020-10-20 00:40:26,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51dabcf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:40:26, skipping insertion in model container [2020-10-20 00:40:26,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:25" (2/3) ... [2020-10-20 00:40:26,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51dabcf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:40:26, skipping insertion in model container [2020-10-20 00:40:26,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:40:26" (3/3) ... [2020-10-20 00:40:26,071 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2020-10-20 00:40:26,082 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 00:40:26,090 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 00:40:26,104 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-20 00:40:26,129 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 00:40:26,129 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 00:40:26,129 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 00:40:26,129 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 00:40:26,130 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 00:40:26,130 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 00:40:26,130 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 00:40:26,130 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 00:40:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-10-20 00:40:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 00:40:26,152 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:26,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:26,153 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:26,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:26,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2020-10-20 00:40:26,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:40:26,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288860692] [2020-10-20 00:40:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:40:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:26,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288860692] [2020-10-20 00:40:26,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:26,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:40:26,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975724730] [2020-10-20 00:40:26,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:40:26,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:40:26,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:40:26,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:40:26,393 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 4 states. [2020-10-20 00:40:26,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:26,471 INFO L93 Difference]: Finished difference Result 92 states and 136 transitions. [2020-10-20 00:40:26,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:40:26,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-20 00:40:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:26,486 INFO L225 Difference]: With dead ends: 92 [2020-10-20 00:40:26,486 INFO L226 Difference]: Without dead ends: 50 [2020-10-20 00:40:26,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:40:26,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-20 00:40:26,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-10-20 00:40:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-20 00:40:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2020-10-20 00:40:26,531 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2020-10-20 00:40:26,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:26,532 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2020-10-20 00:40:26,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:40:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2020-10-20 00:40:26,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 00:40:26,533 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:26,533 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:26,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 00:40:26,534 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:26,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:26,535 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2020-10-20 00:40:26,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:40:26,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233516064] [2020-10-20 00:40:26,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:40:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:26,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233516064] [2020-10-20 00:40:26,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:26,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:40:26,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434906214] [2020-10-20 00:40:26,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:40:26,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:40:26,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:40:26,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:40:26,631 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2020-10-20 00:40:26,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:26,719 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2020-10-20 00:40:26,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:40:26,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-20 00:40:26,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:26,721 INFO L225 Difference]: With dead ends: 77 [2020-10-20 00:40:26,721 INFO L226 Difference]: Without dead ends: 64 [2020-10-20 00:40:26,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:40:26,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-20 00:40:26,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2020-10-20 00:40:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-20 00:40:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-20 00:40:26,731 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2020-10-20 00:40:26,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:26,732 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-20 00:40:26,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:40:26,732 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-20 00:40:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 00:40:26,733 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:26,733 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:26,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 00:40:26,734 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:26,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:26,734 INFO L82 PathProgramCache]: Analyzing trace with hash -674173253, now seen corresponding path program 1 times [2020-10-20 00:40:26,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:40:26,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219360] [2020-10-20 00:40:26,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:40:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:26,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219360] [2020-10-20 00:40:26,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:26,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:40:26,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502715578] [2020-10-20 00:40:26,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:40:26,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:40:26,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:40:26,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:40:26,797 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2020-10-20 00:40:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:26,859 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2020-10-20 00:40:26,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:40:26,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-20 00:40:26,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:26,861 INFO L225 Difference]: With dead ends: 79 [2020-10-20 00:40:26,862 INFO L226 Difference]: Without dead ends: 66 [2020-10-20 00:40:26,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:40:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-20 00:40:26,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2020-10-20 00:40:26,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-20 00:40:26,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-20 00:40:26,871 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 19 [2020-10-20 00:40:26,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:26,871 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-20 00:40:26,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:40:26,872 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-20 00:40:26,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 00:40:26,873 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:26,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:26,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 00:40:26,873 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:26,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:26,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1345927737, now seen corresponding path program 1 times [2020-10-20 00:40:26,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:40:26,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658472848] [2020-10-20 00:40:26,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:40:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:26,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658472848] [2020-10-20 00:40:26,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:26,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:40:26,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65159913] [2020-10-20 00:40:26,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:40:26,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:40:26,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:40:26,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:40:26,987 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2020-10-20 00:40:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:27,054 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2020-10-20 00:40:27,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:40:27,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-20 00:40:27,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:27,056 INFO L225 Difference]: With dead ends: 81 [2020-10-20 00:40:27,057 INFO L226 Difference]: Without dead ends: 68 [2020-10-20 00:40:27,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:40:27,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-20 00:40:27,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2020-10-20 00:40:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-20 00:40:27,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-20 00:40:27,066 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 20 [2020-10-20 00:40:27,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:27,066 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-20 00:40:27,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:40:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-20 00:40:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 00:40:27,068 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:27,071 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:27,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 00:40:27,072 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:27,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2020-10-20 00:40:27,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:40:27,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398307132] [2020-10-20 00:40:27,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:40:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:27,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398307132] [2020-10-20 00:40:27,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:27,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:40:27,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408584964] [2020-10-20 00:40:27,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:40:27,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:40:27,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:40:27,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:40:27,173 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2020-10-20 00:40:27,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:27,189 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-10-20 00:40:27,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:40:27,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-20 00:40:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:27,191 INFO L225 Difference]: With dead ends: 50 [2020-10-20 00:40:27,191 INFO L226 Difference]: Without dead ends: 48 [2020-10-20 00:40:27,192 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:40:27,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-20 00:40:27,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-10-20 00:40:27,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-20 00:40:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2020-10-20 00:40:27,199 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2020-10-20 00:40:27,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:27,200 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2020-10-20 00:40:27,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:40:27,200 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2020-10-20 00:40:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 00:40:27,201 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:27,201 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:27,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 00:40:27,202 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:27,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:27,203 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2020-10-20 00:40:27,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:40:27,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415779423] [2020-10-20 00:40:27,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:40:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 00:40:27,247 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 00:40:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 00:40:27,272 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 00:40:27,301 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 00:40:27,302 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 00:40:27,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 00:40:27,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 12:40:27 BoogieIcfgContainer [2020-10-20 00:40:27,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 00:40:27,347 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 00:40:27,347 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 00:40:27,348 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 00:40:27,348 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:40:26" (3/4) ... [2020-10-20 00:40:27,352 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 00:40:27,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 00:40:27,356 INFO L168 Benchmark]: Toolchain (without parser) took 2242.26 ms. Allocated memory was 41.4 MB in the beginning and 48.8 MB in the end (delta: 7.3 MB). Free memory was 19.4 MB in the beginning and 24.6 MB in the end (delta: -5.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 14.3 GB. [2020-10-20 00:40:27,357 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 31.5 MB. Free memory was 7.7 MB in the beginning and 7.7 MB in the end (delta: 45.7 kB). Peak memory consumption was 45.7 kB. Max. memory is 14.3 GB. [2020-10-20 00:40:27,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.80 ms. Allocated memory was 41.4 MB in the beginning and 41.9 MB in the end (delta: 524.3 kB). Free memory was 18.4 MB in the beginning and 19.1 MB in the end (delta: -684.1 kB). Peak memory consumption was 9.8 MB. Max. memory is 14.3 GB. [2020-10-20 00:40:27,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.75 ms. Allocated memory is still 41.9 MB. Free memory was 19.1 MB in the beginning and 16.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. [2020-10-20 00:40:27,360 INFO L168 Benchmark]: Boogie Preprocessor took 42.00 ms. Allocated memory is still 41.9 MB. Free memory was 16.7 MB in the beginning and 14.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. [2020-10-20 00:40:27,361 INFO L168 Benchmark]: RCFGBuilder took 541.57 ms. Allocated memory was 41.9 MB in the beginning and 44.0 MB in the end (delta: 2.1 MB). Free memory was 14.9 MB in the beginning and 25.3 MB in the end (delta: -10.4 MB). Peak memory consumption was 7.5 MB. Max. memory is 14.3 GB. [2020-10-20 00:40:27,362 INFO L168 Benchmark]: TraceAbstraction took 1282.93 ms. Allocated memory was 44.0 MB in the beginning and 48.8 MB in the end (delta: 4.7 MB). Free memory was 25.0 MB in the beginning and 25.0 MB in the end (delta: -16.5 kB). Peak memory consumption was 4.7 MB. Max. memory is 14.3 GB. [2020-10-20 00:40:27,363 INFO L168 Benchmark]: Witness Printer took 6.07 ms. Allocated memory is still 48.8 MB. Free memory was 25.0 MB in the beginning and 24.6 MB in the end (delta: 415.1 kB). Peak memory consumption was 415.1 kB. Max. memory is 14.3 GB. [2020-10-20 00:40:27,368 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.38 ms. Allocated memory is still 31.5 MB. Free memory was 7.7 MB in the beginning and 7.7 MB in the end (delta: 45.7 kB). Peak memory consumption was 45.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 307.80 ms. Allocated memory was 41.4 MB in the beginning and 41.9 MB in the end (delta: 524.3 kB). Free memory was 18.4 MB in the beginning and 19.1 MB in the end (delta: -684.1 kB). Peak memory consumption was 9.8 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 51.75 ms. Allocated memory is still 41.9 MB. Free memory was 19.1 MB in the beginning and 16.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 42.00 ms. Allocated memory is still 41.9 MB. Free memory was 16.7 MB in the beginning and 14.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * RCFGBuilder took 541.57 ms. Allocated memory was 41.9 MB in the beginning and 44.0 MB in the end (delta: 2.1 MB). Free memory was 14.9 MB in the beginning and 25.3 MB in the end (delta: -10.4 MB). Peak memory consumption was 7.5 MB. Max. memory is 14.3 GB. * TraceAbstraction took 1282.93 ms. Allocated memory was 44.0 MB in the beginning and 48.8 MB in the end (delta: 4.7 MB). Free memory was 25.0 MB in the beginning and 25.0 MB in the end (delta: -16.5 kB). Peak memory consumption was 4.7 MB. Max. memory is 14.3 GB. * Witness Printer took 6.07 ms. Allocated memory is still 48.8 MB. Free memory was 25.0 MB in the beginning and 24.6 MB in the end (delta: 415.1 kB). Peak memory consumption was 415.1 kB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 75. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L57] return x != x; [L69] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L69] EXPR isnan_float(x) && !isnan_float(y) [L69-L70] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L69-L70] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L23] __uint32_t w; [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L31] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L33-L34] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L36-L37] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L39] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L42] return 0; [L46] COND TRUE __fpclassify_float(x) == 0 [L47] return y; [L72] float res = fmax_float(x, y); [L57] return x != x; [L75] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L75] EXPR isnan_float(x) && !isnan_float(y) [L75] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L3] __assert_fail("0", "float_req_bl_1251.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.1s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 343 SDtfs, 79 SDslu, 503 SDs, 0 SdLazy, 88 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, 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, 62 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 1865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 00:40:29,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 00:40:29,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 00:40:29,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 00:40:29,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 00:40:29,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 00:40:29,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 00:40:29,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 00:40:29,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 00:40:29,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 00:40:29,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 00:40:29,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 00:40:29,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 00:40:29,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 00:40:29,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 00:40:29,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 00:40:29,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 00:40:29,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 00:40:29,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 00:40:29,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 00:40:29,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 00:40:29,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 00:40:29,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 00:40:29,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 00:40:29,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 00:40:29,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 00:40:29,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 00:40:29,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 00:40:29,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 00:40:29,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 00:40:29,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 00:40:29,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 00:40:29,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 00:40:29,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 00:40:29,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 00:40:29,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 00:40:29,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 00:40:29,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 00:40:29,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 00:40:29,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 00:40:29,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 00:40:29,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-20 00:40:29,569 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 00:40:29,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 00:40:29,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 00:40:29,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 00:40:29,572 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 00:40:29,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 00:40:29,572 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 00:40:29,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 00:40:29,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 00:40:29,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 00:40:29,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 00:40:29,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 00:40:29,575 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-20 00:40:29,575 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-20 00:40:29,575 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 00:40:29,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 00:40:29,576 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 00:40:29,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 00:40:29,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 00:40:29,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 00:40:29,578 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 00:40:29,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 00:40:29,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:40:29,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 00:40:29,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 00:40:29,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 00:40:29,580 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-20 00:40:29,580 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-20 00:40:29,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 00:40:29,580 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 00:40:29,581 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-20 00:40:29,581 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 32adbfac5f3e3ea232180afd045da0027ca6d993 [2020-10-20 00:40:29,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 00:40:29,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 00:40:29,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 00:40:29,828 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 00:40:29,829 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 00:40:29,830 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2020-10-20 00:40:29,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/097a4f91e/3f2dff8a2cb24b399d1cc5d703f53abd/FLAG9b0ae85ce [2020-10-20 00:40:30,402 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 00:40:30,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2020-10-20 00:40:30,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/097a4f91e/3f2dff8a2cb24b399d1cc5d703f53abd/FLAG9b0ae85ce [2020-10-20 00:40:30,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/097a4f91e/3f2dff8a2cb24b399d1cc5d703f53abd [2020-10-20 00:40:30,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 00:40:30,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 00:40:30,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 00:40:30,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 00:40:30,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 00:40:30,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:40:30" (1/1) ... [2020-10-20 00:40:30,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@559c6d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:30, skipping insertion in model container [2020-10-20 00:40:30,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:40:30" (1/1) ... [2020-10-20 00:40:30,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 00:40:30,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 00:40:31,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:40:31,076 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 00:40:31,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:40:31,125 INFO L208 MainTranslator]: Completed translation [2020-10-20 00:40:31,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:31 WrapperNode [2020-10-20 00:40:31,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 00:40:31,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 00:40:31,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 00:40:31,127 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 00:40:31,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:31" (1/1) ... [2020-10-20 00:40:31,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:31" (1/1) ... [2020-10-20 00:40:31,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 00:40:31,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 00:40:31,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 00:40:31,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 00:40:31,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:31" (1/1) ... [2020-10-20 00:40:31,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:31" (1/1) ... [2020-10-20 00:40:31,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:31" (1/1) ... [2020-10-20 00:40:31,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:31" (1/1) ... [2020-10-20 00:40:31,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:31" (1/1) ... [2020-10-20 00:40:31,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:31" (1/1) ... [2020-10-20 00:40:31,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:31" (1/1) ... [2020-10-20 00:40:31,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 00:40:31,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 00:40:31,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 00:40:31,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 00:40:31,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:40:31,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-20 00:40:31,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 00:40:31,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-10-20 00:40:31,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 00:40:31,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 00:40:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2020-10-20 00:40:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 00:40:31,871 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 00:40:31,871 INFO L298 CfgBuilder]: Removed 34 assume(true) statements. [2020-10-20 00:40:31,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:40:31 BoogieIcfgContainer [2020-10-20 00:40:31,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 00:40:31,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 00:40:31,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 00:40:31,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 00:40:31,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 12:40:30" (1/3) ... [2020-10-20 00:40:31,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f3be7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:40:31, skipping insertion in model container [2020-10-20 00:40:31,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:31" (2/3) ... [2020-10-20 00:40:31,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f3be7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:40:31, skipping insertion in model container [2020-10-20 00:40:31,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:40:31" (3/3) ... [2020-10-20 00:40:31,883 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2020-10-20 00:40:31,896 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 00:40:31,903 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 00:40:31,915 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-20 00:40:31,939 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 00:40:31,939 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 00:40:31,940 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 00:40:31,940 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 00:40:31,940 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 00:40:31,940 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 00:40:31,940 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 00:40:31,941 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 00:40:31,956 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-10-20 00:40:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 00:40:31,963 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:31,964 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:31,965 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:31,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:31,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2020-10-20 00:40:31,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:31,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785690310] [2020-10-20 00:40:31,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:32,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-20 00:40:32,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:32,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:32,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785690310] [2020-10-20 00:40:32,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:32,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-20 00:40:32,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976186488] [2020-10-20 00:40:32,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-20 00:40:32,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:32,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 00:40:32,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:40:32,165 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2020-10-20 00:40:32,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:32,185 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2020-10-20 00:40:32,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 00:40:32,187 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-10-20 00:40:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:32,198 INFO L225 Difference]: With dead ends: 84 [2020-10-20 00:40:32,199 INFO L226 Difference]: Without dead ends: 43 [2020-10-20 00:40:32,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:40:32,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-20 00:40:32,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-20 00:40:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-20 00:40:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2020-10-20 00:40:32,243 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2020-10-20 00:40:32,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:32,244 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-10-20 00:40:32,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-20 00:40:32,244 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2020-10-20 00:40:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 00:40:32,245 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:32,245 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:32,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-20 00:40:32,460 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:32,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:32,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2020-10-20 00:40:32,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:32,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430045414] [2020-10-20 00:40:32,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:32,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 00:40:32,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:32,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:32,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430045414] [2020-10-20 00:40:32,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:32,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-20 00:40:32,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348222170] [2020-10-20 00:40:32,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:40:32,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:32,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:40:32,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:40:32,662 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2020-10-20 00:40:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:32,732 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2020-10-20 00:40:32,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:40:32,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-20 00:40:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:32,734 INFO L225 Difference]: With dead ends: 82 [2020-10-20 00:40:32,734 INFO L226 Difference]: Without dead ends: 50 [2020-10-20 00:40:32,735 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:40:32,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-20 00:40:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-10-20 00:40:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-20 00:40:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2020-10-20 00:40:32,744 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2020-10-20 00:40:32,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:32,744 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2020-10-20 00:40:32,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:40:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2020-10-20 00:40:32,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 00:40:32,745 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:32,746 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:32,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-20 00:40:32,951 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:32,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:32,952 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2020-10-20 00:40:32,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:32,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093614751] [2020-10-20 00:40:32,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:33,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 00:40:33,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:33,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:33,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093614751] [2020-10-20 00:40:33,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:33,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-20 00:40:33,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605714222] [2020-10-20 00:40:33,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 00:40:33,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:33,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 00:40:33,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 00:40:33,085 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2020-10-20 00:40:33,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:33,176 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2020-10-20 00:40:33,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 00:40:33,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-20 00:40:33,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:33,178 INFO L225 Difference]: With dead ends: 96 [2020-10-20 00:40:33,179 INFO L226 Difference]: Without dead ends: 83 [2020-10-20 00:40:33,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 00:40:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-20 00:40:33,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2020-10-20 00:40:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-20 00:40:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-20 00:40:33,196 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2020-10-20 00:40:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:33,196 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-20 00:40:33,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 00:40:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-20 00:40:33,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 00:40:33,201 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:33,201 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:33,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-20 00:40:33,418 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:33,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:33,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2020-10-20 00:40:33,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:33,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319666432] [2020-10-20 00:40:33,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:33,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 00:40:33,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:33,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:33,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:33,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:33,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319666432] [2020-10-20 00:40:33,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:33,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2020-10-20 00:40:33,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508839862] [2020-10-20 00:40:33,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 00:40:33,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:33,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 00:40:33,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-20 00:40:33,676 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2020-10-20 00:40:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:34,178 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2020-10-20 00:40:34,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 00:40:34,179 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-10-20 00:40:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:34,182 INFO L225 Difference]: With dead ends: 149 [2020-10-20 00:40:34,182 INFO L226 Difference]: Without dead ends: 140 [2020-10-20 00:40:34,183 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-10-20 00:40:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-10-20 00:40:34,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 75. [2020-10-20 00:40:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-20 00:40:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2020-10-20 00:40:34,197 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2020-10-20 00:40:34,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:34,197 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2020-10-20 00:40:34,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 00:40:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2020-10-20 00:40:34,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 00:40:34,200 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:34,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:34,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-20 00:40:34,415 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:34,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:34,415 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2020-10-20 00:40:34,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:34,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012292226] [2020-10-20 00:40:34,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:34,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 00:40:34,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:34,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:34,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:34,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:34,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:34,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:34,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012292226] [2020-10-20 00:40:34,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:34,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2020-10-20 00:40:34,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072097140] [2020-10-20 00:40:34,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-20 00:40:34,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:34,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 00:40:34,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-10-20 00:40:34,842 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2020-10-20 00:40:35,837 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2020-10-20 00:40:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:36,026 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2020-10-20 00:40:36,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-20 00:40:36,026 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-10-20 00:40:36,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:36,028 INFO L225 Difference]: With dead ends: 180 [2020-10-20 00:40:36,029 INFO L226 Difference]: Without dead ends: 178 [2020-10-20 00:40:36,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2020-10-20 00:40:36,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-10-20 00:40:36,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2020-10-20 00:40:36,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-20 00:40:36,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2020-10-20 00:40:36,045 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2020-10-20 00:40:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:36,046 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2020-10-20 00:40:36,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-20 00:40:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2020-10-20 00:40:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 00:40:36,047 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:36,048 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:36,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-20 00:40:36,265 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:36,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:36,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2020-10-20 00:40:36,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:36,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933480147] [2020-10-20 00:40:36,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:36,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 00:40:36,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:36,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:36,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:36,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:36,431 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-20 00:40:36,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:40:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:36,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933480147] [2020-10-20 00:40:36,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:36,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2020-10-20 00:40:36,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568340112] [2020-10-20 00:40:36,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 00:40:36,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:36,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 00:40:36,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-20 00:40:36,469 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2020-10-20 00:40:36,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:36,936 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2020-10-20 00:40:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 00:40:36,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-20 00:40:36,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:36,940 INFO L225 Difference]: With dead ends: 166 [2020-10-20 00:40:36,940 INFO L226 Difference]: Without dead ends: 131 [2020-10-20 00:40:36,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2020-10-20 00:40:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-20 00:40:36,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2020-10-20 00:40:36,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-20 00:40:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2020-10-20 00:40:36,973 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2020-10-20 00:40:36,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:36,974 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2020-10-20 00:40:36,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 00:40:36,974 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2020-10-20 00:40:36,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 00:40:36,978 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:36,978 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:37,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-20 00:40:37,192 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:37,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:37,193 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2020-10-20 00:40:37,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:37,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72935569] [2020-10-20 00:40:37,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:37,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 00:40:37,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:37,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:37,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:37,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:37,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72935569] [2020-10-20 00:40:37,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:37,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-20 00:40:37,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444053754] [2020-10-20 00:40:37,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 00:40:37,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:37,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 00:40:37,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 00:40:37,311 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2020-10-20 00:40:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:37,393 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2020-10-20 00:40:37,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 00:40:37,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-20 00:40:37,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:37,395 INFO L225 Difference]: With dead ends: 157 [2020-10-20 00:40:37,395 INFO L226 Difference]: Without dead ends: 141 [2020-10-20 00:40:37,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 00:40:37,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-10-20 00:40:37,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2020-10-20 00:40:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-20 00:40:37,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2020-10-20 00:40:37,411 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2020-10-20 00:40:37,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:37,411 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2020-10-20 00:40:37,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 00:40:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2020-10-20 00:40:37,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 00:40:37,413 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:37,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:37,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-20 00:40:37,623 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:37,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:37,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2020-10-20 00:40:37,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:37,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117294529] [2020-10-20 00:40:37,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:37,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 00:40:37,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:37,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:37,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117294529] [2020-10-20 00:40:37,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:37,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-20 00:40:37,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129647095] [2020-10-20 00:40:37,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:40:37,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:37,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:40:37,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:40:37,690 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2020-10-20 00:40:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:37,724 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2020-10-20 00:40:37,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:40:37,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-20 00:40:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:37,726 INFO L225 Difference]: With dead ends: 96 [2020-10-20 00:40:37,726 INFO L226 Difference]: Without dead ends: 94 [2020-10-20 00:40:37,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:40:37,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-20 00:40:37,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2020-10-20 00:40:37,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-20 00:40:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2020-10-20 00:40:37,741 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2020-10-20 00:40:37,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:37,741 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2020-10-20 00:40:37,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:40:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2020-10-20 00:40:37,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 00:40:37,743 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:37,743 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:37,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-20 00:40:37,957 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:37,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:37,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1743883267, now seen corresponding path program 1 times [2020-10-20 00:40:37,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:37,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691627254] [2020-10-20 00:40:37,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:38,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 00:40:38,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:38,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:38,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:38,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:38,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691627254] [2020-10-20 00:40:38,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:38,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2020-10-20 00:40:38,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273877940] [2020-10-20 00:40:38,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 00:40:38,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:38,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 00:40:38,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-20 00:40:38,178 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2020-10-20 00:40:38,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:38,567 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2020-10-20 00:40:38,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 00:40:38,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-10-20 00:40:38,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:38,568 INFO L225 Difference]: With dead ends: 131 [2020-10-20 00:40:38,568 INFO L226 Difference]: Without dead ends: 118 [2020-10-20 00:40:38,569 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-10-20 00:40:38,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-20 00:40:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2020-10-20 00:40:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-20 00:40:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2020-10-20 00:40:38,578 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2020-10-20 00:40:38,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:38,579 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2020-10-20 00:40:38,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 00:40:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2020-10-20 00:40:38,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 00:40:38,580 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:38,580 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:38,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-20 00:40:38,791 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:38,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:38,792 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2020-10-20 00:40:38,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:38,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64148424] [2020-10-20 00:40:38,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:38,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 00:40:38,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:38,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:38,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:38,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:38,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64148424] [2020-10-20 00:40:38,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:38,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2020-10-20 00:40:38,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028190322] [2020-10-20 00:40:38,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 00:40:38,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:38,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 00:40:38,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-20 00:40:38,994 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2020-10-20 00:40:39,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:39,361 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2020-10-20 00:40:39,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 00:40:39,362 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-20 00:40:39,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:39,363 INFO L225 Difference]: With dead ends: 114 [2020-10-20 00:40:39,363 INFO L226 Difference]: Without dead ends: 78 [2020-10-20 00:40:39,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2020-10-20 00:40:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-20 00:40:39,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2020-10-20 00:40:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-20 00:40:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2020-10-20 00:40:39,373 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2020-10-20 00:40:39,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:39,373 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2020-10-20 00:40:39,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 00:40:39,374 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2020-10-20 00:40:39,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 00:40:39,375 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:39,375 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:39,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-10-20 00:40:39,589 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:39,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:39,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2020-10-20 00:40:39,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:39,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204259287] [2020-10-20 00:40:39,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:39,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 00:40:39,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:39,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:39,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:39,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:39,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:39,736 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-20 00:40:39,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:40:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:39,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204259287] [2020-10-20 00:40:39,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:39,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2020-10-20 00:40:39,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532137214] [2020-10-20 00:40:39,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 00:40:39,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:39,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 00:40:39,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-20 00:40:39,779 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2020-10-20 00:40:40,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:40,088 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-10-20 00:40:40,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 00:40:40,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-20 00:40:40,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:40,089 INFO L225 Difference]: With dead ends: 84 [2020-10-20 00:40:40,090 INFO L226 Difference]: Without dead ends: 74 [2020-10-20 00:40:40,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-10-20 00:40:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-20 00:40:40,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-20 00:40:40,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-20 00:40:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2020-10-20 00:40:40,102 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2020-10-20 00:40:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:40,103 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2020-10-20 00:40:40,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 00:40:40,103 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2020-10-20 00:40:40,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 00:40:40,104 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:40,104 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:40,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-10-20 00:40:40,317 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:40,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:40,318 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2020-10-20 00:40:40,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:40,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777298699] [2020-10-20 00:40:40,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:40,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 00:40:40,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:40,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:40,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:40,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777298699] [2020-10-20 00:40:40,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:40,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-10-20 00:40:40,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907196690] [2020-10-20 00:40:40,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 00:40:40,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:40,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 00:40:40,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-20 00:40:40,789 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2020-10-20 00:40:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:41,116 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2020-10-20 00:40:41,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 00:40:41,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-10-20 00:40:41,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:41,118 INFO L225 Difference]: With dead ends: 82 [2020-10-20 00:40:41,118 INFO L226 Difference]: Without dead ends: 74 [2020-10-20 00:40:41,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-10-20 00:40:41,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-20 00:40:41,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-20 00:40:41,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-20 00:40:41,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2020-10-20 00:40:41,126 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2020-10-20 00:40:41,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:41,127 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2020-10-20 00:40:41,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 00:40:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2020-10-20 00:40:41,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 00:40:41,128 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:41,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:41,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-10-20 00:40:41,341 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:41,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:41,341 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2020-10-20 00:40:41,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:41,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642949085] [2020-10-20 00:40:41,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:41,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 00:40:41,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:41,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:41,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:41,744 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:40:41,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642949085] [2020-10-20 00:40:41,747 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 32) [2020-10-20 00:40:41,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1786241839] [2020-10-20 00:40:41,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-20 00:40:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:42,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 00:40:42,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:42,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:42,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:42,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:42,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:42,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:42,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:42,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2020-10-20 00:40:42,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478641225] [2020-10-20 00:40:42,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-20 00:40:42,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:42,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-20 00:40:42,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2020-10-20 00:40:42,549 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2020-10-20 00:40:43,082 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2020-10-20 00:40:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:43,450 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2020-10-20 00:40:43,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 00:40:43,451 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2020-10-20 00:40:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:43,452 INFO L225 Difference]: With dead ends: 81 [2020-10-20 00:40:43,453 INFO L226 Difference]: Without dead ends: 70 [2020-10-20 00:40:43,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=231, Invalid=891, Unknown=0, NotChecked=0, Total=1122 [2020-10-20 00:40:43,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-20 00:40:43,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-20 00:40:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-20 00:40:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2020-10-20 00:40:43,460 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 26 [2020-10-20 00:40:43,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:43,460 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2020-10-20 00:40:43,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-20 00:40:43,461 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2020-10-20 00:40:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-20 00:40:43,461 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:43,461 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:43,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3,15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-20 00:40:43,865 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:43,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:43,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2020-10-20 00:40:43,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:43,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660304052] [2020-10-20 00:40:43,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:43,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-20 00:40:43,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:43,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:43,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:43,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:44,315 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2020-10-20 00:40:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:44,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:44,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660304052] [2020-10-20 00:40:44,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:44,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2020-10-20 00:40:44,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693031383] [2020-10-20 00:40:44,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-20 00:40:44,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:44,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 00:40:44,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-10-20 00:40:44,596 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 15 states. [2020-10-20 00:40:45,950 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2020-10-20 00:40:46,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:46,824 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2020-10-20 00:40:46,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-10-20 00:40:46,824 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-10-20 00:40:46,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:46,826 INFO L225 Difference]: With dead ends: 193 [2020-10-20 00:40:46,826 INFO L226 Difference]: Without dead ends: 158 [2020-10-20 00:40:46,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2020-10-20 00:40:46,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-20 00:40:46,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2020-10-20 00:40:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-20 00:40:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2020-10-20 00:40:46,834 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2020-10-20 00:40:46,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:46,834 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2020-10-20 00:40:46,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-20 00:40:46,834 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2020-10-20 00:40:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-20 00:40:46,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:46,835 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:47,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-10-20 00:40:47,050 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:47,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:47,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1423958792, now seen corresponding path program 1 times [2020-10-20 00:40:47,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:47,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27271368] [2020-10-20 00:40:47,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:47,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-20 00:40:47,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:47,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:47,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:47,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:47,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27271368] [2020-10-20 00:40:47,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:47,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2020-10-20 00:40:47,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340674330] [2020-10-20 00:40:47,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 00:40:47,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:47,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 00:40:47,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-20 00:40:47,531 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 12 states. [2020-10-20 00:40:48,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:48,593 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2020-10-20 00:40:48,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-20 00:40:48,594 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-10-20 00:40:48,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:48,595 INFO L225 Difference]: With dead ends: 125 [2020-10-20 00:40:48,595 INFO L226 Difference]: Without dead ends: 101 [2020-10-20 00:40:48,596 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2020-10-20 00:40:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-20 00:40:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2020-10-20 00:40:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-20 00:40:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-10-20 00:40:48,602 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2020-10-20 00:40:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:48,602 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-10-20 00:40:48,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 00:40:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-10-20 00:40:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-20 00:40:48,603 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:48,603 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:48,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-10-20 00:40:48,807 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:48,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:48,807 INFO L82 PathProgramCache]: Analyzing trace with hash 489956430, now seen corresponding path program 1 times [2020-10-20 00:40:48,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:48,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455168536] [2020-10-20 00:40:48,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:48,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 00:40:48,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:48,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:48,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:48,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:49,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455168536] [2020-10-20 00:40:49,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:49,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-10-20 00:40:49,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784080995] [2020-10-20 00:40:49,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 00:40:49,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:49,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 00:40:49,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-20 00:40:49,222 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2020-10-20 00:40:49,732 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-10-20 00:40:49,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:49,967 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-10-20 00:40:49,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 00:40:49,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2020-10-20 00:40:49,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:49,969 INFO L225 Difference]: With dead ends: 52 [2020-10-20 00:40:49,969 INFO L226 Difference]: Without dead ends: 41 [2020-10-20 00:40:49,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-10-20 00:40:49,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-20 00:40:49,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-10-20 00:40:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-20 00:40:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2020-10-20 00:40:49,974 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2020-10-20 00:40:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:49,974 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2020-10-20 00:40:49,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 00:40:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-10-20 00:40:49,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-20 00:40:49,975 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:49,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:50,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-10-20 00:40:50,185 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:50,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1191021008, now seen corresponding path program 1 times [2020-10-20 00:40:50,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:50,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548568002] [2020-10-20 00:40:50,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:50,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-20 00:40:50,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:50,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:50,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:50,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:50,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:50,371 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:40:50,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548568002] [2020-10-20 00:40:50,372 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 32) [2020-10-20 00:40:50,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [482587475] [2020-10-20 00:40:50,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-20 00:40:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:50,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 00:40:50,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:50,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:50,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:50,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:50,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:40:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:50,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:50,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2020-10-20 00:40:50,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255234486] [2020-10-20 00:40:51,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 00:40:51,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:51,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 00:40:51,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-10-20 00:40:51,000 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2020-10-20 00:40:51,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:51,693 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-10-20 00:40:51,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 00:40:51,694 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2020-10-20 00:40:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:51,694 INFO L225 Difference]: With dead ends: 55 [2020-10-20 00:40:51,694 INFO L226 Difference]: Without dead ends: 41 [2020-10-20 00:40:51,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2020-10-20 00:40:51,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-20 00:40:51,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2020-10-20 00:40:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-20 00:40:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-10-20 00:40:51,700 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2020-10-20 00:40:51,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:51,701 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-10-20 00:40:51,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 00:40:51,701 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-10-20 00:40:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-20 00:40:51,702 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:51,702 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:52,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3,20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-20 00:40:52,105 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:52,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:52,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1654102483, now seen corresponding path program 1 times [2020-10-20 00:40:52,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:52,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944218838] [2020-10-20 00:40:52,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:52,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 00:40:52,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:52,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:52,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:52,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:40:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:52,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944218838] [2020-10-20 00:40:52,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:52,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2020-10-20 00:40:52,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144933303] [2020-10-20 00:40:52,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 00:40:52,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:52,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 00:40:52,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-20 00:40:52,466 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2020-10-20 00:40:57,069 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2020-10-20 00:40:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:58,517 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2020-10-20 00:40:58,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 00:40:58,518 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2020-10-20 00:40:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:58,518 INFO L225 Difference]: With dead ends: 79 [2020-10-20 00:40:58,518 INFO L226 Difference]: Without dead ends: 61 [2020-10-20 00:40:58,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2020-10-20 00:40:58,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-20 00:40:58,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2020-10-20 00:40:58,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-20 00:40:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-10-20 00:40:58,525 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2020-10-20 00:40:58,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:58,525 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-10-20 00:40:58,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 00:40:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-10-20 00:40:58,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 00:40:58,530 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:58,530 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:40:58,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2020-10-20 00:40:58,740 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:58,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:58,741 INFO L82 PathProgramCache]: Analyzing trace with hash 798574185, now seen corresponding path program 1 times [2020-10-20 00:40:58,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:58,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546577659] [2020-10-20 00:40:58,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2020-10-20 00:40:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:58,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 00:40:58,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:58,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:40:58,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546577659] [2020-10-20 00:40:58,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:58,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-20 00:40:58,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812424113] [2020-10-20 00:40:58,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:40:58,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:58,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:40:58,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:40:58,880 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2020-10-20 00:40:58,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:58,911 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-10-20 00:40:58,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:40:58,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-20 00:40:58,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:58,911 INFO L225 Difference]: With dead ends: 39 [2020-10-20 00:40:58,911 INFO L226 Difference]: Without dead ends: 0 [2020-10-20 00:40:58,912 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:40:58,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-20 00:40:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-20 00:40:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-20 00:40:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 00:40:58,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2020-10-20 00:40:58,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:58,915 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 00:40:58,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:40:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-20 00:40:58,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-20 00:40:59,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2020-10-20 00:40:59,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-20 00:40:59,336 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 102 [2020-10-20 00:41:00,503 WARN L193 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 45 [2020-10-20 00:41:01,381 WARN L193 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 41 [2020-10-20 00:41:01,718 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2020-10-20 00:41:02,103 WARN L193 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2020-10-20 00:41:03,159 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-10-20 00:41:04,127 WARN L193 SmtUtils]: Spent 945.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 48 [2020-10-20 00:41:04,470 WARN L193 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2020-10-20 00:41:04,789 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2020-10-20 00:41:04,858 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-20 00:41:04,858 INFO L274 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2020-10-20 00:41:04,858 INFO L274 CegarLoopResult]: For program point L36(lines 36 42) no Hoare annotation was computed. [2020-10-20 00:41:04,859 INFO L274 CegarLoopResult]: For program point L69-2(line 69) no Hoare annotation was computed. [2020-10-20 00:41:04,859 INFO L274 CegarLoopResult]: For program point L36-1(lines 36 42) no Hoare annotation was computed. [2020-10-20 00:41:04,859 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-20 00:41:04,859 INFO L274 CegarLoopResult]: For program point L69-3(lines 69 70) no Hoare annotation was computed. [2020-10-20 00:41:04,859 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-10-20 00:41:04,859 INFO L274 CegarLoopResult]: For program point L3-2(line 3) no Hoare annotation was computed. [2020-10-20 00:41:04,859 INFO L274 CegarLoopResult]: For program point L69-5(lines 69 85) no Hoare annotation was computed. [2020-10-20 00:41:04,859 INFO L274 CegarLoopResult]: For program point L3-3(line 3) no Hoare annotation was computed. [2020-10-20 00:41:04,859 INFO L274 CegarLoopResult]: For program point L69-7(lines 69 85) no Hoare annotation was computed. [2020-10-20 00:41:04,859 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-20 00:41:04,860 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-20 00:41:04,860 INFO L274 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2020-10-20 00:41:04,860 INFO L274 CegarLoopResult]: For program point L53-2(line 53) no Hoare annotation was computed. [2020-10-20 00:41:04,860 INFO L270 CegarLoopResult]: At program point L53-3(lines 45 54) the Hoare annotation is: (let ((.cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (.cse3 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (let ((.cse1 (forall ((ULTIMATE.start_fmax_float_~x (_ FloatingPoint 8 24))) (not (fp.gt ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~y~0))))) (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))) (or (not |ULTIMATE.start_main_#t~short20|) .cse1) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (or (and .cse2 .cse3) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse3))) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (or .cse1 (not |ULTIMATE.start_main_#t~short19|)) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0))) (and .cse2 .cse3 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|)))) [2020-10-20 00:41:04,860 INFO L274 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2020-10-20 00:41:04,860 INFO L274 CegarLoopResult]: For program point L70-2(line 70) no Hoare annotation was computed. [2020-10-20 00:41:04,861 INFO L277 CegarLoopResult]: At program point L87(lines 59 88) the Hoare annotation is: true [2020-10-20 00:41:04,861 INFO L274 CegarLoopResult]: For program point L46(lines 46 48) no Hoare annotation was computed. [2020-10-20 00:41:04,861 INFO L274 CegarLoopResult]: For program point L39(lines 39 42) no Hoare annotation was computed. [2020-10-20 00:41:04,861 INFO L274 CegarLoopResult]: For program point L39-1(lines 39 42) no Hoare annotation was computed. [2020-10-20 00:41:04,862 INFO L274 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2020-10-20 00:41:04,862 INFO L274 CegarLoopResult]: For program point L81-2(lines 81 84) no Hoare annotation was computed. [2020-10-20 00:41:04,862 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-20 00:41:04,863 INFO L270 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) [2020-10-20 00:41:04,863 INFO L270 CegarLoopResult]: At program point L57-1(line 57) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short16| (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2020-10-20 00:41:04,863 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-20 00:41:04,863 INFO L270 CegarLoopResult]: At program point L57-2(line 57) the Hoare annotation is: (let ((.cse0 (not |ULTIMATE.start_main_#t~short20|)) (.cse1 (not |ULTIMATE.start_main_#t~short16|)) (.cse2 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 .cse1 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not .cse2)) (and .cse0 .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse2))) [2020-10-20 00:41:04,864 INFO L270 CegarLoopResult]: At program point L57-3(line 57) the Hoare annotation is: (and (not |ULTIMATE.start_main_#t~short20|) (not |ULTIMATE.start_main_#t~short16|) |ULTIMATE.start_main_#t~short19| (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) [2020-10-20 00:41:04,864 INFO L270 CegarLoopResult]: At program point L57-4(line 57) the Hoare annotation is: (or (and (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|)) (let ((.cse1 (forall ((ULTIMATE.start_fmax_float_~x (_ FloatingPoint 8 24))) (not (fp.gt ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~y~0))))) (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))) (or (not |ULTIMATE.start_main_#t~short20|) .cse1) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (or .cse1 (not |ULTIMATE.start_main_#t~short19|)) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0)))) [2020-10-20 00:41:04,864 INFO L270 CegarLoopResult]: At program point L57-5(line 57) the Hoare annotation is: (and (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) |ULTIMATE.start_main_#t~short24| (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|)) [2020-10-20 00:41:04,865 INFO L270 CegarLoopResult]: At program point L57-6(line 57) the Hoare annotation is: (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (let ((.cse1 (forall ((ULTIMATE.start_fmax_float_~x (_ FloatingPoint 8 24))) (not (fp.gt ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~y~0))))) (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))) (or (not |ULTIMATE.start_main_#t~short20|) .cse1) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (or .cse1 (not |ULTIMATE.start_main_#t~short19|)) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0)))) [2020-10-20 00:41:04,865 INFO L270 CegarLoopResult]: At program point L57-7(line 57) the Hoare annotation is: (let ((.cse1 (forall ((ULTIMATE.start_fmax_float_~x (_ FloatingPoint 8 24))) (not (fp.gt ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~y~0))))) (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))) (or (not |ULTIMATE.start_main_#t~short20|) .cse1) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (let ((.cse2 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse2) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse2)))) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (or .cse1 (not |ULTIMATE.start_main_#t~short19|)) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0))) [2020-10-20 00:41:04,865 INFO L274 CegarLoopResult]: For program point L33(lines 33 42) no Hoare annotation was computed. [2020-10-20 00:41:04,865 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-20 00:41:04,865 INFO L274 CegarLoopResult]: For program point L33-1(lines 33 42) no Hoare annotation was computed. [2020-10-20 00:41:04,866 INFO L274 CegarLoopResult]: For program point L25-1(lines 25 29) no Hoare annotation was computed. [2020-10-20 00:41:04,866 INFO L270 CegarLoopResult]: At program point L25-2(lines 25 29) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (.cse1 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (.cse2 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse0 .cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0) (not .cse2)) (let ((.cse3 (forall ((ULTIMATE.start_fmax_float_~x (_ FloatingPoint 8 24))) (not (fp.gt ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~y~0))))) (and (or (not |ULTIMATE.start_main_#t~short20|) .cse3) (or (and .cse0 .cse1) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse1))) (or .cse3 (not |ULTIMATE.start_main_#t~short19|)) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) .cse2 (= ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmax_float_~x ULTIMATE.start___fpclassify_float_~x))))) [2020-10-20 00:41:04,866 INFO L274 CegarLoopResult]: For program point L25-3(lines 22 43) no Hoare annotation was computed. [2020-10-20 00:41:04,866 INFO L274 CegarLoopResult]: For program point L25-5(lines 25 29) no Hoare annotation was computed. [2020-10-20 00:41:04,867 INFO L270 CegarLoopResult]: At program point L25-6(lines 25 29) the Hoare annotation is: (let ((.cse1 (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (.cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (.cse2 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse0 .cse1 .cse2 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (let ((.cse3 (forall ((ULTIMATE.start_fmax_float_~x (_ FloatingPoint 8 24))) (not (fp.gt ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~y~0))))) (and (or (not |ULTIMATE.start_main_#t~short20|) .cse3) (not .cse1) (or (and .cse0 .cse2) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse2))) (or .cse3 (not |ULTIMATE.start_main_#t~short19|)) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0))))) [2020-10-20 00:41:04,868 INFO L274 CegarLoopResult]: For program point L25-7(lines 22 43) no Hoare annotation was computed. [2020-10-20 00:41:04,868 INFO L274 CegarLoopResult]: For program point L50(lines 50 52) no Hoare annotation was computed. [2020-10-20 00:41:04,868 INFO L274 CegarLoopResult]: For program point L75(line 75) no Hoare annotation was computed. [2020-10-20 00:41:04,868 INFO L270 CegarLoopResult]: At program point L42(lines 22 43) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (.cse1 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse0 .cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (let ((.cse3 (forall ((ULTIMATE.start_fmax_float_~x (_ FloatingPoint 8 24))) (not (fp.gt ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~y~0)))) (.cse2 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (and (= ULTIMATE.start_fmax_float_~x .cse2) (or (not |ULTIMATE.start_main_#t~short20|) .cse3) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (or (and .cse0 .cse1) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse1))) (or .cse3 (not |ULTIMATE.start_main_#t~short19|)) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (= ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmax_float_~x ULTIMATE.start___fpclassify_float_~x) (fp.eq .cse2 .cse2))))) [2020-10-20 00:41:04,869 INFO L270 CegarLoopResult]: At program point L42-1(lines 22 43) the Hoare annotation is: (let ((.cse4 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (.cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (.cse3 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (let ((.cse1 (forall ((ULTIMATE.start_fmax_float_~x (_ FloatingPoint 8 24))) (not (fp.gt ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~y~0))))) (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))) (or (not |ULTIMATE.start_main_#t~short20|) .cse1) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (or (and .cse2 .cse3) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse3))) (or .cse1 (not |ULTIMATE.start_main_#t~short19|)) (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) .cse4)) (and (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (not .cse4) .cse2 .cse3 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))))) [2020-10-20 00:41:04,869 INFO L274 CegarLoopResult]: For program point L75-2(lines 75 78) no Hoare annotation was computed. [2020-10-20 00:41:04,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:04,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 12:41:04 BoogieIcfgContainer [2020-10-20 00:41:04,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 00:41:04,926 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 00:41:04,926 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 00:41:04,930 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 00:41:04,931 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:40:31" (3/4) ... [2020-10-20 00:41:04,942 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-20 00:41:04,957 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2020-10-20 00:41:04,957 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-20 00:41:04,958 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-10-20 00:41:04,958 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 00:41:04,989 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0bv32 == \result && ~fp.eq~FLOAT(x, x)) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) [2020-10-20 00:41:04,990 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (aux-isnan_float(x) && !isnan_float(y)-aux && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && !~fp.eq~FLOAT(x, x) [2020-10-20 00:41:04,990 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) [2020-10-20 00:41:04,991 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && aux-!isnan_float(x) && isnan_float(y)-aux) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && ~fp.eq~FLOAT(x, x) [2020-10-20 00:41:04,991 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!~fp.eq~FLOAT(x, x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) || (((((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y))) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && ((forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)) || !aux-!isnan_float(x) && isnan_float(y)-aux)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && x == x) && x == x) [2020-10-20 00:41:04,991 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!~fp.eq~FLOAT(x, x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) || ((((((((x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)))) && !(0bv32 == \result)) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && ((forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)) || !aux-!isnan_float(x) && isnan_float(y)-aux)) && !~fp.eq~FLOAT(y, y)) && x == x) && x == x) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) [2020-10-20 00:41:04,992 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)))) && !~fp.eq~FLOAT(x, x)) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && ~fp.eq~FLOAT(\result, x)) && ((forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)) || !aux-!isnan_float(x) && isnan_float(y)-aux)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) || ((((0bv32 == \result && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) && y == \result) [2020-10-20 00:41:04,992 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!~fp.eq~FLOAT(x, x) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) || ((((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y))) && !~fp.eq~FLOAT(x, x)) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && ((forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)) || !aux-!isnan_float(x) && isnan_float(y)-aux)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) [2020-10-20 00:41:04,993 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == res && 1bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) && y == \result) || ((((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)))) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ((forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)) || !aux-!isnan_float(x) && isnan_float(y)-aux)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) [2020-10-20 00:41:04,993 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)))) && !~fp.eq~FLOAT(x, x)) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && ((forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)) || !aux-!isnan_float(x) && isnan_float(y)-aux)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((!~fp.eq~FLOAT(x, x) && !(0bv32 == \result)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) [2020-10-20 00:41:04,994 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == res && 0bv32 == \result) && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) && y == \result [2020-10-20 00:41:04,994 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || ((((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)))) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ((forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)) || !aux-!isnan_float(x) && isnan_float(y)-aux)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) [2020-10-20 00:41:04,995 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)))) && !~fp.eq~FLOAT(x, x)) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && ~fp.eq~FLOAT(\result, x)) && ((forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)) || !aux-!isnan_float(x) && isnan_float(y)-aux)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x) [2020-10-20 00:41:05,029 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 00:41:05,030 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 00:41:05,031 INFO L168 Benchmark]: Toolchain (without parser) took 34300.02 ms. Allocated memory was 34.1 MB in the beginning and 84.9 MB in the end (delta: 50.9 MB). Free memory was 7.0 MB in the beginning and 54.7 MB in the end (delta: -47.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 14.3 GB. [2020-10-20 00:41:05,032 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 34.1 MB. Free memory was 12.5 MB in the beginning and 12.4 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. [2020-10-20 00:41:05,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.07 ms. Allocated memory was 36.2 MB in the beginning and 43.5 MB in the end (delta: 7.3 MB). Free memory was 18.9 MB in the beginning and 23.8 MB in the end (delta: -4.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 14.3 GB. [2020-10-20 00:41:05,033 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.19 ms. Allocated memory is still 43.5 MB. Free memory was 23.8 MB in the beginning and 21.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. [2020-10-20 00:41:05,033 INFO L168 Benchmark]: Boogie Preprocessor took 41.92 ms. Allocated memory is still 43.5 MB. Free memory was 21.6 MB in the beginning and 19.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. [2020-10-20 00:41:05,034 INFO L168 Benchmark]: RCFGBuilder took 651.66 ms. Allocated memory was 43.5 MB in the beginning and 45.6 MB in the end (delta: 2.1 MB). Free memory was 19.5 MB in the beginning and 25.2 MB in the end (delta: -5.7 MB). Peak memory consumption was 11.3 MB. Max. memory is 14.3 GB. [2020-10-20 00:41:05,035 INFO L168 Benchmark]: TraceAbstraction took 33050.96 ms. Allocated memory was 45.6 MB in the beginning and 84.9 MB in the end (delta: 39.3 MB). Free memory was 24.6 MB in the beginning and 61.9 MB in the end (delta: -37.3 MB). Peak memory consumption was 57.4 MB. Max. memory is 14.3 GB. [2020-10-20 00:41:05,035 INFO L168 Benchmark]: Witness Printer took 103.56 ms. Allocated memory is still 84.9 MB. Free memory was 61.9 MB in the beginning and 54.7 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 14.3 GB. [2020-10-20 00:41:05,038 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.18 ms. Allocated memory is still 34.1 MB. Free memory was 12.5 MB in the beginning and 12.4 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 378.07 ms. Allocated memory was 36.2 MB in the beginning and 43.5 MB in the end (delta: 7.3 MB). Free memory was 18.9 MB in the beginning and 23.8 MB in the end (delta: -4.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 53.19 ms. Allocated memory is still 43.5 MB. Free memory was 23.8 MB in the beginning and 21.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 41.92 ms. Allocated memory is still 43.5 MB. Free memory was 21.6 MB in the beginning and 19.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * RCFGBuilder took 651.66 ms. Allocated memory was 43.5 MB in the beginning and 45.6 MB in the end (delta: 2.1 MB). Free memory was 19.5 MB in the beginning and 25.2 MB in the end (delta: -5.7 MB). Peak memory consumption was 11.3 MB. Max. memory is 14.3 GB. * TraceAbstraction took 33050.96 ms. Allocated memory was 45.6 MB in the beginning and 84.9 MB in the end (delta: 39.3 MB). Free memory was 24.6 MB in the beginning and 61.9 MB in the end (delta: -37.3 MB). Peak memory consumption was 57.4 MB. Max. memory is 14.3 GB. * Witness Printer took 103.56 ms. Allocated memory is still 84.9 MB. Free memory was 61.9 MB in the beginning and 54.7 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 45]: Loop Invariant [2020-10-20 00:41:05,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,052 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,052 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] Derived loop invariant: (((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)))) && !~fp.eq~FLOAT(x, x)) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && ~fp.eq~FLOAT(\result, x)) && ((forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)) || !aux-!isnan_float(x) && isnan_float(y)-aux)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) || ((((0bv32 == \result && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) && y == \result) - InvariantResult [Line: 57]: Loop Invariant [2020-10-20 00:41:05,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] Derived loop invariant: (((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)))) && !~fp.eq~FLOAT(x, x)) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && ~fp.eq~FLOAT(\result, x)) && ((forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)) || !aux-!isnan_float(x) && isnan_float(y)-aux)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x) - InvariantResult [Line: 57]: Loop Invariant [2020-10-20 00:41:05,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] Derived loop invariant: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || ((((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)))) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ((forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)) || !aux-!isnan_float(x) && isnan_float(y)-aux)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 25]: Loop Invariant [2020-10-20 00:41:05,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] Derived loop invariant: (((((!~fp.eq~FLOAT(x, x) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) || ((((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y))) && !~fp.eq~FLOAT(x, x)) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && ((forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)) || !aux-!isnan_float(x) && isnan_float(y)-aux)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 22]: Loop Invariant [2020-10-20 00:41:05,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] Derived loop invariant: (((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)))) && !~fp.eq~FLOAT(x, x)) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && ((forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)) || !aux-!isnan_float(x) && isnan_float(y)-aux)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((!~fp.eq~FLOAT(x, x) && !(0bv32 == \result)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((y == res && 0bv32 == \result) && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) && y == \result - InvariantResult [Line: 22]: Loop Invariant [2020-10-20 00:41:05,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] Derived loop invariant: ((((!~fp.eq~FLOAT(x, x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) || ((((((((x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)))) && !(0bv32 == \result)) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && ((forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)) || !aux-!isnan_float(x) && isnan_float(y)-aux)) && !~fp.eq~FLOAT(y, y)) && x == x) && x == x) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) - InvariantResult [Line: 57]: Loop Invariant [2020-10-20 00:41:05,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] Derived loop invariant: (((((y == res && 1bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) && y == \result) || ((((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)))) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ((forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)) || !aux-!isnan_float(x) && isnan_float(y)-aux)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && aux-!isnan_float(x) && isnan_float(y)-aux) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && ~fp.eq~FLOAT(x, x) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant [2020-10-20 00:41:05,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] [2020-10-20 00:41:05,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmax_float_~x,QUANTIFIED] Derived loop invariant: ((((!~fp.eq~FLOAT(x, x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && y == y) && !~fp.eq~FLOAT(x, x)) || (((((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y))) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && ((forall ULTIMATE.start_fmax_float_~x : C_FLOAT :: !~fp.gt~FLOAT(ULTIMATE.start_fmax_float_~x, y)) || !aux-!isnan_float(x) && isnan_float(y)-aux)) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && x == x) && x == x) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (aux-isnan_float(x) && !isnan_float(y)-aux && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (0bv32 == \result && ~fp.eq~FLOAT(x, x)) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 27.1s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1146 SDtfs, 2207 SDslu, 4821 SDs, 0 SdLazy, 1909 SolverSat, 269 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1128 GetRequests, 845 SyntacticMatches, 10 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 516 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 44 NumberOfFragments, 703 HoareAnnotationTreeSize, 14 FomulaSimplifications, 116688 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 14 FomulaSimplificationsInter, 15369 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 920 ConstructedInterpolants, 32 QuantifiedInterpolants, 91578 SizeOfPredicates, 149 NumberOfNonLiveVariables, 1698 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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 proved your program to be correct! Received shutdown request...