./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-benchs/zonotope_loose.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 88b5e43d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/zonotope_loose.c.v+cfa-reducer.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 bbabbac29d53fb5c08c994976f0cc24cf1493748 ...................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/zonotope_loose.c.v+cfa-reducer.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 bbabbac29d53fb5c08c994976f0cc24cf1493748 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.2.0-88b5e43 [2020-11-23 23:47:19,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-23 23:47:19,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-23 23:47:19,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-23 23:47:19,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-23 23:47:19,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-23 23:47:19,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-23 23:47:19,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-23 23:47:19,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-23 23:47:19,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-23 23:47:19,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-23 23:47:19,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-23 23:47:19,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-23 23:47:19,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-23 23:47:19,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-23 23:47:19,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-23 23:47:19,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-23 23:47:19,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-23 23:47:19,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-23 23:47:19,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-23 23:47:19,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-23 23:47:19,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-23 23:47:19,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-23 23:47:19,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-23 23:47:19,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-23 23:47:19,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-23 23:47:19,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-23 23:47:19,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-23 23:47:19,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-23 23:47:19,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-23 23:47:19,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-23 23:47:19,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-23 23:47:19,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-23 23:47:19,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-23 23:47:19,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-23 23:47:19,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-23 23:47:19,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-23 23:47:19,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-23 23:47:19,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-23 23:47:19,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-23 23:47:19,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-23 23:47:19,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-23 23:47:19,556 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-23 23:47:19,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-23 23:47:19,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-23 23:47:19,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-23 23:47:19,558 INFO L138 SettingsManager]: * Use SBE=true [2020-11-23 23:47:19,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-23 23:47:19,562 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-23 23:47:19,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-23 23:47:19,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-23 23:47:19,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-23 23:47:19,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-23 23:47:19,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-23 23:47:19,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-23 23:47:19,565 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-23 23:47:19,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-23 23:47:19,566 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-23 23:47:19,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-23 23:47:19,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-23 23:47:19,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-23 23:47:19,567 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-23 23:47:19,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-23 23:47:19,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-23 23:47:19,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-23 23:47:19,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-23 23:47:19,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-23 23:47:19,568 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-23 23:47:19,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-23 23:47:19,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-23 23:47:19,569 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-23 23:47:19,569 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-2/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 -> bbabbac29d53fb5c08c994976f0cc24cf1493748 [2020-11-23 23:47:19,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-23 23:47:20,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-23 23:47:20,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-23 23:47:20,048 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-23 23:47:20,050 INFO L275 PluginConnector]: CDTParser initialized [2020-11-23 23:47:20,051 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2020-11-23 23:47:20,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/176764ea3/97f1655ed27048e78ccb5110f20d8c34/FLAG27bc536b5 [2020-11-23 23:47:20,685 INFO L306 CDTParser]: Found 1 translation units. [2020-11-23 23:47:20,686 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2020-11-23 23:47:20,693 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/176764ea3/97f1655ed27048e78ccb5110f20d8c34/FLAG27bc536b5 [2020-11-23 23:47:21,048 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/176764ea3/97f1655ed27048e78ccb5110f20d8c34 [2020-11-23 23:47:21,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-23 23:47:21,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-23 23:47:21,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-23 23:47:21,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-23 23:47:21,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-23 23:47:21,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:47:21" (1/1) ... [2020-11-23 23:47:21,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:21, skipping insertion in model container [2020-11-23 23:47:21,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:47:21" (1/1) ... [2020-11-23 23:47:21,085 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-11-23 23:47:21,108 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-11-23 23:47:21,326 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-11-23 23:47:21,338 INFO L212 MainTranslator]: Completed pre-run [2020-11-23 23:47:21,360 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-11-23 23:47:21,376 INFO L217 MainTranslator]: Completed translation [2020-11-23 23:47:21,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:21 WrapperNode [2020-11-23 23:47:21,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-23 23:47:21,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-23 23:47:21,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-23 23:47:21,379 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-23 23:47:21,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:21" (1/1) ... [2020-11-23 23:47:21,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:21" (1/1) ... [2020-11-23 23:47:21,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-23 23:47:21,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-23 23:47:21,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-23 23:47:21,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-23 23:47:21,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:21" (1/1) ... [2020-11-23 23:47:21,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:21" (1/1) ... [2020-11-23 23:47:21,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:21" (1/1) ... [2020-11-23 23:47:21,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:21" (1/1) ... [2020-11-23 23:47:21,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:21" (1/1) ... [2020-11-23 23:47:21,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:21" (1/1) ... [2020-11-23 23:47:21,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:21" (1/1) ... [2020-11-23 23:47:21,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-23 23:47:21,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-23 23:47:21,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-23 23:47:21,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-23 23:47:21,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:21" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-11-23 23:47:21,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-23 23:47:21,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-23 23:47:21,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-23 23:47:21,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-23 23:47:21,819 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-23 23:47:21,820 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-23 23:47:21,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:47:21 BoogieIcfgContainer [2020-11-23 23:47:21,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-23 23:47:21,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-23 23:47:21,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-23 23:47:21,829 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-23 23:47:21,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:47:21" (1/3) ... [2020-11-23 23:47:21,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c754849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:47:21, skipping insertion in model container [2020-11-23 23:47:21,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:21" (2/3) ... [2020-11-23 23:47:21,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c754849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:47:21, skipping insertion in model container [2020-11-23 23:47:21,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:47:21" (3/3) ... [2020-11-23 23:47:21,834 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_loose.c.v+cfa-reducer.c [2020-11-23 23:47:21,849 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-23 23:47:21,855 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-23 23:47:21,886 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-23 23:47:21,952 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-23 23:47:21,953 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-23 23:47:21,953 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-23 23:47:21,954 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-23 23:47:21,954 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-23 23:47:21,954 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-23 23:47:21,955 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-23 23:47:21,956 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-23 23:47:21,977 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-11-23 23:47:21,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-23 23:47:21,985 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:47:21,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-23 23:47:21,987 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:47:21,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:47:21,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1949357366, now seen corresponding path program 1 times [2020-11-23 23:47:22,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-23 23:47:22,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531189729] [2020-11-23 23:47:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-23 23:47:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 23:47:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 23:47:22,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531189729] [2020-11-23 23:47:22,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-23 23:47:22,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-23 23:47:22,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928327493] [2020-11-23 23:47:22,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-23 23:47:22,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-23 23:47:22,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-23 23:47:22,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-23 23:47:22,402 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2020-11-23 23:47:22,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 23:47:22,565 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-11-23 23:47:22,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-23 23:47:22,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-23 23:47:22,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 23:47:22,577 INFO L225 Difference]: With dead ends: 31 [2020-11-23 23:47:22,578 INFO L226 Difference]: Without dead ends: 14 [2020-11-23 23:47:22,581 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-23 23:47:22,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-11-23 23:47:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-11-23 23:47:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-23 23:47:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-11-23 23:47:22,621 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2020-11-23 23:47:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 23:47:22,622 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-11-23 23:47:22,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-23 23:47:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-11-23 23:47:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-23 23:47:22,623 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:47:22,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-23 23:47:22,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-23 23:47:22,624 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:47:22,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:47:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1930440081, now seen corresponding path program 1 times [2020-11-23 23:47:22,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-23 23:47:22,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028763363] [2020-11-23 23:47:22,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-23 23:47:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-23 23:47:22,645 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-23 23:47:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-23 23:47:22,664 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-23 23:47:22,686 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-23 23:47:22,687 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-23 23:47:22,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-23 23:47:22,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:47:22 BoogieIcfgContainer [2020-11-23 23:47:22,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-23 23:47:22,729 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-23 23:47:22,729 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-23 23:47:22,729 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-23 23:47:22,730 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:47:21" (3/4) ... [2020-11-23 23:47:22,734 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-23 23:47:22,735 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-23 23:47:22,742 INFO L168 Benchmark]: Toolchain (without parser) took 1683.50 ms. Allocated memory was 48.2 MB in the beginning and 60.8 MB in the end (delta: 12.6 MB). Free memory was 26.1 MB in the beginning and 38.0 MB in the end (delta: -11.8 MB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. [2020-11-23 23:47:22,743 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 48.2 MB. Free memory is still 33.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:47:22,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.19 ms. Allocated memory is still 48.2 MB. Free memory was 25.5 MB in the beginning and 29.0 MB in the end (delta: -3.4 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-11-23 23:47:22,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.71 ms. Allocated memory is still 48.2 MB. Free memory was 29.0 MB in the beginning and 27.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-23 23:47:22,747 INFO L168 Benchmark]: Boogie Preprocessor took 23.33 ms. Allocated memory is still 48.2 MB. Free memory was 27.5 MB in the beginning and 26.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:47:22,748 INFO L168 Benchmark]: RCFGBuilder took 379.01 ms. Allocated memory is still 48.2 MB. Free memory was 26.5 MB in the beginning and 25.9 MB in the end (delta: 603.9 kB). Peak memory consumption was 9.7 MB. Max. memory is 16.1 GB. [2020-11-23 23:47:22,750 INFO L168 Benchmark]: TraceAbstraction took 903.66 ms. Allocated memory was 48.2 MB in the beginning and 60.8 MB in the end (delta: 12.6 MB). Free memory was 25.5 MB in the beginning and 38.4 MB in the end (delta: -12.8 MB). Peak memory consumption was 753.8 kB. Max. memory is 16.1 GB. [2020-11-23 23:47:22,751 INFO L168 Benchmark]: Witness Printer took 6.62 ms. Allocated memory is still 60.8 MB. Free memory was 38.4 MB in the beginning and 38.0 MB in the end (delta: 399.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:47:22,764 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.28 ms. Allocated memory is still 48.2 MB. Free memory is still 33.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 318.19 ms. Allocated memory is still 48.2 MB. Free memory was 25.5 MB in the beginning and 29.0 MB in the end (delta: -3.4 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.71 ms. Allocated memory is still 48.2 MB. Free memory was 29.0 MB in the beginning and 27.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 23.33 ms. Allocated memory is still 48.2 MB. Free memory was 27.5 MB in the beginning and 26.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 379.01 ms. Allocated memory is still 48.2 MB. Free memory was 26.5 MB in the beginning and 25.9 MB in the end (delta: 603.9 kB). Peak memory consumption was 9.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 903.66 ms. Allocated memory was 48.2 MB in the beginning and 60.8 MB in the end (delta: 12.6 MB). Free memory was 25.5 MB in the beginning and 38.4 MB in the end (delta: -12.8 MB). Peak memory consumption was 753.8 kB. Max. memory is 16.1 GB. * Witness Printer took 6.62 ms. Allocated memory is still 60.8 MB. Free memory was 38.4 MB in the beginning and 38.0 MB in the end (delta: 399.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 4]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticDOUBLE_SMToperation at line 69, overapproximation of someBinaryDOUBLE_SMTComparisonOperation at line 32. Possible FailurePath: [L1] int __return_main; [L12] int __return_76; VAL [__return_76=0, __return_main=0] [L15] double main__x; [L16] double main__y; [L17] main__x = __VERIFIER_nondet_double() [L18] int main____CPAchecker_TMP_0; VAL [__return_76=0, __return_main=0] [L19] COND TRUE main__x >= 0.0 VAL [__return_76=0, __return_main=0] [L21] COND TRUE main__x <= 10.0 [L23] main____CPAchecker_TMP_0 = 1 VAL [__return_76=0, __return_main=0] [L24] COND TRUE main____CPAchecker_TMP_0 != 0 [L26] main__y = (main__x * main__x) - main__x VAL [__return_76=0, __return_main=0] [L27] COND FALSE !(main__y >= 0) [L69] main__y = (main__x * main__x) + 2.0 VAL [__return_76=0, __return_main=0] [L31] int main____CPAchecker_TMP_1; VAL [__return_76=0, __return_main=0] [L32] COND FALSE !(main__y >= 0.0) VAL [__return_76=0, __return_main=0] [L58] main____CPAchecker_TMP_1 = 0 VAL [__return_76=0, __return_main=0] [L39] int __tmp_1; [L40] __tmp_1 = main____CPAchecker_TMP_1 [L41] int __VERIFIER_assert__cond; [L42] __VERIFIER_assert__cond = __tmp_1 VAL [__return_76=0, __return_main=0] [L43] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_76=0, __return_main=0] [L4] __assert_fail("0", "zonotope_loose.c.v+cfa-reducer.c", 4, "reach_error") VAL [__return_76=0, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 20 SDtfs, 28 SDslu, 39 SDs, 0 SdLazy, 13 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 209 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-88b5e43 [2020-11-23 23:47:25,253 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-23 23:47:25,255 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-23 23:47:25,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-23 23:47:25,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-23 23:47:25,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-23 23:47:25,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-23 23:47:25,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-23 23:47:25,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-23 23:47:25,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-23 23:47:25,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-23 23:47:25,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-23 23:47:25,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-23 23:47:25,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-23 23:47:25,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-23 23:47:25,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-23 23:47:25,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-23 23:47:25,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-23 23:47:25,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-23 23:47:25,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-23 23:47:25,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-23 23:47:25,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-23 23:47:25,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-23 23:47:25,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-23 23:47:25,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-23 23:47:25,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-23 23:47:25,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-23 23:47:25,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-23 23:47:25,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-23 23:47:25,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-23 23:47:25,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-23 23:47:25,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-23 23:47:25,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-23 23:47:25,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-23 23:47:25,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-23 23:47:25,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-23 23:47:25,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-23 23:47:25,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-23 23:47:25,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-23 23:47:25,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-23 23:47:25,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-23 23:47:25,338 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-11-23 23:47:25,387 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-23 23:47:25,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-23 23:47:25,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-23 23:47:25,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-23 23:47:25,392 INFO L138 SettingsManager]: * Use SBE=true [2020-11-23 23:47:25,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-23 23:47:25,393 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-23 23:47:25,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-23 23:47:25,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-23 23:47:25,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-23 23:47:25,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-23 23:47:25,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-23 23:47:25,396 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-23 23:47:25,396 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-23 23:47:25,396 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-23 23:47:25,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-23 23:47:25,397 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-23 23:47:25,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-23 23:47:25,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-23 23:47:25,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-23 23:47:25,398 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-23 23:47:25,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-23 23:47:25,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-23 23:47:25,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-23 23:47:25,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-23 23:47:25,400 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-23 23:47:25,400 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-23 23:47:25,401 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-23 23:47:25,401 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-23 23:47:25,401 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-23 23:47:25,401 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-23 23:47:25,402 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-2/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 -> bbabbac29d53fb5c08c994976f0cc24cf1493748 [2020-11-23 23:47:25,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-23 23:47:25,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-23 23:47:25,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-23 23:47:25,888 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-23 23:47:25,889 INFO L275 PluginConnector]: CDTParser initialized [2020-11-23 23:47:25,890 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2020-11-23 23:47:25,973 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f6c8056fc/0b0ffd846d3c4bb882e25da03c8f84ac/FLAGdcd232614 [2020-11-23 23:47:26,542 INFO L306 CDTParser]: Found 1 translation units. [2020-11-23 23:47:26,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2020-11-23 23:47:26,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f6c8056fc/0b0ffd846d3c4bb882e25da03c8f84ac/FLAGdcd232614 [2020-11-23 23:47:26,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f6c8056fc/0b0ffd846d3c4bb882e25da03c8f84ac [2020-11-23 23:47:26,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-23 23:47:26,943 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-23 23:47:26,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-23 23:47:26,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-23 23:47:26,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-23 23:47:26,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:47:26" (1/1) ... [2020-11-23 23:47:26,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:26, skipping insertion in model container [2020-11-23 23:47:26,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:47:26" (1/1) ... [2020-11-23 23:47:26,979 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-11-23 23:47:27,005 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-11-23 23:47:27,206 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-11-23 23:47:27,225 INFO L212 MainTranslator]: Completed pre-run [2020-11-23 23:47:27,246 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-11-23 23:47:27,266 INFO L217 MainTranslator]: Completed translation [2020-11-23 23:47:27,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:27 WrapperNode [2020-11-23 23:47:27,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-23 23:47:27,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-23 23:47:27,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-23 23:47:27,268 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-23 23:47:27,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:27" (1/1) ... [2020-11-23 23:47:27,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:27" (1/1) ... [2020-11-23 23:47:27,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-23 23:47:27,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-23 23:47:27,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-23 23:47:27,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-23 23:47:27,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:27" (1/1) ... [2020-11-23 23:47:27,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:27" (1/1) ... [2020-11-23 23:47:27,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:27" (1/1) ... [2020-11-23 23:47:27,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:27" (1/1) ... [2020-11-23 23:47:27,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:27" (1/1) ... [2020-11-23 23:47:27,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:27" (1/1) ... [2020-11-23 23:47:27,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:27" (1/1) ... [2020-11-23 23:47:27,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-23 23:47:27,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-23 23:47:27,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-23 23:47:27,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-23 23:47:27,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:27" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-11-23 23:47:27,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_DOUBLE [2020-11-23 23:47:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-23 23:47:27,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-23 23:47:27,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-23 23:47:27,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-23 23:47:31,202 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-23 23:47:31,202 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-23 23:47:31,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:47:31 BoogieIcfgContainer [2020-11-23 23:47:31,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-23 23:47:31,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-23 23:47:31,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-23 23:47:31,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-23 23:47:31,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:47:26" (1/3) ... [2020-11-23 23:47:31,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b644c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:47:31, skipping insertion in model container [2020-11-23 23:47:31,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:27" (2/3) ... [2020-11-23 23:47:31,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b644c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:47:31, skipping insertion in model container [2020-11-23 23:47:31,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:47:31" (3/3) ... [2020-11-23 23:47:31,214 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_loose.c.v+cfa-reducer.c [2020-11-23 23:47:31,225 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-23 23:47:31,230 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-23 23:47:31,243 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-23 23:47:31,270 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-23 23:47:31,271 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-23 23:47:31,271 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-23 23:47:31,271 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-23 23:47:31,271 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-23 23:47:31,271 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-23 23:47:31,272 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-23 23:47:31,272 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-23 23:47:31,285 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-11-23 23:47:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-23 23:47:31,290 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:47:31,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-23 23:47:31,291 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:47:31,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:47:31,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1949357366, now seen corresponding path program 1 times [2020-11-23 23:47:31,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 23:47:31,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309154174] [2020-11-23 23:47:31,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-11-23 23:47:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 23:47:31,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-23 23:47:31,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 23:47:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 23:47:31,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 23:47:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 23:47:32,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309154174] [2020-11-23 23:47:32,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-23 23:47:32,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-11-23 23:47:32,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156634121] [2020-11-23 23:47:32,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-23 23:47:32,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 23:47:32,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-23 23:47:32,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-23 23:47:32,027 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 6 states. [2020-11-23 23:47:32,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 23:47:32,147 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-11-23 23:47:32,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-23 23:47:32,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-11-23 23:47:32,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 23:47:32,159 INFO L225 Difference]: With dead ends: 31 [2020-11-23 23:47:32,159 INFO L226 Difference]: Without dead ends: 14 [2020-11-23 23:47:32,162 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-23 23:47:32,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-11-23 23:47:32,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-11-23 23:47:32,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-23 23:47:32,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-11-23 23:47:32,196 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2020-11-23 23:47:32,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 23:47:32,197 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-11-23 23:47:32,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-23 23:47:32,197 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-11-23 23:47:32,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-23 23:47:32,198 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:47:32,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-23 23:47:32,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-23 23:47:32,415 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:47:32,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:47:32,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1930440081, now seen corresponding path program 1 times [2020-11-23 23:47:32,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 23:47:32,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513947667] [2020-11-23 23:47:32,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-11-23 23:47:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 23:47:32,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-23 23:47:32,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 23:47:42,082 WARN L193 SmtUtils]: Spent 2.41 s on a formula simplification that was a NOOP. DAG size: 20 [2020-11-23 23:47:48,221 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (ULTIMATE.start_main_~main__y~0 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) ULTIMATE.start_main_~main__y~0))) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (not (fp.geq .cse0 (_ +zero 11 53))) (= .cse0 (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse1) ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq .cse1 (_ +zero 11 53))))) is different from false [2020-11-23 23:47:50,253 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (ULTIMATE.start_main_~main__y~0 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) ULTIMATE.start_main_~main__y~0))) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (not (fp.geq .cse0 (_ +zero 11 53))) (= .cse0 (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse1) ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq .cse1 (_ +zero 11 53))))) is different from true [2020-11-23 23:48:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 23:48:02,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 23:48:20,801 WARN L193 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 21 [2020-11-23 23:48:22,862 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_13 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_13)))) (or (not (= .cse0 (fp.add c_~CRM (fp.mul c_~CRM .cse1 .cse1) ((_ to_fp 11 53) c_~CRM 2.0)))) (not (fp.geq .cse1 (_ +zero 11 53))) (fp.geq .cse0 (_ +zero 11 53))))) is different from false [2020-11-23 23:48:24,909 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_13 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_13)))) (or (not (= .cse0 (fp.add c_~CRM (fp.mul c_~CRM .cse1 .cse1) ((_ to_fp 11 53) c_~CRM 2.0)))) (not (fp.geq .cse1 (_ +zero 11 53))) (fp.geq .cse0 (_ +zero 11 53))))) is different from true [2020-11-23 23:48:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 23:48:24,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513947667] [2020-11-23 23:48:24,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-23 23:48:24,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2020-11-23 23:48:24,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125269638] [2020-11-23 23:48:24,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-23 23:48:24,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 23:48:24,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-23 23:48:24,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=24, Unknown=10, NotChecked=22, Total=72 [2020-11-23 23:48:24,921 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 9 states. [2020-11-23 23:48:28,542 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_13 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_13)))) (or (not (= .cse0 (fp.add c_~CRM (fp.mul c_~CRM .cse1 .cse1) ((_ to_fp 11 53) c_~CRM 2.0)))) (not (fp.geq .cse1 (_ +zero 11 53))) (fp.geq .cse0 (_ +zero 11 53)))))) is different from false [2020-11-23 23:48:38,687 WARN L193 SmtUtils]: Spent 4.34 s on a formula simplification that was a NOOP. DAG size: 25 [2020-11-23 23:48:53,539 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((v_ULTIMATE.start_main_~main__y~0_13 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_13)))) (or (not (= .cse0 (fp.add c_~CRM (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (fp.mul c_~CRM .cse1 .cse1)) ((_ to_fp 11 53) c_~CRM 2.0)))) (fp.geq .cse0 (_ +zero 11 53))))) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (_ +zero 11 53)) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse2) ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq .cse2 (_ +zero 11 53)))))) is different from false [2020-11-23 23:48:55,614 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((v_ULTIMATE.start_main_~main__y~0_13 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_13)))) (or (not (= .cse0 (fp.add c_~CRM (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (fp.mul c_~CRM .cse1 .cse1)) ((_ to_fp 11 53) c_~CRM 2.0)))) (fp.geq .cse0 (_ +zero 11 53))))) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (_ +zero 11 53)) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse2) ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq .cse2 (_ +zero 11 53)))))) is different from true [2020-11-23 23:49:24,090 WARN L193 SmtUtils]: Spent 9.55 s on a formula simplification that was a NOOP. DAG size: 22 [2020-11-23 23:49:46,341 WARN L193 SmtUtils]: Spent 6.64 s on a formula simplification that was a NOOP. DAG size: 31 [2020-11-23 23:50:20,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 23:50:20,501 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2020-11-23 23:50:20,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-23 23:50:20,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2020-11-23 23:50:20,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 23:50:20,624 INFO L225 Difference]: With dead ends: 32 [2020-11-23 23:50:20,625 INFO L226 Difference]: Without dead ends: 27 [2020-11-23 23:50:20,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 87.3s TimeCoverageRelationStatistics Valid=36, Invalid=48, Unknown=22, NotChecked=76, Total=182 [2020-11-23 23:50:20,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-11-23 23:50:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2020-11-23 23:50:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-11-23 23:50:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2020-11-23 23:50:20,632 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2020-11-23 23:50:20,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 23:50:20,632 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2020-11-23 23:50:20,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-23 23:50:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-11-23 23:50:20,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-23 23:50:20,633 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:50:20,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-23 23:50:20,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-23 23:50:20,835 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:50:20,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:50:20,837 INFO L82 PathProgramCache]: Analyzing trace with hash -123235692, now seen corresponding path program 1 times [2020-11-23 23:50:20,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 23:50:20,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451528407] [2020-11-23 23:50:20,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-11-23 23:50:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 23:50:21,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-23 23:50:21,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 23:50:24,388 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (~CRM RoundingMode)) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (fp.div ~CRM .cse0 ((_ to_fp 11 53) ~CRM 10.0))) (fp.geq .cse0 (_ +zero 11 53))))) is different from true [2020-11-23 23:50:30,758 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (~CRM RoundingMode) (ULTIMATE.start_main_~main__y~0 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) ULTIMATE.start_main_~main__y~0))) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (not (fp.geq .cse0 (_ +zero 11 53))) (= .cse0 (fp.div ~CRM .cse1 ((_ to_fp 11 53) ~CRM 10.0))) (fp.geq .cse1 (_ +zero 11 53))))) is different from false [2020-11-23 23:50:32,846 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (~CRM RoundingMode) (ULTIMATE.start_main_~main__y~0 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) ULTIMATE.start_main_~main__y~0))) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (not (fp.geq .cse0 (_ +zero 11 53))) (= .cse0 (fp.div ~CRM .cse1 ((_ to_fp 11 53) ~CRM 10.0))) (fp.geq .cse1 (_ +zero 11 53))))) is different from true [2020-11-23 23:50:45,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 23:50:45,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 23:50:46,058 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2020-11-23 23:50:59,017 WARN L193 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 20 [2020-11-23 23:51:05,428 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_16 (_ BitVec 64)) (~CRM RoundingMode)) (let ((.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_16)))) (or (fp.geq .cse0 (_ +zero 11 53)) (not (fp.geq .cse1 (_ +zero 11 53))) (not (= (fp.div ~CRM .cse1 ((_ to_fp 11 53) ~CRM 10.0)) .cse0))))) is different from false [2020-11-23 23:51:07,582 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_16 (_ BitVec 64)) (~CRM RoundingMode)) (let ((.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_16)))) (or (fp.geq .cse0 (_ +zero 11 53)) (not (fp.geq .cse1 (_ +zero 11 53))) (not (= (fp.div ~CRM .cse1 ((_ to_fp 11 53) ~CRM 10.0)) .cse0))))) is different from true [2020-11-23 23:51:11,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 23:51:11,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451528407] [2020-11-23 23:51:11,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-23 23:51:11,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2020-11-23 23:51:11,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381702034] [2020-11-23 23:51:11,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-23 23:51:11,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 23:51:11,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-23 23:51:11,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=10, Unknown=9, NotChecked=24, Total=56 [2020-11-23 23:51:11,860 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 8 states. [2020-11-23 23:51:20,950 WARN L193 SmtUtils]: Spent 4.55 s on a formula simplification that was a NOOP. DAG size: 22 [2020-11-23 23:51:33,510 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (~CRM RoundingMode)) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (fp.div ~CRM .cse0 ((_ to_fp 11 53) ~CRM 10.0))) (fp.geq .cse0 (_ +zero 11 53))))) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (_ +zero 11 53))) is different from false [2020-11-23 23:51:44,825 WARN L193 SmtUtils]: Spent 6.96 s on a formula simplification that was a NOOP. DAG size: 28 [2020-11-23 23:51:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 23:51:45,007 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2020-11-23 23:51:45,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-23 23:51:45,009 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-11-23 23:51:45,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 23:51:45,010 INFO L225 Difference]: With dead ends: 27 [2020-11-23 23:51:45,011 INFO L226 Difference]: Without dead ends: 22 [2020-11-23 23:51:45,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.5s TimeCoverageRelationStatistics Valid=25, Invalid=20, Unknown=13, NotChecked=52, Total=110 [2020-11-23 23:51:45,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-11-23 23:51:45,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2020-11-23 23:51:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-23 23:51:45,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-11-23 23:51:45,015 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2020-11-23 23:51:45,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 23:51:45,016 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-11-23 23:51:45,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-23 23:51:45,016 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-11-23 23:51:45,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-23 23:51:45,017 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:51:45,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-23 23:51:45,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-23 23:51:45,218 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:51:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:51:45,220 INFO L82 PathProgramCache]: Analyzing trace with hash -288146032, now seen corresponding path program 1 times [2020-11-23 23:51:45,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 23:51:45,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155365552] [2020-11-23 23:51:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-11-23 23:51:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 23:51:45,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-23 23:51:45,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 23:51:46,106 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2020-11-23 23:51:46,747 WARN L193 SmtUtils]: Spent 452.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-11-23 23:51:47,874 WARN L193 SmtUtils]: Spent 801.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-23 23:51:51,236 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (and (= roundNearestTiesToEven c_~CRM) (fp.geq .cse0 (_ +zero 11 53)) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (fp.sub c_~CRM (fp.mul c_~CRM .cse0 .cse0) .cse0)) (fp.leq .cse0 ((_ to_fp 11 53) c_~CRM 10.0)))) is different from true [2020-11-23 23:51:53,325 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_19 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_19))) (.cse2 (fp.mul c_~CRM .cse1 .cse1))) (and (not (fp.geq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32)))) (fp.geq .cse1 (_ +zero 11 53)) (fp.leq .cse1 ((_ to_fp 11 53) c_~CRM 10.0)) (= .cse0 (fp.sub c_~CRM .cse2 .cse1)) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (fp.add c_~CRM .cse2 ((_ to_fp 11 53) c_~CRM 2.0)))))))) is different from false [2020-11-23 23:51:55,512 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_19 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_19))) (.cse2 (fp.mul c_~CRM .cse1 .cse1))) (and (not (fp.geq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32)))) (fp.geq .cse1 (_ +zero 11 53)) (fp.leq .cse1 ((_ to_fp 11 53) c_~CRM 10.0)) (= .cse0 (fp.sub c_~CRM .cse2 .cse1)) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (fp.add c_~CRM .cse2 ((_ to_fp 11 53) c_~CRM 2.0)))))))) is different from false [2020-11-23 23:52:01,883 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_19 (_ BitVec 64)) (ULTIMATE.start_main_~main__y~0 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_19))) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) ULTIMATE.start_main_~main__y~0))) (.cse3 (fp.mul roundNearestTiesToEven .cse0 .cse0))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))) (not (fp.geq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= (fp.sub roundNearestTiesToEven .cse3 .cse0) .cse2) (fp.geq .cse1 (_ +zero 11 53)) (= .cse1 (fp.add roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq .cse0 (_ +zero 11 53)))))) is different from false [2020-11-23 23:52:03,970 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_19 (_ BitVec 64)) (ULTIMATE.start_main_~main__y~0 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_19))) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) ULTIMATE.start_main_~main__y~0))) (.cse3 (fp.mul roundNearestTiesToEven .cse0 .cse0))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))) (not (fp.geq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= (fp.sub roundNearestTiesToEven .cse3 .cse0) .cse2) (fp.geq .cse1 (_ +zero 11 53)) (= .cse1 (fp.add roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq .cse0 (_ +zero 11 53)))))) is different from true [2020-11-23 23:52:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 23:52:16,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 23:52:17,302 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-11-23 23:52:18,497 WARN L193 SmtUtils]: Spent 574.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2020-11-23 23:52:20,692 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_main_~main__y~0_20 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_20)))) (or (fp.leq .cse0 ((_ to_fp 11 53) c_~CRM 105.0)) (not (= .cse0 (fp.add c_~CRM (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (fp.mul c_~CRM .cse1 .cse1)) ((_ to_fp 11 53) c_~CRM 2.0)))) (not (fp.geq .cse0 (_ +zero 11 53)))))) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32)))) is different from true [2020-11-23 23:52:22,925 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_main_~main__y~0_20 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_20)))) (or (fp.leq .cse0 ((_ to_fp 11 53) c_~CRM 105.0)) (not (= .cse0 (fp.add c_~CRM (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (fp.mul c_~CRM .cse1 .cse1)) ((_ to_fp 11 53) c_~CRM 2.0)))) (not (fp.geq .cse0 (_ +zero 11 53)))))) (forall ((v_ULTIMATE.start_main_~main__y~0_21 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_21)))) (or (fp.geq .cse2 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse2 (let ((.cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (fp.sub c_~CRM (fp.mul c_~CRM .cse3 .cse3) .cse3)))))))) is different from true [2020-11-23 23:52:25,120 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_main_~main__y~0_20 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_20)))) (or (fp.leq .cse0 ((_ to_fp 11 53) c_~CRM 105.0)) (not (= .cse0 (fp.add c_~CRM (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (fp.mul c_~CRM .cse1 .cse1)) ((_ to_fp 11 53) c_~CRM 2.0)))) (not (fp.geq .cse0 (_ +zero 11 53)))))) (forall ((v_ULTIMATE.start_main_~main__y~0_21 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_21)))) (or (fp.geq .cse2 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse2 (let ((.cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (fp.sub c_~CRM (fp.mul c_~CRM .cse3 .cse3) .cse3))))))) (not (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) ((_ to_fp 11 53) c_~CRM 10.0)))) is different from true [2020-11-23 23:52:27,210 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_21 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_20 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_20))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_21))) (.cse2 (fp.mul c_~CRM .cse3 .cse3))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (fp.leq .cse1 ((_ to_fp 11 53) c_~CRM 105.0)) (not (= .cse1 (fp.add c_~CRM .cse2 ((_ to_fp 11 53) c_~CRM 2.0)))) (not (fp.geq .cse3 (_ +zero 11 53))) (not (fp.geq .cse1 (_ +zero 11 53))) (not (= .cse0 (fp.sub c_~CRM .cse2 .cse3))) (not (fp.leq .cse3 ((_ to_fp 11 53) c_~CRM 10.0))))))) is different from false [2020-11-23 23:52:29,284 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_21 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_20 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_20))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_21))) (.cse2 (fp.mul c_~CRM .cse3 .cse3))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (fp.leq .cse1 ((_ to_fp 11 53) c_~CRM 105.0)) (not (= .cse1 (fp.add c_~CRM .cse2 ((_ to_fp 11 53) c_~CRM 2.0)))) (not (fp.geq .cse3 (_ +zero 11 53))) (not (fp.geq .cse1 (_ +zero 11 53))) (not (= .cse0 (fp.sub c_~CRM .cse2 .cse3))) (not (fp.leq .cse3 ((_ to_fp 11 53) c_~CRM 10.0))))))) is different from true [2020-11-23 23:52:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 23:52:29,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155365552] [2020-11-23 23:52:29,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-23 23:52:29,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 14 [2020-11-23 23:52:29,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597313379] [2020-11-23 23:52:29,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-23 23:52:29,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 23:52:29,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-23 23:52:29,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=33, Unknown=10, NotChecked=136, Total=210 [2020-11-23 23:52:29,295 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 15 states. [2020-11-23 23:52:31,669 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_21 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_20 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_20))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_21))) (.cse2 (fp.mul c_~CRM .cse3 .cse3))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (fp.leq .cse1 ((_ to_fp 11 53) c_~CRM 105.0)) (not (= .cse1 (fp.add c_~CRM .cse2 ((_ to_fp 11 53) c_~CRM 2.0)))) (not (fp.geq .cse3 (_ +zero 11 53))) (not (fp.geq .cse1 (_ +zero 11 53))) (not (= .cse0 (fp.sub c_~CRM .cse2 .cse3))) (not (fp.leq .cse3 ((_ to_fp 11 53) c_~CRM 10.0)))))))) is different from false [2020-11-23 23:52:33,971 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (and (= roundNearestTiesToEven c_~CRM) (fp.geq .cse0 (_ +zero 11 53)) (or (forall ((v_ULTIMATE.start_main_~main__y~0_20 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_20)))) (or (fp.leq .cse1 ((_ to_fp 11 53) c_~CRM 105.0)) (not (= .cse1 (fp.add c_~CRM (let ((.cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (fp.mul c_~CRM .cse2 .cse2)) ((_ to_fp 11 53) c_~CRM 2.0)))) (not (fp.geq .cse1 (_ +zero 11 53)))))) (forall ((v_ULTIMATE.start_main_~main__y~0_21 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_21)))) (or (fp.geq .cse3 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse3 (let ((.cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (fp.sub c_~CRM (fp.mul c_~CRM .cse4 .cse4) .cse4))))))) (not (fp.leq .cse0 ((_ to_fp 11 53) c_~CRM 10.0)))))) is different from true [2020-11-23 23:53:03,201 WARN L193 SmtUtils]: Spent 20.60 s on a formula simplification that was a NOOP. DAG size: 46 [2020-11-23 23:53:07,489 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (and (= roundNearestTiesToEven c_~CRM) (fp.geq .cse0 (_ +zero 11 53)) (= .cse1 (fp.sub c_~CRM (fp.mul c_~CRM .cse0 .cse0) .cse0)) (or (forall ((v_ULTIMATE.start_main_~main__y~0_20 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_20)))) (or (fp.leq .cse2 ((_ to_fp 11 53) c_~CRM 105.0)) (not (= .cse2 (fp.add c_~CRM (let ((.cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (fp.mul c_~CRM .cse3 .cse3)) ((_ to_fp 11 53) c_~CRM 2.0)))) (not (fp.geq .cse2 (_ +zero 11 53)))))) (fp.geq .cse1 ((_ to_fp 11 53) c_~CRM (_ bv0 32)))) (fp.leq .cse0 ((_ to_fp 11 53) c_~CRM 10.0)))) is different from false [2020-11-23 23:53:09,680 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (let ((.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_~CRM 105.0)))) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_19 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_19))) (.cse3 (fp.mul c_~CRM .cse2 .cse2))) (and (not (fp.geq .cse1 ((_ to_fp 11 53) c_~CRM (_ bv0 32)))) (fp.geq .cse2 (_ +zero 11 53)) (fp.leq .cse2 ((_ to_fp 11 53) c_~CRM 10.0)) (= .cse1 (fp.sub c_~CRM .cse3 .cse2)) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (fp.add c_~CRM .cse3 ((_ to_fp 11 53) c_~CRM 2.0)))))))) is different from false [2020-11-23 23:53:11,962 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_~CRM 105.0)) (= roundNearestTiesToEven c_~CRM) (fp.geq .cse0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_19 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_19))) (.cse3 (fp.mul c_~CRM .cse2 .cse2))) (and (not (fp.geq .cse1 ((_ to_fp 11 53) c_~CRM (_ bv0 32)))) (fp.geq .cse2 (_ +zero 11 53)) (fp.leq .cse2 ((_ to_fp 11 53) c_~CRM 10.0)) (= .cse1 (fp.sub c_~CRM .cse3 .cse2)) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (fp.add c_~CRM .cse3 ((_ to_fp 11 53) c_~CRM 2.0))))))))) is different from false [2020-11-23 23:53:12,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 23:53:12,609 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2020-11-23 23:53:12,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-23 23:53:12,610 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 13 [2020-11-23 23:53:12,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 23:53:12,611 INFO L225 Difference]: With dead ends: 22 [2020-11-23 23:53:12,611 INFO L226 Difference]: Without dead ends: 14 [2020-11-23 23:53:12,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 67.0s TimeCoverageRelationStatistics Valid=46, Invalid=44, Unknown=18, NotChecked=312, Total=420 [2020-11-23 23:53:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-11-23 23:53:12,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-11-23 23:53:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-23 23:53:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2020-11-23 23:53:12,616 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13 [2020-11-23 23:53:12,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 23:53:12,616 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2020-11-23 23:53:12,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-23 23:53:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2020-11-23 23:53:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-23 23:53:12,617 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:53:12,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-23 23:53:12,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-23 23:53:12,822 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:53:12,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:53:12,823 INFO L82 PathProgramCache]: Analyzing trace with hash -99384821, now seen corresponding path program 1 times [2020-11-23 23:53:12,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 23:53:12,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423608670] [2020-11-23 23:53:12,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-11-23 23:53:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 23:53:13,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-23 23:53:13,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 23:53:13,856 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2020-11-23 23:53:14,732 WARN L193 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-11-23 23:53:16,949 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 ((_ to_fp 11 53) c_~CRM 10.0))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (fp.div c_~CRM .cse0 .cse1)) (fp.leq .cse0 .cse1))))) is different from false [2020-11-23 23:53:19,369 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 ((_ to_fp 11 53) c_~CRM 10.0))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (fp.div c_~CRM .cse0 .cse1)) (fp.leq .cse0 .cse1))))) is different from false [2020-11-23 23:53:26,089 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (ULTIMATE.start_main_~main__y~0 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) ULTIMATE.start_main_~main__y~0))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (and (fp.leq .cse0 .cse1) (not (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))) (fp.geq .cse2 (_ +zero 11 53)) (= .cse2 (fp.div roundNearestTiesToEven .cse0 .cse1))))) is different from false [2020-11-23 23:53:28,244 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (ULTIMATE.start_main_~main__y~0 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) ULTIMATE.start_main_~main__y~0))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (and (fp.leq .cse0 .cse1) (not (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))) (fp.geq .cse2 (_ +zero 11 53)) (= .cse2 (fp.div roundNearestTiesToEven .cse0 .cse1))))) is different from true [2020-11-23 23:53:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 23:53:41,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 23:53:42,416 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-11-23 23:53:43,940 WARN L193 SmtUtils]: Spent 763.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2020-11-23 23:53:46,288 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__y~0_23 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_23)))) (or (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) ((_ to_fp 11 53) c_~CRM 10.0)) .cse0)) (fp.leq .cse0 ((_ to_fp 11 53) c_~CRM 105.0)) (not (fp.geq .cse0 (_ +zero 11 53)))))) is different from true [2020-11-23 23:53:48,535 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_23 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_23)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (fp.leq .cse2 ((_ to_fp 11 53) c_~CRM 105.0)) (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse2 (_ +zero 11 53)))))) is different from false [2020-11-23 23:53:50,741 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_23 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_23)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (fp.leq .cse2 ((_ to_fp 11 53) c_~CRM 105.0)) (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse2 (_ +zero 11 53)))))) is different from true [2020-11-23 23:53:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 23:53:50,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423608670] [2020-11-23 23:53:50,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-23 23:53:50,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2020-11-23 23:53:50,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564485570] [2020-11-23 23:53:50,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-23 23:53:50,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 23:53:50,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-23 23:53:50,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=22, Unknown=7, NotChecked=60, Total=110 [2020-11-23 23:53:50,750 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand 11 states. [2020-11-23 23:53:53,334 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__y~0_23 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_23)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (fp.leq .cse2 ((_ to_fp 11 53) c_~CRM 105.0)) (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse2 (_ +zero 11 53))))))) is different from false [2020-11-23 23:53:55,811 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((v_ULTIMATE.start_main_~main__y~0_23 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~main__y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~main__y~0_23)))) (or (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) ((_ to_fp 11 53) c_~CRM 10.0)) .cse0)) (fp.leq .cse0 ((_ to_fp 11 53) c_~CRM 105.0)) (not (fp.geq .cse0 (_ +zero 11 53)))))) (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) ((_ to_fp 11 53) c_~CRM 10.0))) is different from true [2020-11-23 23:53:58,028 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (let ((.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_~CRM 105.0)))) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse2 ((_ to_fp 11 53) c_~CRM 10.0))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (fp.div c_~CRM .cse1 .cse2)) (fp.leq .cse1 .cse2))))) is different from false [2020-11-23 23:54:00,351 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_~CRM 105.0)) (= roundNearestTiesToEven c_~CRM) (fp.geq .cse0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse2 ((_ to_fp 11 53) c_~CRM 10.0))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__y~0)) (fp.div c_~CRM .cse1 .cse2)) (fp.leq .cse1 .cse2)))))) is different from false [2020-11-23 23:54:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 23:54:00,450 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2020-11-23 23:54:00,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-23 23:54:00,451 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2020-11-23 23:54:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 23:54:00,451 INFO L225 Difference]: With dead ends: 14 [2020-11-23 23:54:00,451 INFO L226 Difference]: Without dead ends: 0 [2020-11-23 23:54:00,452 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=29, Invalid=26, Unknown=11, NotChecked=144, Total=210 [2020-11-23 23:54:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-23 23:54:00,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-23 23:54:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-23 23:54:00,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-23 23:54:00,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-11-23 23:54:00,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 23:54:00,453 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-23 23:54:00,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-23 23:54:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-23 23:54:00,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-23 23:54:00,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-23 23:54:00,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-23 23:54:00,887 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2020-11-23 23:54:01,113 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2020-11-23 23:54:17,769 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-11-23 23:54:17,770 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:226) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:134) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:221) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter(HoareAnnotationComposer.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.(HoareAnnotationComposer.java:105) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeCFGHoareAnnotation(BasicCegarLoop.java:1052) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 34 more [2020-11-23 23:54:17,775 INFO L168 Benchmark]: Toolchain (without parser) took 410836.97 ms. Allocated memory was 44.0 MB in the beginning and 56.6 MB in the end (delta: 12.6 MB). Free memory was 20.8 MB in the beginning and 27.5 MB in the end (delta: -6.7 MB). Peak memory consumption was 8.1 MB. Max. memory is 16.1 GB. [2020-11-23 23:54:17,776 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 44.0 MB. Free memory was 23.4 MB in the beginning and 23.3 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:54:17,777 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.65 ms. Allocated memory was 44.0 MB in the beginning and 56.6 MB in the end (delta: 12.6 MB). Free memory was 20.2 MB in the beginning and 31.4 MB in the end (delta: -11.3 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. [2020-11-23 23:54:17,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.96 ms. Allocated memory is still 56.6 MB. Free memory was 31.4 MB in the beginning and 30.0 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:54:17,778 INFO L168 Benchmark]: Boogie Preprocessor took 30.01 ms. Allocated memory is still 56.6 MB. Free memory was 29.8 MB in the beginning and 28.7 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:54:17,779 INFO L168 Benchmark]: RCFGBuilder took 3862.80 ms. Allocated memory is still 56.6 MB. Free memory was 28.5 MB in the beginning and 32.4 MB in the end (delta: -3.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-23 23:54:17,780 INFO L168 Benchmark]: TraceAbstraction took 406566.67 ms. Allocated memory is still 56.6 MB. Free memory was 32.2 MB in the beginning and 27.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-11-23 23:54:17,784 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.24 ms. Allocated memory is still 44.0 MB. Free memory was 23.4 MB in the beginning and 23.3 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 320.65 ms. Allocated memory was 44.0 MB in the beginning and 56.6 MB in the end (delta: 12.6 MB). Free memory was 20.2 MB in the beginning and 31.4 MB in the end (delta: -11.3 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.96 ms. Allocated memory is still 56.6 MB. Free memory was 31.4 MB in the beginning and 30.0 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.01 ms. Allocated memory is still 56.6 MB. Free memory was 29.8 MB in the beginning and 28.7 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 3862.80 ms. Allocated memory is still 56.6 MB. Free memory was 28.5 MB in the beginning and 32.4 MB in the end (delta: -3.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 406566.67 ms. Allocated memory is still 56.6 MB. Free memory was 32.2 MB in the beginning and 27.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...