./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1231.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_1231.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 8039b1e35b9e459b273890fa707790cd9b2d1812 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_1231.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 8039b1e35b9e459b273890fa707790cd9b2d1812 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:09,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 00:40:09,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 00:40:09,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 00:40:09,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 00:40:09,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 00:40:09,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 00:40:09,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 00:40:09,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 00:40:09,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 00:40:09,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 00:40:09,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 00:40:09,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 00:40:09,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 00:40:09,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 00:40:09,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 00:40:09,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 00:40:09,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 00:40:09,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 00:40:09,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 00:40:09,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 00:40:09,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 00:40:09,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 00:40:09,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 00:40:09,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 00:40:09,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 00:40:09,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 00:40:09,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 00:40:09,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 00:40:09,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 00:40:09,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 00:40:09,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 00:40:09,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 00:40:09,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 00:40:09,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 00:40:09,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 00:40:09,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 00:40:09,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 00:40:09,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 00:40:09,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 00:40:09,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 00:40:09,330 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:09,386 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 00:40:09,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 00:40:09,388 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 00:40:09,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 00:40:09,391 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 00:40:09,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 00:40:09,392 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 00:40:09,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 00:40:09,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 00:40:09,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 00:40:09,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 00:40:09,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 00:40:09,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 00:40:09,393 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 00:40:09,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 00:40:09,393 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 00:40:09,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 00:40:09,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 00:40:09,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 00:40:09,396 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 00:40:09,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 00:40:09,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:40:09,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 00:40:09,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 00:40:09,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 00:40:09,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 00:40:09,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 00:40:09,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 00:40:09,398 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 00:40:09,399 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 -> 8039b1e35b9e459b273890fa707790cd9b2d1812 [2020-10-20 00:40:09,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 00:40:09,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 00:40:09,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 00:40:09,626 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 00:40:09,626 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 00:40:09,627 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2020-10-20 00:40:09,690 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc53290d2/0b1346b8304b44fdb13091db222f2d9c/FLAGa22b8a413 [2020-10-20 00:40:10,131 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 00:40:10,133 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2020-10-20 00:40:10,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc53290d2/0b1346b8304b44fdb13091db222f2d9c/FLAGa22b8a413 [2020-10-20 00:40:10,452 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc53290d2/0b1346b8304b44fdb13091db222f2d9c [2020-10-20 00:40:10,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 00:40:10,464 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 00:40:10,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 00:40:10,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 00:40:10,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 00:40:10,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:40:10" (1/1) ... [2020-10-20 00:40:10,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1170f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:10, skipping insertion in model container [2020-10-20 00:40:10,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:40:10" (1/1) ... [2020-10-20 00:40:10,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 00:40:10,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 00:40:10,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:40:10,914 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 00:40:10,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:40:10,961 INFO L208 MainTranslator]: Completed translation [2020-10-20 00:40:10,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:10 WrapperNode [2020-10-20 00:40:10,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 00:40:10,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 00:40:10,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 00:40:10,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 00:40:10,970 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:10" (1/1) ... [2020-10-20 00:40:10,981 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:10" (1/1) ... [2020-10-20 00:40:11,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 00:40:11,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 00:40:11,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 00:40:11,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 00:40:11,025 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:10" (1/1) ... [2020-10-20 00:40:11,025 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:10" (1/1) ... [2020-10-20 00:40:11,028 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:10" (1/1) ... [2020-10-20 00:40:11,029 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:10" (1/1) ... [2020-10-20 00:40:11,038 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:10" (1/1) ... [2020-10-20 00:40:11,043 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:10" (1/1) ... [2020-10-20 00:40:11,045 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:10" (1/1) ... [2020-10-20 00:40:11,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 00:40:11,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 00:40:11,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 00:40:11,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 00:40:11,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:10" (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:11,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 00:40:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 00:40:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-10-20 00:40:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 00:40:11,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 00:40:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 00:40:11,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 00:40:11,557 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 00:40:11,558 INFO L298 CfgBuilder]: Removed 34 assume(true) statements. [2020-10-20 00:40:11,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:40:11 BoogieIcfgContainer [2020-10-20 00:40:11,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 00:40:11,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 00:40:11,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 00:40:11,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 00:40:11,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 12:40:10" (1/3) ... [2020-10-20 00:40:11,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c34857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:40:11, skipping insertion in model container [2020-10-20 00:40:11,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:10" (2/3) ... [2020-10-20 00:40:11,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c34857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:40:11, skipping insertion in model container [2020-10-20 00:40:11,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:40:11" (3/3) ... [2020-10-20 00:40:11,572 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2020-10-20 00:40:11,586 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 00:40:11,593 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 00:40:11,609 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-20 00:40:11,638 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 00:40:11,638 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 00:40:11,639 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 00:40:11,639 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 00:40:11,639 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 00:40:11,640 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 00:40:11,640 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 00:40:11,640 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 00:40:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-10-20 00:40:11,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 00:40:11,674 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:11,675 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:11,676 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:11,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:11,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2020-10-20 00:40:11,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:40:11,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100384736] [2020-10-20 00:40:11,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:40:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:11,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:11,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100384736] [2020-10-20 00:40:11,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:11,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:40:11,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465541367] [2020-10-20 00:40:11,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:40:11,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:40:11,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:40:11,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:40:11,913 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 4 states. [2020-10-20 00:40:12,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:12,014 INFO L93 Difference]: Finished difference Result 92 states and 136 transitions. [2020-10-20 00:40:12,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:40:12,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-20 00:40:12,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:12,029 INFO L225 Difference]: With dead ends: 92 [2020-10-20 00:40:12,029 INFO L226 Difference]: Without dead ends: 50 [2020-10-20 00:40:12,033 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:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-20 00:40:12,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-10-20 00:40:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-20 00:40:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2020-10-20 00:40:12,073 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2020-10-20 00:40:12,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:12,074 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2020-10-20 00:40:12,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:40:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2020-10-20 00:40:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 00:40:12,075 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:12,075 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:12,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 00:40:12,076 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:12,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:12,076 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2020-10-20 00:40:12,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:40:12,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074613660] [2020-10-20 00:40:12,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:40:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:12,192 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:12,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074613660] [2020-10-20 00:40:12,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:12,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:40:12,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365995016] [2020-10-20 00:40:12,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:40:12,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:40:12,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:40:12,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:40:12,197 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2020-10-20 00:40:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:12,274 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2020-10-20 00:40:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:40:12,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-20 00:40:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:12,277 INFO L225 Difference]: With dead ends: 77 [2020-10-20 00:40:12,277 INFO L226 Difference]: Without dead ends: 64 [2020-10-20 00:40:12,279 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:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-20 00:40:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2020-10-20 00:40:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-20 00:40:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-20 00:40:12,289 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2020-10-20 00:40:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:12,289 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-20 00:40:12,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:40:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-20 00:40:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 00:40:12,291 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:12,291 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:12,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 00:40:12,292 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:12,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:12,292 INFO L82 PathProgramCache]: Analyzing trace with hash -674173253, now seen corresponding path program 1 times [2020-10-20 00:40:12,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:40:12,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17260976] [2020-10-20 00:40:12,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:40:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:12,357 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:12,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17260976] [2020-10-20 00:40:12,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:12,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:40:12,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770614835] [2020-10-20 00:40:12,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:40:12,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:40:12,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:40:12,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:40:12,360 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2020-10-20 00:40:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:12,414 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2020-10-20 00:40:12,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:40:12,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-20 00:40:12,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:12,417 INFO L225 Difference]: With dead ends: 79 [2020-10-20 00:40:12,417 INFO L226 Difference]: Without dead ends: 66 [2020-10-20 00:40:12,418 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:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-20 00:40:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2020-10-20 00:40:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-20 00:40:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-20 00:40:12,426 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 19 [2020-10-20 00:40:12,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:12,427 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-20 00:40:12,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:40:12,427 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-20 00:40:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 00:40:12,428 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:12,428 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:12,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 00:40:12,429 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:12,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:12,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1345927737, now seen corresponding path program 1 times [2020-10-20 00:40:12,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:40:12,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975315387] [2020-10-20 00:40:12,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:40:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:12,512 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:12,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975315387] [2020-10-20 00:40:12,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:12,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:40:12,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567198421] [2020-10-20 00:40:12,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:40:12,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:40:12,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:40:12,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:40:12,515 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2020-10-20 00:40:12,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:12,567 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2020-10-20 00:40:12,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:40:12,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-20 00:40:12,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:12,569 INFO L225 Difference]: With dead ends: 81 [2020-10-20 00:40:12,569 INFO L226 Difference]: Without dead ends: 68 [2020-10-20 00:40:12,570 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:12,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-20 00:40:12,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2020-10-20 00:40:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-20 00:40:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-20 00:40:12,579 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 20 [2020-10-20 00:40:12,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:12,579 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-20 00:40:12,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:40:12,580 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-20 00:40:12,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 00:40:12,581 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:12,581 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:12,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 00:40:12,582 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:12,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:12,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2020-10-20 00:40:12,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:40:12,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864571839] [2020-10-20 00:40:12,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:40:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:12,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:12,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864571839] [2020-10-20 00:40:12,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:12,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:40:12,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768090429] [2020-10-20 00:40:12,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:40:12,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:40:12,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:40:12,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:40:12,690 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2020-10-20 00:40:12,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:12,713 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-10-20 00:40:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:40:12,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-20 00:40:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:12,715 INFO L225 Difference]: With dead ends: 50 [2020-10-20 00:40:12,715 INFO L226 Difference]: Without dead ends: 48 [2020-10-20 00:40:12,716 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:12,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-20 00:40:12,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-10-20 00:40:12,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-20 00:40:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2020-10-20 00:40:12,735 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2020-10-20 00:40:12,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:12,737 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2020-10-20 00:40:12,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:40:12,738 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2020-10-20 00:40:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 00:40:12,740 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:12,741 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:12,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 00:40:12,741 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:12,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:12,742 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2020-10-20 00:40:12,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:40:12,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994837654] [2020-10-20 00:40:12,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:40:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 00:40:12,829 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 00:40:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 00:40:12,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 00:40:12,958 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 00:40:12,962 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 00:40:12,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 00:40:13,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 12:40:13 BoogieIcfgContainer [2020-10-20 00:40:13,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 00:40:13,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 00:40:13,010 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 00:40:13,010 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 00:40:13,011 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:11" (3/4) ... [2020-10-20 00:40:13,015 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 00:40:13,015 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 00:40:13,018 INFO L168 Benchmark]: Toolchain (without parser) took 2557.94 ms. Allocated memory was 35.7 MB in the beginning and 50.3 MB in the end (delta: 14.7 MB). Free memory was 9.2 MB in the beginning and 28.1 MB in the end (delta: -18.9 MB). There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 00:40:13,023 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 35.1 MB. Free memory was 13.8 MB in the beginning and 13.7 MB in the end (delta: 47.2 kB). Peak memory consumption was 47.2 kB. Max. memory is 14.3 GB. [2020-10-20 00:40:13,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 496.08 ms. Allocated memory was 35.7 MB in the beginning and 44.6 MB in the end (delta: 8.9 MB). Free memory was 8.3 MB in the beginning and 26.0 MB in the end (delta: -17.7 MB). Peak memory consumption was 6.8 MB. Max. memory is 14.3 GB. [2020-10-20 00:40:13,026 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.21 ms. Allocated memory is still 44.6 MB. Free memory was 25.9 MB in the beginning and 23.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. [2020-10-20 00:40:13,028 INFO L168 Benchmark]: Boogie Preprocessor took 33.72 ms. Allocated memory is still 44.6 MB. Free memory was 23.7 MB in the beginning and 21.8 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:13,029 INFO L168 Benchmark]: RCFGBuilder took 511.02 ms. Allocated memory was 44.6 MB in the beginning and 46.1 MB in the end (delta: 1.6 MB). Free memory was 21.7 MB in the beginning and 28.1 MB in the end (delta: -6.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 14.3 GB. [2020-10-20 00:40:13,032 INFO L168 Benchmark]: TraceAbstraction took 1446.39 ms. Allocated memory was 46.1 MB in the beginning and 50.3 MB in the end (delta: 4.2 MB). Free memory was 27.6 MB in the beginning and 28.6 MB in the end (delta: -996.3 kB). Peak memory consumption was 20.6 MB. Max. memory is 14.3 GB. [2020-10-20 00:40:13,035 INFO L168 Benchmark]: Witness Printer took 5.85 ms. Allocated memory is still 50.3 MB. Free memory was 28.6 MB in the beginning and 28.1 MB in the end (delta: 433.1 kB). Peak memory consumption was 433.1 kB. Max. memory is 14.3 GB. [2020-10-20 00:40:13,042 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.32 ms. Allocated memory is still 35.1 MB. Free memory was 13.8 MB in the beginning and 13.7 MB in the end (delta: 47.2 kB). Peak memory consumption was 47.2 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 496.08 ms. Allocated memory was 35.7 MB in the beginning and 44.6 MB in the end (delta: 8.9 MB). Free memory was 8.3 MB in the beginning and 26.0 MB in the end (delta: -17.7 MB). Peak memory consumption was 6.8 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 53.21 ms. Allocated memory is still 44.6 MB. Free memory was 25.9 MB in the beginning and 23.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 33.72 ms. Allocated memory is still 44.6 MB. Free memory was 23.7 MB in the beginning and 21.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * RCFGBuilder took 511.02 ms. Allocated memory was 44.6 MB in the beginning and 46.1 MB in the end (delta: 1.6 MB). Free memory was 21.7 MB in the beginning and 28.1 MB in the end (delta: -6.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 14.3 GB. * TraceAbstraction took 1446.39 ms. Allocated memory was 46.1 MB in the beginning and 50.3 MB in the end (delta: 4.2 MB). Free memory was 27.6 MB in the beginning and 28.6 MB in the end (delta: -996.3 kB). Peak memory consumption was 20.6 MB. Max. memory is 14.3 GB. * Witness Printer took 5.85 ms. Allocated memory is still 50.3 MB. Free memory was 28.6 MB in the beginning and 28.1 MB in the end (delta: 433.1 kB). Peak memory consumption was 433.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 76. Possible FailurePath: [L68] float x = __VERIFIER_nondet_float(); [L69] float y = __VERIFIER_nondet_float(); [L59] return x != x; [L70] EXPR isnan_float(x) && !isnan_float(y) [L59] return x != x; [L70] EXPR isnan_float(x) && !isnan_float(y) [L70-L71] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L70-L71] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L15] __uint32_t w; [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L25-L26] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L28-L29] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L31] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L34] return 0; [L38] COND TRUE __fpclassify_float(x) == 0 [L39] return y; [L73] float res = fmin_float(x, y); [L59] return x != x; [L76] EXPR isnan_float(x) && !isnan_float(y) [L59] return x != x; [L76] EXPR isnan_float(x) && !isnan_float(y) [L76] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L3] __assert_fail("0", "float_req_bl_1231.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.3s, 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:15,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 00:40:15,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 00:40:15,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 00:40:15,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 00:40:15,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 00:40:15,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 00:40:15,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 00:40:15,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 00:40:15,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 00:40:15,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 00:40:15,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 00:40:15,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 00:40:15,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 00:40:15,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 00:40:15,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 00:40:15,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 00:40:15,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 00:40:15,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 00:40:15,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 00:40:15,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 00:40:15,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 00:40:15,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 00:40:15,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 00:40:15,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 00:40:15,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 00:40:15,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 00:40:15,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 00:40:15,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 00:40:15,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 00:40:15,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 00:40:15,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 00:40:15,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 00:40:15,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 00:40:15,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 00:40:15,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 00:40:15,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 00:40:15,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 00:40:15,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 00:40:15,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 00:40:15,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 00:40:15,439 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:15,461 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 00:40:15,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 00:40:15,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 00:40:15,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 00:40:15,463 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 00:40:15,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 00:40:15,475 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 00:40:15,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 00:40:15,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 00:40:15,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 00:40:15,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 00:40:15,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 00:40:15,476 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-20 00:40:15,476 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-20 00:40:15,477 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 00:40:15,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 00:40:15,477 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 00:40:15,477 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 00:40:15,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 00:40:15,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 00:40:15,478 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 00:40:15,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 00:40:15,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:40:15,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 00:40:15,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 00:40:15,479 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 00:40:15,479 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-20 00:40:15,479 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-20 00:40:15,479 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 00:40:15,479 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 00:40:15,480 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-20 00:40:15,480 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 -> 8039b1e35b9e459b273890fa707790cd9b2d1812 [2020-10-20 00:40:15,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 00:40:15,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 00:40:15,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 00:40:15,719 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 00:40:15,720 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 00:40:15,721 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2020-10-20 00:40:15,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8fe8653/d74a28195f644b8fa9f33d5936f015a3/FLAGb062e2f64 [2020-10-20 00:40:16,378 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 00:40:16,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2020-10-20 00:40:16,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8fe8653/d74a28195f644b8fa9f33d5936f015a3/FLAGb062e2f64 [2020-10-20 00:40:16,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8fe8653/d74a28195f644b8fa9f33d5936f015a3 [2020-10-20 00:40:16,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 00:40:16,648 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 00:40:16,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 00:40:16,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 00:40:16,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 00:40:16,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:40:16" (1/1) ... [2020-10-20 00:40:16,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ad2f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:16, skipping insertion in model container [2020-10-20 00:40:16,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:40:16" (1/1) ... [2020-10-20 00:40:16,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 00:40:16,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 00:40:16,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:40:16,932 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 00:40:16,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:40:16,991 INFO L208 MainTranslator]: Completed translation [2020-10-20 00:40:16,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:16 WrapperNode [2020-10-20 00:40:16,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 00:40:16,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 00:40:16,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 00:40:16,993 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 00:40:17,002 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:16" (1/1) ... [2020-10-20 00:40:17,014 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:16" (1/1) ... [2020-10-20 00:40:17,047 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 00:40:17,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 00:40:17,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 00:40:17,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 00:40:17,055 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:16" (1/1) ... [2020-10-20 00:40:17,055 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:16" (1/1) ... [2020-10-20 00:40:17,060 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:16" (1/1) ... [2020-10-20 00:40:17,060 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:16" (1/1) ... [2020-10-20 00:40:17,072 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:16" (1/1) ... [2020-10-20 00:40:17,080 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:16" (1/1) ... [2020-10-20 00:40:17,084 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:16" (1/1) ... [2020-10-20 00:40:17,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 00:40:17,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 00:40:17,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 00:40:17,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 00:40:17,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:16" (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:17,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-20 00:40:17,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 00:40:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-10-20 00:40:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 00:40:17,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 00:40:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2020-10-20 00:40:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 00:40:17,685 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 00:40:17,685 INFO L298 CfgBuilder]: Removed 34 assume(true) statements. [2020-10-20 00:40:17,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:40:17 BoogieIcfgContainer [2020-10-20 00:40:17,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 00:40:17,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 00:40:17,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 00:40:17,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 00:40:17,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 12:40:16" (1/3) ... [2020-10-20 00:40:17,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc751cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:40:17, skipping insertion in model container [2020-10-20 00:40:17,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:40:16" (2/3) ... [2020-10-20 00:40:17,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc751cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:40:17, skipping insertion in model container [2020-10-20 00:40:17,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:40:17" (3/3) ... [2020-10-20 00:40:17,698 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2020-10-20 00:40:17,710 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 00:40:17,718 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 00:40:17,733 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-20 00:40:17,762 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 00:40:17,762 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 00:40:17,762 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 00:40:17,762 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 00:40:17,763 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 00:40:17,763 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 00:40:17,763 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 00:40:17,764 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 00:40:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-10-20 00:40:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 00:40:17,795 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:17,796 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:17,796 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:17,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:17,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2020-10-20 00:40:17,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:17,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821081717] [2020-10-20 00:40:17,820 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:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:17,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-20 00:40:17,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:17,949 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:17,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:17,956 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:17,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821081717] [2020-10-20 00:40:17,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:17,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-20 00:40:17,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589831770] [2020-10-20 00:40:17,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-20 00:40:17,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:17,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 00:40:17,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:40:17,982 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2020-10-20 00:40:18,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:18,004 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2020-10-20 00:40:18,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 00:40:18,005 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-10-20 00:40:18,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:18,017 INFO L225 Difference]: With dead ends: 84 [2020-10-20 00:40:18,017 INFO L226 Difference]: Without dead ends: 43 [2020-10-20 00:40:18,021 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:18,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-20 00:40:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-20 00:40:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-20 00:40:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2020-10-20 00:40:18,071 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2020-10-20 00:40:18,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:18,071 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-10-20 00:40:18,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-20 00:40:18,071 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2020-10-20 00:40:18,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 00:40:18,072 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:18,073 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:18,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-20 00:40:18,281 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:18,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:18,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2020-10-20 00:40:18,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:18,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982888508] [2020-10-20 00:40:18,288 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:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:18,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 00:40:18,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:18,397 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:18,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:18,402 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:18,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982888508] [2020-10-20 00:40:18,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:18,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-20 00:40:18,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473627626] [2020-10-20 00:40:18,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:40:18,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:18,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:40:18,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:40:18,407 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2020-10-20 00:40:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:18,476 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2020-10-20 00:40:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:40:18,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-20 00:40:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:18,478 INFO L225 Difference]: With dead ends: 82 [2020-10-20 00:40:18,479 INFO L226 Difference]: Without dead ends: 50 [2020-10-20 00:40:18,480 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:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-20 00:40:18,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-10-20 00:40:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-20 00:40:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2020-10-20 00:40:18,501 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2020-10-20 00:40:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:18,502 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2020-10-20 00:40:18,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:40:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2020-10-20 00:40:18,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 00:40:18,503 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:18,503 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:18,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-20 00:40:18,710 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:18,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:18,710 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2020-10-20 00:40:18,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:18,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106896046] [2020-10-20 00:40:18,711 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:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:18,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 00:40:18,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:18,820 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:18,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:18,844 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:18,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106896046] [2020-10-20 00:40:18,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:18,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-20 00:40:18,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283839029] [2020-10-20 00:40:18,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 00:40:18,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:18,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 00:40:18,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 00:40:18,847 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2020-10-20 00:40:18,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:18,967 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2020-10-20 00:40:18,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 00:40:18,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-20 00:40:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:18,971 INFO L225 Difference]: With dead ends: 96 [2020-10-20 00:40:18,971 INFO L226 Difference]: Without dead ends: 83 [2020-10-20 00:40:18,972 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:18,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-20 00:40:18,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2020-10-20 00:40:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-20 00:40:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-20 00:40:18,991 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2020-10-20 00:40:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:18,992 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-20 00:40:18,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 00:40:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-20 00:40:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 00:40:18,996 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:18,996 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:19,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-20 00:40:19,212 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:19,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:19,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2020-10-20 00:40:19,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:19,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851946787] [2020-10-20 00:40:19,214 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:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:19,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 00:40:19,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:19,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:19,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:19,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:19,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:19,556 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:19,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851946787] [2020-10-20 00:40:19,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:19,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2020-10-20 00:40:19,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224048323] [2020-10-20 00:40:19,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 00:40:19,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:19,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 00:40:19,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-20 00:40:19,559 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2020-10-20 00:40:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:20,055 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2020-10-20 00:40:20,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 00:40:20,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-10-20 00:40:20,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:20,058 INFO L225 Difference]: With dead ends: 149 [2020-10-20 00:40:20,058 INFO L226 Difference]: Without dead ends: 140 [2020-10-20 00:40:20,059 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:20,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-10-20 00:40:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 75. [2020-10-20 00:40:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-20 00:40:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2020-10-20 00:40:20,072 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2020-10-20 00:40:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:20,072 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2020-10-20 00:40:20,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 00:40:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2020-10-20 00:40:20,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 00:40:20,074 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:20,074 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:20,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-20 00:40:20,294 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:20,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:20,295 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2020-10-20 00:40:20,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:20,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192636192] [2020-10-20 00:40:20,296 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:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:20,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 00:40:20,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:20,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:20,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:20,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:20,606 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:20,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:20,737 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:20,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192636192] [2020-10-20 00:40:20,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:20,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2020-10-20 00:40:20,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754887172] [2020-10-20 00:40:20,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-20 00:40:20,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:20,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 00:40:20,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-10-20 00:40:20,740 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2020-10-20 00:40:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:22,249 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2020-10-20 00:40:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-20 00:40:22,250 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-10-20 00:40:22,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:22,253 INFO L225 Difference]: With dead ends: 180 [2020-10-20 00:40:22,253 INFO L226 Difference]: Without dead ends: 178 [2020-10-20 00:40:22,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2020-10-20 00:40:22,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-10-20 00:40:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2020-10-20 00:40:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-20 00:40:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2020-10-20 00:40:22,276 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2020-10-20 00:40:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:22,276 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2020-10-20 00:40:22,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-20 00:40:22,277 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2020-10-20 00:40:22,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 00:40:22,281 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:22,281 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:22,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-20 00:40:22,485 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:22,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:22,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2020-10-20 00:40:22,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:22,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487201979] [2020-10-20 00:40:22,487 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:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:22,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 00:40:22,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:22,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:22,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:22,636 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:22,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:22,644 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-20 00:40:22,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:40:22,689 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:22,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487201979] [2020-10-20 00:40:22,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:22,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2020-10-20 00:40:22,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174315575] [2020-10-20 00:40:22,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 00:40:22,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:22,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 00:40:22,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-20 00:40:22,692 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2020-10-20 00:40:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:23,355 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2020-10-20 00:40:23,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 00:40:23,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-20 00:40:23,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:23,357 INFO L225 Difference]: With dead ends: 166 [2020-10-20 00:40:23,358 INFO L226 Difference]: Without dead ends: 131 [2020-10-20 00:40:23,359 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:23,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-20 00:40:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2020-10-20 00:40:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-20 00:40:23,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2020-10-20 00:40:23,379 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2020-10-20 00:40:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:23,380 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2020-10-20 00:40:23,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 00:40:23,380 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2020-10-20 00:40:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 00:40:23,381 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:23,384 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:23,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-20 00:40:23,586 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:23,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:23,587 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2020-10-20 00:40:23,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:23,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820059090] [2020-10-20 00:40:23,588 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:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:23,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 00:40:23,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:23,702 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:23,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:23,720 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:23,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820059090] [2020-10-20 00:40:23,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:23,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-20 00:40:23,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528212187] [2020-10-20 00:40:23,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 00:40:23,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:23,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 00:40:23,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 00:40:23,726 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2020-10-20 00:40:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:23,820 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2020-10-20 00:40:23,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 00:40:23,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-20 00:40:23,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:23,821 INFO L225 Difference]: With dead ends: 157 [2020-10-20 00:40:23,822 INFO L226 Difference]: Without dead ends: 141 [2020-10-20 00:40:23,824 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:23,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-10-20 00:40:23,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2020-10-20 00:40:23,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-20 00:40:23,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2020-10-20 00:40:23,835 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2020-10-20 00:40:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:23,836 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2020-10-20 00:40:23,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 00:40:23,836 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2020-10-20 00:40:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 00:40:23,837 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:23,837 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:24,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-20 00:40:24,043 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:24,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:24,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2020-10-20 00:40:24,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:24,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707347452] [2020-10-20 00:40:24,045 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:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:24,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 00:40:24,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:24,114 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:24,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:24,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:24,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707347452] [2020-10-20 00:40:24,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:24,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-20 00:40:24,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231002457] [2020-10-20 00:40:24,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:40:24,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:24,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:40:24,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:40:24,119 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2020-10-20 00:40:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:26,244 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2020-10-20 00:40:26,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:40:26,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-20 00:40:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:26,245 INFO L225 Difference]: With dead ends: 96 [2020-10-20 00:40:26,245 INFO L226 Difference]: Without dead ends: 94 [2020-10-20 00:40:26,246 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:26,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-20 00:40:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2020-10-20 00:40:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-20 00:40:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2020-10-20 00:40:26,256 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2020-10-20 00:40:26,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:26,256 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2020-10-20 00:40:26,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:40:26,256 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2020-10-20 00:40:26,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 00:40:26,258 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:26,258 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:26,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-20 00:40:26,472 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:26,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:26,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1743883267, now seen corresponding path program 1 times [2020-10-20 00:40:26,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:26,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960933353] [2020-10-20 00:40:26,474 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:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:26,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 00:40:26,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:26,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:26,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:26,624 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,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:26,675 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,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960933353] [2020-10-20 00:40:26,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:26,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2020-10-20 00:40:26,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462557060] [2020-10-20 00:40:26,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 00:40:26,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:26,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 00:40:26,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-20 00:40:26,678 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2020-10-20 00:40:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:27,043 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2020-10-20 00:40:27,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 00:40:27,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-10-20 00:40:27,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:27,045 INFO L225 Difference]: With dead ends: 131 [2020-10-20 00:40:27,046 INFO L226 Difference]: Without dead ends: 118 [2020-10-20 00:40:27,046 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:27,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-20 00:40:27,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2020-10-20 00:40:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-20 00:40:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2020-10-20 00:40:27,054 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2020-10-20 00:40:27,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:27,054 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2020-10-20 00:40:27,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 00:40:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2020-10-20 00:40:27,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 00:40:27,055 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:27,056 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:27,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-20 00:40:27,263 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:27,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:27,264 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2020-10-20 00:40:27,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:27,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989199550] [2020-10-20 00:40:27,265 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:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:27,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 00:40:27,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:27,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:27,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:27,416 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,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:27,474 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,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989199550] [2020-10-20 00:40:27,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:27,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2020-10-20 00:40:27,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348626027] [2020-10-20 00:40:27,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 00:40:27,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:27,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 00:40:27,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-20 00:40:27,477 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2020-10-20 00:40:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:29,984 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2020-10-20 00:40:29,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 00:40:29,985 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-10-20 00:40:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:29,986 INFO L225 Difference]: With dead ends: 114 [2020-10-20 00:40:29,986 INFO L226 Difference]: Without dead ends: 78 [2020-10-20 00:40:29,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2020-10-20 00:40:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-20 00:40:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2020-10-20 00:40:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-20 00:40:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2020-10-20 00:40:29,993 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2020-10-20 00:40:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:29,993 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2020-10-20 00:40:29,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 00:40:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2020-10-20 00:40:29,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 00:40:29,994 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:29,995 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:30,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-10-20 00:40:30,205 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:30,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:30,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2020-10-20 00:40:30,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:30,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116329740] [2020-10-20 00:40:30,207 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:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:30,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 00:40:30,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:30,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:30,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:30,344 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:30,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:30,351 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-20 00:40:30,351 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:40:30,387 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:30,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116329740] [2020-10-20 00:40:30,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:30,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2020-10-20 00:40:30,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639016058] [2020-10-20 00:40:30,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 00:40:30,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:30,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 00:40:30,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-20 00:40:30,389 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2020-10-20 00:40:30,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:30,743 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-10-20 00:40:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 00:40:30,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-20 00:40:30,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:30,745 INFO L225 Difference]: With dead ends: 84 [2020-10-20 00:40:30,745 INFO L226 Difference]: Without dead ends: 74 [2020-10-20 00:40:30,746 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:30,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-20 00:40:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-20 00:40:30,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-20 00:40:30,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2020-10-20 00:40:30,752 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2020-10-20 00:40:30,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:30,752 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2020-10-20 00:40:30,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 00:40:30,752 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2020-10-20 00:40:30,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 00:40:30,753 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:30,753 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:30,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-10-20 00:40:30,959 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:30,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:30,959 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2020-10-20 00:40:30,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:30,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342766518] [2020-10-20 00:40:30,961 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:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:31,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 00:40:31,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:31,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:31,105 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:31,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:31,491 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:31,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342766518] [2020-10-20 00:40:31,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:31,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-10-20 00:40:31,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203442502] [2020-10-20 00:40:31,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 00:40:31,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:31,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 00:40:31,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-20 00:40:31,493 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2020-10-20 00:40:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:31,814 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2020-10-20 00:40:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 00:40:31,815 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-10-20 00:40:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:31,815 INFO L225 Difference]: With dead ends: 82 [2020-10-20 00:40:31,815 INFO L226 Difference]: Without dead ends: 74 [2020-10-20 00:40:31,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-10-20 00:40:31,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-20 00:40:31,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-20 00:40:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-20 00:40:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2020-10-20 00:40:31,821 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2020-10-20 00:40:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:31,822 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2020-10-20 00:40:31,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 00:40:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2020-10-20 00:40:31,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 00:40:31,823 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:31,823 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:32,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-10-20 00:40:32,034 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:32,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:32,035 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2020-10-20 00:40:32,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:32,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845123525] [2020-10-20 00:40:32,036 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:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:32,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 00:40:32,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:32,244 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-10-20 00:40:32,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:32,426 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,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:32,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:40:32,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845123525] [2020-10-20 00:40:32,568 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 32) [2020-10-20 00:40:32,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2005279312] [2020-10-20 00:40:32,569 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:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:32,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 00:40:32,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:33,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:33,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:33,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:33,287 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,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:33,420 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,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:33,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2020-10-20 00:40:33,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071507869] [2020-10-20 00:40:33,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-20 00:40:33,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:33,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-20 00:40:33,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2020-10-20 00:40:33,423 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2020-10-20 00:40:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:34,528 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2020-10-20 00:40:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 00:40:34,529 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2020-10-20 00:40:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:34,530 INFO L225 Difference]: With dead ends: 81 [2020-10-20 00:40:34,530 INFO L226 Difference]: Without dead ends: 70 [2020-10-20 00:40:34,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=231, Invalid=891, Unknown=0, NotChecked=0, Total=1122 [2020-10-20 00:40:34,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-20 00:40:34,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-20 00:40:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-20 00:40:34,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2020-10-20 00:40:34,537 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 26 [2020-10-20 00:40:34,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:34,537 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2020-10-20 00:40:34,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-20 00:40:34,537 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2020-10-20 00:40:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-20 00:40:34,538 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:34,538 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:34,949 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:34,950 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:34,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:34,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2020-10-20 00:40:34,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:34,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315253425] [2020-10-20 00:40:34,952 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:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:35,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-20 00:40:35,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:35,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:35,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:35,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:35,372 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2020-10-20 00:40:35,381 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:35,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:35,591 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:35,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315253425] [2020-10-20 00:40:35,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:35,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2020-10-20 00:40:35,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613586218] [2020-10-20 00:40:35,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-20 00:40:35,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:35,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 00:40:35,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-10-20 00:40:35,593 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 15 states. [2020-10-20 00:40:37,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:37,894 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2020-10-20 00:40:37,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-10-20 00:40:37,894 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-10-20 00:40:37,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:37,895 INFO L225 Difference]: With dead ends: 193 [2020-10-20 00:40:37,895 INFO L226 Difference]: Without dead ends: 158 [2020-10-20 00:40:37,897 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:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-20 00:40:37,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2020-10-20 00:40:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-20 00:40:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2020-10-20 00:40:37,902 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2020-10-20 00:40:37,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:37,902 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2020-10-20 00:40:37,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-20 00:40:37,902 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2020-10-20 00:40:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-20 00:40:37,902 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:37,902 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:38,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-10-20 00:40:38,103 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:38,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:38,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1423958792, now seen corresponding path program 1 times [2020-10-20 00:40:38,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:38,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617184188] [2020-10-20 00:40:38,105 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:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:38,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-20 00:40:38,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:38,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:38,427 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,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:38,582 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,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617184188] [2020-10-20 00:40:38,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:38,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2020-10-20 00:40:38,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713385142] [2020-10-20 00:40:38,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 00:40:38,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:38,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 00:40:38,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-20 00:40:38,585 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 12 states. [2020-10-20 00:40:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:39,600 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2020-10-20 00:40:39,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-20 00:40:39,601 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-10-20 00:40:39,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:39,602 INFO L225 Difference]: With dead ends: 125 [2020-10-20 00:40:39,602 INFO L226 Difference]: Without dead ends: 101 [2020-10-20 00:40:39,603 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:39,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-20 00:40:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2020-10-20 00:40:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-20 00:40:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-10-20 00:40:39,608 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2020-10-20 00:40:39,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:39,609 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-10-20 00:40:39,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 00:40:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-10-20 00:40:39,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-20 00:40:39,610 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:39,610 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:39,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-10-20 00:40:39,811 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:39,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:39,811 INFO L82 PathProgramCache]: Analyzing trace with hash 489956430, now seen corresponding path program 1 times [2020-10-20 00:40:39,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:39,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327192341] [2020-10-20 00:40:39,813 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:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:39,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 00:40:39,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:39,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:39,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:39,961 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,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:40,198 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,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327192341] [2020-10-20 00:40:40,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:40,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-10-20 00:40:40,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196593900] [2020-10-20 00:40:40,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 00:40:40,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:40,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 00:40:40,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-20 00:40:40,201 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2020-10-20 00:40:40,594 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-10-20 00:40:40,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:40,784 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-10-20 00:40:40,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 00:40:40,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2020-10-20 00:40:40,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:40,785 INFO L225 Difference]: With dead ends: 52 [2020-10-20 00:40:40,785 INFO L226 Difference]: Without dead ends: 41 [2020-10-20 00:40:40,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-10-20 00:40:40,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-20 00:40:40,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-10-20 00:40:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-20 00:40:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2020-10-20 00:40:40,791 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2020-10-20 00:40:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:40,796 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2020-10-20 00:40:40,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 00:40:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-10-20 00:40:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-20 00:40:40,798 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:40,798 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:41,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-10-20 00:40:41,007 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:41,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:41,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1191021008, now seen corresponding path program 1 times [2020-10-20 00:40:41,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:41,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841156939] [2020-10-20 00:40:41,009 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:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:41,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-20 00:40:41,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:41,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:41,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:41,199 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,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:41,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:40:41,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841156939] [2020-10-20 00:40:41,220 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 32) [2020-10-20 00:40:41,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2104470275] [2020-10-20 00:40:41,220 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:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:41,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 00:40:41,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:41,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:41,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:41,742 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,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:41,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:40:41,904 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,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:41,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2020-10-20 00:40:41,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583636081] [2020-10-20 00:40:41,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 00:40:41,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:41,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 00:40:41,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-10-20 00:40:41,907 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2020-10-20 00:40:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:42,623 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-10-20 00:40:42,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 00:40:42,624 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2020-10-20 00:40:42,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:42,625 INFO L225 Difference]: With dead ends: 55 [2020-10-20 00:40:42,625 INFO L226 Difference]: Without dead ends: 41 [2020-10-20 00:40:42,626 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:42,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-20 00:40:42,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2020-10-20 00:40:42,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-20 00:40:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-10-20 00:40:42,631 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2020-10-20 00:40:42,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:42,631 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-10-20 00:40:42,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 00:40:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-10-20 00:40:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-20 00:40:42,632 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:42,633 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:43,041 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:43,041 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:43,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:43,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1654102483, now seen corresponding path program 1 times [2020-10-20 00:40:43,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:43,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036066144] [2020-10-20 00:40:43,043 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:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:43,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 00:40:43,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:43,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:40:43,215 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:43,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:43,309 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:40:43,360 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:43,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036066144] [2020-10-20 00:40:43,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:43,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2020-10-20 00:40:43,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99500667] [2020-10-20 00:40:43,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 00:40:43,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:43,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 00:40:43,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-20 00:40:43,362 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2020-10-20 00:40:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:43,824 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2020-10-20 00:40:43,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 00:40:43,825 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2020-10-20 00:40:43,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:43,826 INFO L225 Difference]: With dead ends: 79 [2020-10-20 00:40:43,826 INFO L226 Difference]: Without dead ends: 61 [2020-10-20 00:40:43,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2020-10-20 00:40:43,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-20 00:40:43,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2020-10-20 00:40:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-20 00:40:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-10-20 00:40:43,834 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2020-10-20 00:40:43,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:43,834 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-10-20 00:40:43,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 00:40:43,835 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-10-20 00:40:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 00:40:43,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:40:43,836 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:44,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2020-10-20 00:40:44,048 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:40:44,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:40:44,048 INFO L82 PathProgramCache]: Analyzing trace with hash 798574185, now seen corresponding path program 1 times [2020-10-20 00:40:44,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:40:44,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800478728] [2020-10-20 00:40:44,049 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:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:40:44,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 00:40:44,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:40:44,151 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,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:40:44,153 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,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800478728] [2020-10-20 00:40:44,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:40:44,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-20 00:40:44,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524292736] [2020-10-20 00:40:44,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:40:44,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:40:44,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:40:44,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:40:44,157 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2020-10-20 00:40:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:40:44,181 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-10-20 00:40:44,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:40:44,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-20 00:40:44,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:40:44,181 INFO L225 Difference]: With dead ends: 39 [2020-10-20 00:40:44,181 INFO L226 Difference]: Without dead ends: 0 [2020-10-20 00:40:44,182 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:44,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-20 00:40:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-20 00:40:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-20 00:40:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 00:40:44,183 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2020-10-20 00:40:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:40:44,183 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 00:40:44,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:40:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-20 00:40:44,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-20 00:40:44,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2020-10-20 00:40:44,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-20 00:40:44,669 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 102 [2020-10-20 00:40:45,315 WARN L193 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2020-10-20 00:40:45,995 WARN L193 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 45 [2020-10-20 00:40:46,676 WARN L193 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 41 [2020-10-20 00:40:47,118 WARN L193 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 40 [2020-10-20 00:40:47,487 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2020-10-20 00:40:47,927 WARN L193 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-10-20 00:40:48,348 WARN L193 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2020-10-20 00:40:49,760 WARN L193 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 108 DAG size of output: 48 [2020-10-20 00:40:49,813 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-20 00:40:49,813 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-20 00:40:49,813 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-10-20 00:40:49,814 INFO L274 CegarLoopResult]: For program point L3-2(line 3) no Hoare annotation was computed. [2020-10-20 00:40:49,814 INFO L274 CegarLoopResult]: For program point L3-3(line 3) no Hoare annotation was computed. [2020-10-20 00:40:49,814 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-20 00:40:49,814 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-20 00:40:49,814 INFO L274 CegarLoopResult]: For program point L28(lines 28 34) no Hoare annotation was computed. [2020-10-20 00:40:49,814 INFO L274 CegarLoopResult]: For program point L28-1(lines 28 34) no Hoare annotation was computed. [2020-10-20 00:40:49,814 INFO L274 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2020-10-20 00:40:49,815 INFO L274 CegarLoopResult]: For program point L70-2(line 70) no Hoare annotation was computed. [2020-10-20 00:40:49,815 INFO L274 CegarLoopResult]: For program point L70-3(lines 70 71) no Hoare annotation was computed. [2020-10-20 00:40:49,815 INFO L274 CegarLoopResult]: For program point L70-5(lines 70 86) no Hoare annotation was computed. [2020-10-20 00:40:49,815 INFO L274 CegarLoopResult]: For program point L70-7(lines 70 86) no Hoare annotation was computed. [2020-10-20 00:40:49,815 INFO L274 CegarLoopResult]: For program point L71(line 71) no Hoare annotation was computed. [2020-10-20 00:40:49,815 INFO L274 CegarLoopResult]: For program point L38(lines 38 39) no Hoare annotation was computed. [2020-10-20 00:40:49,815 INFO L274 CegarLoopResult]: For program point L71-2(line 71) no Hoare annotation was computed. [2020-10-20 00:40:49,815 INFO L277 CegarLoopResult]: At program point L88(lines 61 89) the Hoare annotation is: true [2020-10-20 00:40:49,815 INFO L274 CegarLoopResult]: For program point L31(lines 31 34) no Hoare annotation was computed. [2020-10-20 00:40:49,815 INFO L274 CegarLoopResult]: For program point L31-1(lines 31 34) no Hoare annotation was computed. [2020-10-20 00:40:49,816 INFO L274 CegarLoopResult]: For program point L40(lines 40 41) no Hoare annotation was computed. [2020-10-20 00:40:49,816 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-20 00:40:49,816 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-20 00:40:49,816 INFO L274 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2020-10-20 00:40:49,816 INFO L274 CegarLoopResult]: For program point L82-2(lines 82 85) no Hoare annotation was computed. [2020-10-20 00:40:49,816 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-20 00:40:49,817 INFO L274 CegarLoopResult]: For program point L25(lines 25 34) no Hoare annotation was computed. [2020-10-20 00:40:49,817 INFO L274 CegarLoopResult]: For program point L25-1(lines 25 34) no Hoare annotation was computed. [2020-10-20 00:40:49,817 INFO L274 CegarLoopResult]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2020-10-20 00:40:49,817 INFO L270 CegarLoopResult]: At program point L17-2(lines 17 21) 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 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (not .cse2)) (let ((.cse3 (forall ((ULTIMATE.start_fmin_float_~x (_ FloatingPoint 8 24))) (not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~y~0))))) (and (or (not |ULTIMATE.start_main_#t~short21|) .cse3) (or (and .cse0 .cse1) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse1))) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (or (not |ULTIMATE.start_main_#t~short22|) .cse3) .cse2 (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x))))) [2020-10-20 00:40:49,817 INFO L274 CegarLoopResult]: For program point L17-3(lines 14 35) no Hoare annotation was computed. [2020-10-20 00:40:49,817 INFO L274 CegarLoopResult]: For program point L17-5(lines 17 21) no Hoare annotation was computed. [2020-10-20 00:40:49,817 INFO L270 CegarLoopResult]: At program point L17-6(lines 17 21) 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 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) .cse0 .cse1 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse2 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (let ((.cse3 (forall ((ULTIMATE.start_fmin_float_~x (_ FloatingPoint 8 24))) (not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~y~0))))) (and (or (not |ULTIMATE.start_main_#t~short21|) .cse3) (not .cse1) (or (and .cse0 .cse2) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse2))) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (or (not |ULTIMATE.start_main_#t~short22|) .cse3) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)))))) [2020-10-20 00:40:49,817 INFO L274 CegarLoopResult]: For program point L17-7(lines 14 35) no Hoare annotation was computed. [2020-10-20 00:40:49,818 INFO L270 CegarLoopResult]: At program point L34(lines 14 35) 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 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (let ((.cse3 (forall ((ULTIMATE.start_fmin_float_~x (_ FloatingPoint 8 24))) (not (fp.lt ULTIMATE.start_fmin_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_fmin_float_~x .cse2) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (or (not |ULTIMATE.start_main_#t~short21|) .cse3) (or (and .cse0 .cse1) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse1))) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (or (not |ULTIMATE.start_main_#t~short22|) .cse3) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x) (fp.eq .cse2 .cse2))))) [2020-10-20 00:40:49,818 INFO L270 CegarLoopResult]: At program point L34-1(lines 14 35) 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_fmin_float_~x (_ FloatingPoint 8 24))) (not (fp.lt ULTIMATE.start_fmin_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~short21|) .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_fmin_float_~x ULTIMATE.start_main_~x~0) (or (not |ULTIMATE.start_main_#t~short22|) .cse1) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) .cse4)) (and (not .cse4) (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) .cse2 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse3 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))))) [2020-10-20 00:40:49,818 INFO L270 CegarLoopResult]: At program point L59(line 59) 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:40:49,818 INFO L270 CegarLoopResult]: At program point L59-1(line 59) the Hoare annotation is: (and (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)))) |ULTIMATE.start_main_#t~short18| (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2020-10-20 00:40:49,818 INFO L270 CegarLoopResult]: At program point L59-2(line 59) the Hoare annotation is: (let ((.cse0 (not |ULTIMATE.start_main_#t~short18|)) (.cse2 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (.cse1 (not |ULTIMATE.start_main_#t~short22|))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse0 .cse1 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not .cse2)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0 .cse2 .cse1))) [2020-10-20 00:40:49,818 INFO L270 CegarLoopResult]: At program point L59-3(line 59) the Hoare annotation is: (and (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 |ULTIMATE.start_main_#t~short18|) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (not |ULTIMATE.start_main_#t~short22|) |ULTIMATE.start_main_#t~short21|) [2020-10-20 00:40:49,819 INFO L270 CegarLoopResult]: At program point L59-4(line 59) the Hoare annotation is: (or (let ((.cse1 (forall ((ULTIMATE.start_fmin_float_~x (_ FloatingPoint 8 24))) (not (fp.lt ULTIMATE.start_fmin_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))) (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (or (not |ULTIMATE.start_main_#t~short21|) .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_fmin_float_~x ULTIMATE.start_main_~x~0) (or (not |ULTIMATE.start_main_#t~short22|) .cse1) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)))) (and (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) [2020-10-20 00:40:49,819 INFO L270 CegarLoopResult]: At program point L59-5(line 59) the Hoare annotation is: (and (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) |ULTIMATE.start_main_#t~short26| (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2020-10-20 00:40:49,819 INFO L270 CegarLoopResult]: At program point L59-6(line 59) 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_fmin_float_~x (_ FloatingPoint 8 24))) (not (fp.lt ULTIMATE.start_fmin_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))) (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (or (not |ULTIMATE.start_main_#t~short21|) .cse1) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (or (not |ULTIMATE.start_main_#t~short22|) .cse1) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))))) [2020-10-20 00:40:49,819 INFO L270 CegarLoopResult]: At program point L59-7(line 59) the Hoare annotation is: (let ((.cse1 (forall ((ULTIMATE.start_fmin_float_~x (_ FloatingPoint 8 24))) (not (fp.lt ULTIMATE.start_fmin_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))) (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (or (not |ULTIMATE.start_main_#t~short21|) .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_fmin_float_~x ULTIMATE.start_main_~x~0) (or (not |ULTIMATE.start_main_#t~short22|) .cse1) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)))) [2020-10-20 00:40:49,819 INFO L274 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2020-10-20 00:40:49,820 INFO L274 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2020-10-20 00:40:49,820 INFO L274 CegarLoopResult]: For program point L76-2(lines 76 79) no Hoare annotation was computed. [2020-10-20 00:40:49,820 INFO L274 CegarLoopResult]: For program point L43-2(line 43) no Hoare annotation was computed. [2020-10-20 00:40:49,820 INFO L270 CegarLoopResult]: At program point L43-3(lines 37 44) 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_fmin_float_~x (_ FloatingPoint 8 24))) (not (fp.lt ULTIMATE.start_fmin_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))) (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (or (not |ULTIMATE.start_main_#t~short21|) .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_fmin_float_~x ULTIMATE.start_main_~x~0) (or (not |ULTIMATE.start_main_#t~short22|) .cse1) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)))) (and (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) (= ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) .cse2 .cse3 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))))) [2020-10-20 00:40:49,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,829 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,850 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 12:40:49 BoogieIcfgContainer [2020-10-20 00:40:49,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 00:40:49,867 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 00:40:49,867 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 00:40:49,867 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 00:40:49,868 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:17" (3/4) ... [2020-10-20 00:40:49,872 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-20 00:40:49,887 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2020-10-20 00:40:49,888 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-20 00:40:49,888 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-10-20 00:40:49,889 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 00:40:49,919 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:40:49,920 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y))) && aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x) [2020-10-20 00:40:49,920 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1bv32 == \result && !aux-isnan_float(x) && !isnan_float(y)-aux) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || (((0bv32 == \result && !aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(x, x)) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) [2020-10-20 00:40:49,921 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y))) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ~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 [2020-10-20 00:40:49,921 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || (((((((!aux-!isnan_float(x) && isnan_float(y)-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y))) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && x == x) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(y, y)) && x == x) [2020-10-20 00:40:49,922 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || ((((((((x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && !(0bv32 == \result)) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && x == x) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && !~fp.eq~FLOAT(y, y)) && 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:40:49,922 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])) && ~fp.eq~FLOAT(\result, x)) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_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(x, x)) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && !~fp.eq~FLOAT(y, y)) || ((((y == \result && y == y) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) [2020-10-20 00:40:49,922 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == y && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || ((((((!aux-!isnan_float(x) && isnan_float(y)-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_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(x, x)) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && !~fp.eq~FLOAT(y, y)) [2020-10-20 00:40:49,923 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])) && ~fp.eq~FLOAT(\result, x)) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(y, y)) || (((((y == \result && y == res) && y == y) && 1bv32 == \result) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) [2020-10-20 00:40:49,923 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)-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_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(x, x)) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && !~fp.eq~FLOAT(y, y)) && 0bv32 == \result) || (((((!(0bv32 == \result) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) [2020-10-20 00:40:49,924 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == \result && y == res) && y == y) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x) [2020-10-20 00:40:49,924 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])) && ~fp.eq~FLOAT(\result, x)) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(y, y)) [2020-10-20 00:40:49,925 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])) && ~fp.eq~FLOAT(\result, x)) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_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(x, x)) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(y, y) [2020-10-20 00:40:49,964 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 00:40:49,964 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 00:40:49,966 INFO L168 Benchmark]: Toolchain (without parser) took 33323.28 ms. Allocated memory was 44.0 MB in the beginning and 79.2 MB in the end (delta: 35.1 MB). Free memory was 26.1 MB in the beginning and 36.4 MB in the end (delta: -10.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 14.3 GB. [2020-10-20 00:40:49,966 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 33.6 MB. Free memory was 13.1 MB in the beginning and 13.1 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:40:49,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.02 ms. Allocated memory was 44.0 MB in the beginning and 44.6 MB in the end (delta: 524.3 kB). Free memory was 25.3 MB in the beginning and 25.6 MB in the end (delta: -288.7 kB). Peak memory consumption was 16.1 MB. Max. memory is 14.3 GB. [2020-10-20 00:40:49,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.45 ms. Allocated memory is still 44.6 MB. Free memory was 25.6 MB in the beginning and 23.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. [2020-10-20 00:40:49,967 INFO L168 Benchmark]: Boogie Preprocessor took 44.23 ms. Allocated memory is still 44.6 MB. Free memory was 23.3 MB in the beginning and 21.3 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:40:49,968 INFO L168 Benchmark]: RCFGBuilder took 589.79 ms. Allocated memory was 44.6 MB in the beginning and 46.1 MB in the end (delta: 1.6 MB). Free memory was 21.2 MB in the beginning and 14.2 MB in the end (delta: 7.0 MB). Peak memory consumption was 11.7 MB. Max. memory is 14.3 GB. [2020-10-20 00:40:49,968 INFO L168 Benchmark]: TraceAbstraction took 32177.06 ms. Allocated memory was 46.1 MB in the beginning and 79.2 MB in the end (delta: 33.0 MB). Free memory was 13.7 MB in the beginning and 44.3 MB in the end (delta: -30.6 MB). Peak memory consumption was 41.9 MB. Max. memory is 14.3 GB. [2020-10-20 00:40:49,969 INFO L168 Benchmark]: Witness Printer took 97.74 ms. Allocated memory is still 79.2 MB. Free memory was 44.3 MB in the beginning and 36.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 14.3 GB. [2020-10-20 00:40:49,972 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 33.6 MB. Free memory was 13.1 MB in the beginning and 13.1 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 343.02 ms. Allocated memory was 44.0 MB in the beginning and 44.6 MB in the end (delta: 524.3 kB). Free memory was 25.3 MB in the beginning and 25.6 MB in the end (delta: -288.7 kB). Peak memory consumption was 16.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 54.45 ms. Allocated memory is still 44.6 MB. Free memory was 25.6 MB in the beginning and 23.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 44.23 ms. Allocated memory is still 44.6 MB. Free memory was 23.3 MB in the beginning and 21.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 14.3 GB. * RCFGBuilder took 589.79 ms. Allocated memory was 44.6 MB in the beginning and 46.1 MB in the end (delta: 1.6 MB). Free memory was 21.2 MB in the beginning and 14.2 MB in the end (delta: 7.0 MB). Peak memory consumption was 11.7 MB. Max. memory is 14.3 GB. * TraceAbstraction took 32177.06 ms. Allocated memory was 46.1 MB in the beginning and 79.2 MB in the end (delta: 33.0 MB). Free memory was 13.7 MB in the beginning and 44.3 MB in the end (delta: -30.6 MB). Peak memory consumption was 41.9 MB. Max. memory is 14.3 GB. * Witness Printer took 97.74 ms. Allocated memory is still 79.2 MB. Free memory was 44.3 MB in the beginning and 36.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 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_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_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: 17]: Loop Invariant [2020-10-20 00:40:49,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] Derived loop invariant: ((((y == y && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || (((((((!aux-!isnan_float(x) && isnan_float(y)-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y))) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && x == x) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(y, y)) && x == x) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y))) && aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (0bv32 == \result && ~fp.eq~FLOAT(x, x)) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 37]: Loop Invariant [2020-10-20 00:40:49,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_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])) && ~fp.eq~FLOAT(\result, x)) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_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(x, x)) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && !~fp.eq~FLOAT(y, y)) || ((((y == \result && y == y) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 59]: Loop Invariant [2020-10-20 00:40:49,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,990 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_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])) && ~fp.eq~FLOAT(\result, x)) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_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(x, x)) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(y, y) - InvariantResult [Line: 59]: Loop Invariant [2020-10-20 00:40:49,991 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,991 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,991 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,992 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_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])) && ~fp.eq~FLOAT(\result, x)) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(y, y)) - InvariantResult [Line: 17]: Loop Invariant [2020-10-20 00:40:49,992 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] Derived loop invariant: (((((y == y && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || ((((((!aux-!isnan_float(x) && isnan_float(y)-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_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(x, x)) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && !~fp.eq~FLOAT(y, y)) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (((((y == \result && y == res) && y == y) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) && aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 14]: Loop Invariant [2020-10-20 00:40:49,995 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,995 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,996 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,996 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_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)-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_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(x, x)) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && !~fp.eq~FLOAT(y, y)) && 0bv32 == \result) || (((((!(0bv32 == \result) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 59]: Loop Invariant [2020-10-20 00:40:49,997 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,997 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_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])) && ~fp.eq~FLOAT(\result, x)) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && ~fp.eq~FLOAT(res, x)) && !~fp.eq~FLOAT(y, y)) || (((((y == \result && y == res) && y == y) && 1bv32 == \result) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 14]: Loop Invariant [2020-10-20 00:40:49,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:49,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:50,000 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] [2020-10-20 00:40:50,000 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmin_float_~x,QUANTIFIED] Derived loop invariant: ((((y == y && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || ((((((((x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && !(0bv32 == \result)) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && ((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y)))) && x == x) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (forall ULTIMATE.start_fmin_float_~x : C_FLOAT :: !~fp.lt~FLOAT(ULTIMATE.start_fmin_float_~x, y)))) && !~fp.eq~FLOAT(y, y)) && 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: 61]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (((((0bv32 == \result && ~fp.eq~FLOAT(y, y)) || (1bv32 == \result && !~fp.eq~FLOAT(y, y))) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ~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 - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: ((((1bv32 == \result && !aux-isnan_float(x) && !isnan_float(y)-aux) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) || (((0bv32 == \result && !aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(x, x)) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 26.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1146 SDtfs, 2207 SDslu, 4821 SDs, 0 SdLazy, 1909 SolverSat, 269 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1128 GetRequests, 845 SyntacticMatches, 10 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 9.0s 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.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 516 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 44 NumberOfFragments, 703 HoareAnnotationTreeSize, 14 FomulaSimplifications, 114644 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 14 FomulaSimplificationsInter, 17413 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 920 ConstructedInterpolants, 32 QuantifiedInterpolants, 91612 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...