/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270b_true-unreach-call.c --full-output --architecture 32bit --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5eb3fea6 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270b_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1203da81dc5c48f4dda347acec83e1939b55600b --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false ................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270b_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1203da81dc5c48f4dda347acec83e1939b55600b --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5eb3fea [2018-09-21 18:40:03,679 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 18:40:03,681 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 18:40:03,699 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 18:40:03,700 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 18:40:03,702 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 18:40:03,704 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 18:40:03,706 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 18:40:03,709 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 18:40:03,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 18:40:03,714 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 18:40:03,715 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 18:40:03,716 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 18:40:03,719 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 18:40:03,726 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 18:40:03,729 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 18:40:03,730 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 18:40:03,736 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 18:40:03,738 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 18:40:03,742 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 18:40:03,745 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 18:40:03,749 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 18:40:03,754 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 18:40:03,756 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 18:40:03,756 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 18:40:03,757 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 18:40:03,758 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 18:40:03,760 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 18:40:03,761 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 18:40:03,765 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 18:40:03,765 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 18:40:03,766 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 18:40:03,767 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 18:40:03,767 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 18:40:03,770 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 18:40:03,772 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 18:40:03,774 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-21 18:40:03,805 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 18:40:03,805 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 18:40:03,806 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 18:40:03,807 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 18:40:03,807 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 18:40:03,807 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 18:40:03,807 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 18:40:03,808 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 18:40:03,808 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 18:40:03,808 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-21 18:40:03,808 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 18:40:03,810 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 18:40:03,811 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 18:40:03,811 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 18:40:03,811 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 18:40:03,812 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 18:40:03,812 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 18:40:03,812 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 18:40:03,812 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 18:40:03,812 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 18:40:03,812 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 18:40:03,813 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 18:40:03,813 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:40:03,813 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 18:40:03,813 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 18:40:03,813 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 18:40:03,814 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-21 18:40:03,814 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 18:40:03,814 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-21 18:40:03,814 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_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 -> 1203da81dc5c48f4dda347acec83e1939b55600b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false [2018-09-21 18:40:03,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 18:40:03,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 18:40:03,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 18:40:03,915 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 18:40:03,916 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 18:40:03,916 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270b_true-unreach-call.c [2018-09-21 18:40:04,173 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81977dafa/4a64ff0f34f74c87a85bdf36b6fd2a80/FLAG4914fbee4 [2018-09-21 18:40:04,397 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 18:40:04,397 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1270b_true-unreach-call.c [2018-09-21 18:40:04,406 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81977dafa/4a64ff0f34f74c87a85bdf36b6fd2a80/FLAG4914fbee4 [2018-09-21 18:40:04,423 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81977dafa/4a64ff0f34f74c87a85bdf36b6fd2a80 [2018-09-21 18:40:04,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 18:40:04,431 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 18:40:04,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 18:40:04,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 18:40:04,439 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 18:40:04,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:40:04" (1/1) ... [2018-09-21 18:40:04,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f661768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:04, skipping insertion in model container [2018-09-21 18:40:04,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:40:04" (1/1) ... [2018-09-21 18:40:04,457 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 18:40:04,823 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:40:04,849 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-21 18:40:04,903 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:40:04,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:04 WrapperNode [2018-09-21 18:40:04,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-21 18:40:04,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-21 18:40:04,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-21 18:40:04,964 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-21 18:40:04,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:04" (1/1) ... [2018-09-21 18:40:04,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:04" (1/1) ... [2018-09-21 18:40:04,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:04" (1/1) ... [2018-09-21 18:40:04,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:04" (1/1) ... [2018-09-21 18:40:05,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:04" (1/1) ... [2018-09-21 18:40:05,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:04" (1/1) ... [2018-09-21 18:40:05,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:04" (1/1) ... [2018-09-21 18:40:05,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-21 18:40:05,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-21 18:40:05,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-21 18:40:05,054 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-21 18:40:05,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:40:05,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-21 18:40:05,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-21 18:40:05,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-09-21 18:40:05,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_hypotf [2018-09-21 18:40:05,191 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-09-21 18:40:05,191 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-21 18:40:05,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-21 18:40:05,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-21 18:40:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-09-21 18:40:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-21 18:40:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-21 18:40:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-21 18:40:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-21 18:40:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-21 18:40:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-21 18:40:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_hypotf [2018-09-21 18:40:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-09-21 18:40:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-21 18:40:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-21 18:40:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-21 18:40:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-21 18:40:05,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-21 18:40:06,546 INFO L373 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-21 18:40:06,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:40:06 BoogieIcfgContainer [2018-09-21 18:40:06,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-21 18:40:06,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-21 18:40:06,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-21 18:40:06,552 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-21 18:40:06,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 06:40:04" (1/3) ... [2018-09-21 18:40:06,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22da6b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:40:06, skipping insertion in model container [2018-09-21 18:40:06,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:04" (2/3) ... [2018-09-21 18:40:06,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22da6b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:40:06, skipping insertion in model container [2018-09-21 18:40:06,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:40:06" (3/3) ... [2018-09-21 18:40:06,557 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270b_true-unreach-call.c [2018-09-21 18:40:06,567 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-21 18:40:06,576 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-21 18:40:06,620 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-21 18:40:06,620 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-21 18:40:06,620 INFO L382 AbstractCegarLoop]: Hoare is false [2018-09-21 18:40:06,621 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-21 18:40:06,621 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-21 18:40:06,621 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-21 18:40:06,621 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-21 18:40:06,621 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-21 18:40:06,621 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-21 18:40:06,645 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states. [2018-09-21 18:40:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-21 18:40:06,659 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:40:06,660 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:40:06,663 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:40:06,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2013009825, now seen corresponding path program 1 times [2018-09-21 18:40:06,670 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-21 18:40:06,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-21 18:40:06,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:40:06,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:40:06,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:40:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:40:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:40:06,822 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:40:06,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-21 18:40:06,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-21 18:40:06,842 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-21 18:40:06,843 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:40:06,846 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 2 states. [2018-09-21 18:40:06,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:40:06,888 INFO L93 Difference]: Finished difference Result 232 states and 254 transitions. [2018-09-21 18:40:06,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-21 18:40:06,890 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-09-21 18:40:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:40:06,907 INFO L225 Difference]: With dead ends: 232 [2018-09-21 18:40:06,907 INFO L226 Difference]: Without dead ends: 228 [2018-09-21 18:40:06,909 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:40:06,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-09-21 18:40:06,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-09-21 18:40:06,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-09-21 18:40:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 250 transitions. [2018-09-21 18:40:06,971 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 250 transitions. Word has length 28 [2018-09-21 18:40:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:40:06,971 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 250 transitions. [2018-09-21 18:40:06,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-21 18:40:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 250 transitions. [2018-09-21 18:40:06,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-21 18:40:06,976 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:40:06,976 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:40:06,976 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:40:06,977 INFO L82 PathProgramCache]: Analyzing trace with hash 237649631, now seen corresponding path program 1 times [2018-09-21 18:40:06,977 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-21 18:40:06,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-21 18:40:06,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:40:06,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:40:06,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:40:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-21 18:40:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-21 18:40:07,253 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-21 18:40:07,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 06:40:07 BoogieIcfgContainer [2018-09-21 18:40:07,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-21 18:40:07,351 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-21 18:40:07,351 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-21 18:40:07,352 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-21 18:40:07,352 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:40:06" (3/4) ... [2018-09-21 18:40:07,358 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-21 18:40:07,358 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-21 18:40:07,359 INFO L168 Benchmark]: Toolchain (without parser) took 2930.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 951.8 MB in the beginning and 1.0 GB in the end (delta: -84.2 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. [2018-09-21 18:40:07,363 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-21 18:40:07,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 531.70 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 935.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-21 18:40:07,364 INFO L168 Benchmark]: Boogie Preprocessor took 82.00 ms. Allocated memory is still 1.0 GB. Free memory was 935.7 MB in the beginning and 930.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-21 18:40:07,367 INFO L168 Benchmark]: RCFGBuilder took 1500.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 930.4 MB in the beginning and 1.1 GB in the end (delta: -146.6 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-09-21 18:40:07,368 INFO L168 Benchmark]: TraceAbstraction took 802.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. [2018-09-21 18:40:07,369 INFO L168 Benchmark]: Witness Printer took 7.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-21 18:40:07,375 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 531.70 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 935.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.00 ms. Allocated memory is still 1.0 GB. Free memory was 935.7 MB in the beginning and 930.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1500.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 930.4 MB in the beginning and 1.1 GB in the end (delta: -146.6 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 802.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. * Witness Printer took 7.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 235]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 118, overapproximation of bitwiseAnd at line 218. Possible FailurePath: [L12] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [\old(one_sqrt)=10737418246, \old(tiny_sqrt)=10737418251, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L229] float x = -1.0f / 0.0f; [L230] float y = __VERIFIER_nondet_float(); [L232] CALL, EXPR __ieee754_hypotf(x, y) VAL [\old(x)=10737418243, \old(y)=10737418252, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L82] float a = x, b = y, t1, t2, y1, y2, w; [L82] float a = x, b = y, t1, t2, y1, y2, w; [L82] float a = x, b = y, t1, t2, y1, y2, w; [L83] __int32_t j, k, ha, hb; VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L86] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418249:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L87] FCALL gf_u.value = (x) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418249:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L88] EXPR, FCALL gf_u.word VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418249:0}, gf_u.word=6442450944, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L88] (ha) = gf_u.word VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418249:0}, gf_u.word=6442450944, ha=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L88] FCALL (ha) = gf_u.word VAL [(ha) = gf_u.word=10737418247, \old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418249:0}, gf_u.word=6442450944, ha=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L89] COND FALSE !(0) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, ha=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L90] ha &= 0x7fffffffL VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L92] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418255:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L93] FCALL gf_u.value = (y) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418255:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L94] EXPR, FCALL gf_u.word VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418255:0}, gf_u.word=10737418240, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L94] (hb) = gf_u.word VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418255:0}, gf_u.word=10737418240, hb=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L94] FCALL (hb) = gf_u.word VAL [(hb) = gf_u.word=10737418256, \old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, gf_u={10737418255:0}, gf_u.word=10737418240, hb=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L95] COND FALSE !(0) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, hb=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L96] hb &= 0x7fffffffL VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418243, b=10737418252, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L97] COND TRUE hb > ha [L98] a = y [L99] b = x [L100] j = ha [L101] ha = hb [L102] hb = j VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418252, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L108] FCALL ieee_float_shape_type sf_u; VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418252, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418245:0}, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L109] FCALL sf_u.word = (ha) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418252, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418245:0}, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L110] EXPR, FCALL sf_u.value VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418252, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418245:0}, sf_u.value=10737418257, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L110] (a) = sf_u.value VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418245:0}, sf_u.value=10737418257, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L110] FCALL (a) = sf_u.value VAL [(a) = sf_u.value=10737418254, \old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418245:0}, sf_u.value=10737418257, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L111] COND FALSE !(0) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L113] FCALL ieee_float_shape_type sf_u; VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L114] FCALL sf_u.word = (hb) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L115] EXPR, FCALL sf_u.value VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418243, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, sf_u.value=10737418256, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L115] (b) = sf_u.value VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418256, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, sf_u.value=10737418256, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L115] FCALL (b) = sf_u.value VAL [(b) = sf_u.value=10737418253, \old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418256, ha=251658240, hb=-1, j=-1, one_sqrt=1, sf_u={10737418255:0}, sf_u.value=10737418256, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L116] COND FALSE !(0) VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418256, ha=251658240, hb=-1, j=-1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L117] COND TRUE (ha - hb) > 0xf000000L [L118] RET return a + b; VAL [\old(x)=10737418243, \old(y)=10737418252, a=10737418257, b=10737418256, ha=251658240, hb=-1, j=-1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L232] EXPR __ieee754_hypotf(x, y) VAL [__ieee754_hypotf(x, y)=10737418241, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L232] float res = __ieee754_hypotf(x, y); [L234] CALL, EXPR isinf_float(res) VAL [\old(x)=10737418241, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L212] __int32_t ix; VAL [\old(x)=10737418241, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L214] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=10737418241, gf_u={10737418244:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L215] FCALL gf_u.value = (x) VAL [\old(x)=10737418241, gf_u={10737418244:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L216] EXPR, FCALL gf_u.word VAL [\old(x)=10737418241, gf_u={10737418244:0}, gf_u.word=-6442450944, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L216] (ix) = gf_u.word VAL [\old(x)=10737418241, gf_u={10737418244:0}, gf_u.word=-6442450944, ix=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L216] FCALL (ix) = gf_u.word VAL [(ix) = gf_u.word=10737418250, \old(x)=10737418241, gf_u={10737418244:0}, gf_u.word=-6442450944, ix=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L217] COND FALSE !(0) VAL [\old(x)=10737418241, ix=-2147483648, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L218] ix &= 0x7fffffff [L219] RET return ((ix) == 0x7f800000L); VAL [\old(x)=10737418241, \result=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418241] [L234] EXPR isinf_float(res) VAL [isinf_float(res)=0, one_sqrt=1, res=10737418241, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] [L234] COND TRUE !isinf_float(res) [L235] __VERIFIER_error() VAL [one_sqrt=1, res=10737418241, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243, y=10737418252] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 232 locations, 1 error locations. UNSAFE Result, 0.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 254 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5eb3fea [2018-09-21 18:40:09,707 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 18:40:09,709 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 18:40:09,721 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 18:40:09,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 18:40:09,723 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 18:40:09,725 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 18:40:09,727 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 18:40:09,729 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 18:40:09,731 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 18:40:09,733 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 18:40:09,734 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 18:40:09,735 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 18:40:09,738 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 18:40:09,741 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 18:40:09,743 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 18:40:09,745 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 18:40:09,749 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 18:40:09,754 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 18:40:09,757 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 18:40:09,761 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 18:40:09,763 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 18:40:09,770 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 18:40:09,771 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 18:40:09,771 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 18:40:09,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 18:40:09,773 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 18:40:09,774 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 18:40:09,775 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 18:40:09,776 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 18:40:09,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 18:40:09,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 18:40:09,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 18:40:09,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 18:40:09,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 18:40:09,780 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 18:40:09,780 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-21 18:40:09,801 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 18:40:09,801 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 18:40:09,802 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 18:40:09,802 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 18:40:09,802 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 18:40:09,803 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 18:40:09,803 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 18:40:09,803 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 18:40:09,803 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 18:40:09,803 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 18:40:09,804 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 18:40:09,804 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 18:40:09,804 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 18:40:09,804 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 18:40:09,804 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-21 18:40:09,804 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-21 18:40:09,805 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 18:40:09,805 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 18:40:09,805 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 18:40:09,805 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 18:40:09,805 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 18:40:09,805 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 18:40:09,806 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 18:40:09,806 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:40:09,806 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 18:40:09,806 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 18:40:09,806 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 18:40:09,806 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-21 18:40:09,807 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 18:40:09,807 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-21 18:40:09,807 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-21 18:40:09,807 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_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 -> 1203da81dc5c48f4dda347acec83e1939b55600b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false [2018-09-21 18:40:09,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 18:40:09,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 18:40:09,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 18:40:09,876 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 18:40:09,876 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 18:40:09,877 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1270b_true-unreach-call.c [2018-09-21 18:40:10,203 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/933378443/8413339700214c5f8c39edce629c94a0/FLAG1ca425b40 [2018-09-21 18:40:10,386 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 18:40:10,387 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1270b_true-unreach-call.c [2018-09-21 18:40:10,395 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/933378443/8413339700214c5f8c39edce629c94a0/FLAG1ca425b40 [2018-09-21 18:40:10,412 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/933378443/8413339700214c5f8c39edce629c94a0 [2018-09-21 18:40:10,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 18:40:10,420 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 18:40:10,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 18:40:10,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 18:40:10,428 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 18:40:10,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:40:10" (1/1) ... [2018-09-21 18:40:10,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ea3a1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:10, skipping insertion in model container [2018-09-21 18:40:10,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:40:10" (1/1) ... [2018-09-21 18:40:10,446 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 18:40:10,767 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:40:10,791 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-21 18:40:10,888 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:40:10,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:10 WrapperNode [2018-09-21 18:40:10,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-21 18:40:10,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-21 18:40:10,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-21 18:40:10,935 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-21 18:40:10,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:10" (1/1) ... [2018-09-21 18:40:10,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:10" (1/1) ... [2018-09-21 18:40:10,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:10" (1/1) ... [2018-09-21 18:40:10,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:10" (1/1) ... [2018-09-21 18:40:11,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:10" (1/1) ... [2018-09-21 18:40:11,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:10" (1/1) ... [2018-09-21 18:40:11,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:10" (1/1) ... [2018-09-21 18:40:11,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-21 18:40:11,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-21 18:40:11,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-21 18:40:11,043 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-21 18:40:11,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:40:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-21 18:40:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-21 18:40:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-09-21 18:40:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_hypotf [2018-09-21 18:40:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-09-21 18:40:11,267 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-21 18:40:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-21 18:40:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-21 18:40:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-09-21 18:40:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-21 18:40:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-09-21 18:40:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-21 18:40:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-21 18:40:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-21 18:40:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-09-21 18:40:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_hypotf [2018-09-21 18:40:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-09-21 18:40:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-21 18:40:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-21 18:40:11,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-21 18:40:11,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2018-09-21 18:40:11,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-21 18:40:11,616 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:40:11,640 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:40:11,710 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:40:11,719 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:40:11,758 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:40:11,774 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:40:12,857 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:40:12,892 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:40:13,575 INFO L373 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-21 18:40:13,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:40:13 BoogieIcfgContainer [2018-09-21 18:40:13,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-21 18:40:13,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-21 18:40:13,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-21 18:40:13,581 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-21 18:40:13,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 06:40:10" (1/3) ... [2018-09-21 18:40:13,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1f2efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:40:13, skipping insertion in model container [2018-09-21 18:40:13,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:40:10" (2/3) ... [2018-09-21 18:40:13,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1f2efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:40:13, skipping insertion in model container [2018-09-21 18:40:13,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:40:13" (3/3) ... [2018-09-21 18:40:13,586 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270b_true-unreach-call.c [2018-09-21 18:40:13,596 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-21 18:40:13,606 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-21 18:40:13,644 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-21 18:40:13,645 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-21 18:40:13,645 INFO L382 AbstractCegarLoop]: Hoare is false [2018-09-21 18:40:13,645 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-21 18:40:13,645 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-21 18:40:13,645 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-21 18:40:13,646 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-21 18:40:13,646 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-21 18:40:13,646 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-21 18:40:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states. [2018-09-21 18:40:13,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-21 18:40:13,697 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:40:13,698 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:40:13,701 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:40:13,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1998677788, now seen corresponding path program 1 times [2018-09-21 18:40:13,710 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:40:13,711 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-21 18:40:13,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:40:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:40:13,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:40:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:40:13,838 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:40:13,854 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:40:13,854 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-21 18:40:13,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-21 18:40:13,873 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-21 18:40:13,873 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:40:13,877 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 2 states. [2018-09-21 18:40:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:40:13,914 INFO L93 Difference]: Finished difference Result 231 states and 253 transitions. [2018-09-21 18:40:13,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-21 18:40:13,916 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-09-21 18:40:13,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:40:13,931 INFO L225 Difference]: With dead ends: 231 [2018-09-21 18:40:13,932 INFO L226 Difference]: Without dead ends: 227 [2018-09-21 18:40:13,934 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:40:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-21 18:40:13,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-09-21 18:40:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-21 18:40:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 249 transitions. [2018-09-21 18:40:14,002 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 249 transitions. Word has length 27 [2018-09-21 18:40:14,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:40:14,002 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 249 transitions. [2018-09-21 18:40:14,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-21 18:40:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 249 transitions. [2018-09-21 18:40:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-21 18:40:14,007 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:40:14,007 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:40:14,008 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:40:14,008 INFO L82 PathProgramCache]: Analyzing trace with hash -711257081, now seen corresponding path program 1 times [2018-09-21 18:40:14,010 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:40:14,010 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-21 18:40:14,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:40:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:40:14,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:40:14,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:40:14,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:40:14,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:14,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:14,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:14,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:40:14,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:40:14,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:40:14,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:40:14,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:14,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:40:14,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:40:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:40:15,925 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:40:15,940 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:40:15,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-21 18:40:15,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-21 18:40:15,943 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-21 18:40:15,943 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-21 18:40:15,943 INFO L87 Difference]: Start difference. First operand 227 states and 249 transitions. Second operand 11 states. [2018-09-21 18:41:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:41:24,134 INFO L93 Difference]: Finished difference Result 528 states and 574 transitions. [2018-09-21 18:41:24,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-21 18:41:24,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-09-21 18:41:24,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:41:24,149 INFO L225 Difference]: With dead ends: 528 [2018-09-21 18:41:24,153 INFO L226 Difference]: Without dead ends: 309 [2018-09-21 18:41:24,155 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-09-21 18:41:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-09-21 18:41:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 250. [2018-09-21 18:41:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-09-21 18:41:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 272 transitions. [2018-09-21 18:41:24,198 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 272 transitions. Word has length 72 [2018-09-21 18:41:24,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:41:24,199 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 272 transitions. [2018-09-21 18:41:24,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-21 18:41:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 272 transitions. [2018-09-21 18:41:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-21 18:41:24,208 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:41:24,208 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:41:24,208 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:41:24,209 INFO L82 PathProgramCache]: Analyzing trace with hash -463110587, now seen corresponding path program 1 times [2018-09-21 18:41:24,209 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:41:24,212 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-21 18:41:24,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:41:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:41:24,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:41:24,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:41:24,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:41:24,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:41:24,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:41:24,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:41:24,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:41:24,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:41:24,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:41:24,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:41:24,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:41:24,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:41:24,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:41:25,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:41:25,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:41:25,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:41:25,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:41:25,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:41:25,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2018-09-21 18:41:25,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:41:25,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:41:25,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:41:25,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:41:25,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:41:25,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:29 [2018-09-21 18:41:25,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:41:25,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:41:25,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:41:25,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:41:25,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:41:25,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-09-21 18:41:25,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:41:25,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:41:25,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:41:26,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:41:26,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:41:26,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:38 [2018-09-21 18:41:27,816 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-21 18:41:30,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:41:30,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:41:30,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:41:30,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:41:30,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:41:30,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:41:30,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:41:30,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:41:30,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:41:30,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:41:30,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:41:30,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:41:31,753 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-21 18:41:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:41:32,578 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:41:32,598 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:41:32,598 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-09-21 18:41:32,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-21 18:41:32,599 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-21 18:41:32,599 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-09-21 18:41:32,599 INFO L87 Difference]: Start difference. First operand 250 states and 272 transitions. Second operand 24 states. [2018-09-21 18:41:36,177 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-21 18:41:36,891 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-09-21 18:41:37,247 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-21 18:41:37,768 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-09-21 18:41:47,181 WARN L178 SmtUtils]: Spent 759.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-09-21 18:41:48,871 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:41:51,041 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 18:41:54,403 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-21 18:42:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:42:08,319 INFO L93 Difference]: Finished difference Result 261 states and 286 transitions. [2018-09-21 18:42:08,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-21 18:42:08,368 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-09-21 18:42:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:42:08,370 INFO L225 Difference]: With dead ends: 261 [2018-09-21 18:42:08,370 INFO L226 Difference]: Without dead ends: 256 [2018-09-21 18:42:08,372 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=271, Invalid=2279, Unknown=0, NotChecked=0, Total=2550 [2018-09-21 18:42:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-09-21 18:42:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 250. [2018-09-21 18:42:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-09-21 18:42:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 271 transitions. [2018-09-21 18:42:08,386 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 271 transitions. Word has length 72 [2018-09-21 18:42:08,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:42:08,387 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 271 transitions. [2018-09-21 18:42:08,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-21 18:42:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 271 transitions. [2018-09-21 18:42:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-21 18:42:08,390 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:42:08,390 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:42:08,390 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:42:08,391 INFO L82 PathProgramCache]: Analyzing trace with hash -463560330, now seen corresponding path program 1 times [2018-09-21 18:42:08,391 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:42:08,391 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-21 18:42:08,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:42:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:42:08,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:42:08,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:42:08,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:42:08,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:42:08,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:42:08,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:42:08,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:42:08,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:42:08,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:42:08,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:42:08,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:42:08,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:42:08,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:42:08,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-09-21 18:42:08,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-09-21 18:42:08,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:42:08,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:42:08,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:42:08,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-21 18:42:09,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-09-21 18:42:09,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-09-21 18:42:09,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:42:09,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:42:09,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:42:09,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2018-09-21 18:42:09,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:42:09,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:42:09,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:42:09,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:42:09,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:42:09,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:42:09,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:42:09,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:42:09,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:42:09,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:42:09,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:42:09,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:42:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:42:10,262 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:42:10,280 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:42:10,280 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-09-21 18:42:10,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-21 18:42:10,281 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-21 18:42:10,281 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-21 18:42:10,282 INFO L87 Difference]: Start difference. First operand 250 states and 271 transitions. Second operand 22 states. [2018-09-21 18:42:16,095 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-21 18:43:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:43:02,268 INFO L93 Difference]: Finished difference Result 330 states and 358 transitions. [2018-09-21 18:43:02,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-21 18:43:02,269 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2018-09-21 18:43:02,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:43:02,273 INFO L225 Difference]: With dead ends: 330 [2018-09-21 18:43:02,273 INFO L226 Difference]: Without dead ends: 324 [2018-09-21 18:43:02,274 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=194, Invalid=1876, Unknown=0, NotChecked=0, Total=2070 [2018-09-21 18:43:02,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-09-21 18:43:02,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 253. [2018-09-21 18:43:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-21 18:43:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 276 transitions. [2018-09-21 18:43:02,287 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 276 transitions. Word has length 77 [2018-09-21 18:43:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:43:02,288 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 276 transitions. [2018-09-21 18:43:02,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-21 18:43:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 276 transitions. [2018-09-21 18:43:02,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-21 18:43:02,291 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:43:02,291 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:43:02,292 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:43:02,292 INFO L82 PathProgramCache]: Analyzing trace with hash -244705612, now seen corresponding path program 1 times [2018-09-21 18:43:02,292 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:43:02,292 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-21 18:43:02,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:43:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:43:02,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:43:02,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:43:02,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:43:02,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:43:02,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:43:02,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:43:02,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:43:02,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:43:02,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:43:02,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:43:02,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:43:02,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:43:02,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:43:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:43:02,717 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:43:02,727 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:43:02,727 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-21 18:43:02,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-21 18:43:02,728 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-21 18:43:02,728 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-21 18:43:02,729 INFO L87 Difference]: Start difference. First operand 253 states and 276 transitions. Second operand 10 states. [2018-09-21 18:43:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:43:57,372 INFO L93 Difference]: Finished difference Result 422 states and 454 transitions. [2018-09-21 18:43:57,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-21 18:43:57,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2018-09-21 18:43:57,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:43:57,375 INFO L225 Difference]: With dead ends: 422 [2018-09-21 18:43:57,375 INFO L226 Difference]: Without dead ends: 306 [2018-09-21 18:43:57,376 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:43:57,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-21 18:43:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 251. [2018-09-21 18:43:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-21 18:43:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 270 transitions. [2018-09-21 18:43:57,389 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 270 transitions. Word has length 77 [2018-09-21 18:43:57,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:43:57,390 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 270 transitions. [2018-09-21 18:43:57,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-21 18:43:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 270 transitions. [2018-09-21 18:43:57,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-21 18:43:57,394 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:43:57,394 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:43:57,394 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:43:57,395 INFO L82 PathProgramCache]: Analyzing trace with hash 988789622, now seen corresponding path program 1 times [2018-09-21 18:43:57,396 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:43:57,396 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-21 18:43:57,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:43:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:43:57,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:43:57,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:43:57,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:43:57,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:43:57,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:43:57,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:43:57,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-09-21 18:43:57,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:43:57,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:43:57,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:43:57,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:43:57,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:43:57,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:15 [2018-09-21 18:43:57,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:43:57,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:43:57,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:43:57,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:43:57,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:43:57,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:43:58,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:43:58,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:43:58,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:43:58,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:43:58,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:43:58,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:43:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:43:58,263 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:43:58,275 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:43:58,275 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-21 18:43:58,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-21 18:43:58,276 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-21 18:43:58,276 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-09-21 18:43:58,276 INFO L87 Difference]: Start difference. First operand 251 states and 270 transitions. Second operand 16 states. [2018-09-21 18:44:12,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:44:12,900 INFO L93 Difference]: Finished difference Result 312 states and 335 transitions. [2018-09-21 18:44:12,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-21 18:44:12,901 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2018-09-21 18:44:12,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:44:12,903 INFO L225 Difference]: With dead ends: 312 [2018-09-21 18:44:12,903 INFO L226 Difference]: Without dead ends: 306 [2018-09-21 18:44:12,904 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-09-21 18:44:12,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-21 18:44:12,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 251. [2018-09-21 18:44:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-21 18:44:12,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 269 transitions. [2018-09-21 18:44:12,912 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 269 transitions. Word has length 77 [2018-09-21 18:44:12,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:44:12,915 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 269 transitions. [2018-09-21 18:44:12,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-21 18:44:12,918 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 269 transitions. [2018-09-21 18:44:12,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-21 18:44:12,921 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:44:12,921 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:44:12,921 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:44:12,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1207644340, now seen corresponding path program 1 times [2018-09-21 18:44:12,923 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:44:12,923 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-21 18:44:12,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:44:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:44:13,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:44:13,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:44:13,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:44:13,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:44:13,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:44:13,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:44:13,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:44:13,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:44:13,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:44:13,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:44:13,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:44:13,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:44:13,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:44:13,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-09-21 18:44:13,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-09-21 18:44:13,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:44:13,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:44:13,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:44:13,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-21 18:44:13,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-09-21 18:44:13,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-09-21 18:44:13,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:44:13,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:44:13,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:44:13,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2018-09-21 18:44:13,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:44:13,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:44:13,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:44:13,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:44:13,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:44:13,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:44:13,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:44:13,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:44:13,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:44:13,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:44:13,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:44:13,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:44:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:44:14,321 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:44:14,332 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:44:14,332 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-09-21 18:44:14,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-21 18:44:14,332 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-21 18:44:14,333 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-21 18:44:14,333 INFO L87 Difference]: Start difference. First operand 251 states and 269 transitions. Second operand 21 states. [2018-09-21 18:44:34,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:44:34,309 INFO L93 Difference]: Finished difference Result 256 states and 274 transitions. [2018-09-21 18:44:34,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-21 18:44:34,311 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 77 [2018-09-21 18:44:34,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:44:34,312 INFO L225 Difference]: With dead ends: 256 [2018-09-21 18:44:34,312 INFO L226 Difference]: Without dead ends: 225 [2018-09-21 18:44:34,313 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=179, Invalid=1627, Unknown=0, NotChecked=0, Total=1806 [2018-09-21 18:44:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-21 18:44:34,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-09-21 18:44:34,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-21 18:44:34,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 242 transitions. [2018-09-21 18:44:34,320 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 242 transitions. Word has length 77 [2018-09-21 18:44:34,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:44:34,320 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 242 transitions. [2018-09-21 18:44:34,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-21 18:44:34,321 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 242 transitions. [2018-09-21 18:44:34,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-21 18:44:34,324 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:44:34,324 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:44:34,325 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:44:34,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1253625132, now seen corresponding path program 1 times [2018-09-21 18:44:34,326 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:44:34,326 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-21 18:44:34,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:44:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:44:34,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:44:34,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:44:34,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:44:34,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:44:34,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:44:34,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:44:34,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:44:34,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:44:34,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:44:34,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:44:34,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:44:34,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:44:34,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:44:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:44:35,060 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:44:35,071 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:44:35,071 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-21 18:44:35,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-21 18:44:35,072 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-21 18:44:35,073 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-21 18:44:35,073 INFO L87 Difference]: Start difference. First operand 225 states and 242 transitions. Second operand 11 states. [2018-09-21 18:45:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:45:25,891 INFO L93 Difference]: Finished difference Result 384 states and 411 transitions. [2018-09-21 18:45:25,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-21 18:45:25,892 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-09-21 18:45:25,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:45:25,894 INFO L225 Difference]: With dead ends: 384 [2018-09-21 18:45:25,894 INFO L226 Difference]: Without dead ends: 245 [2018-09-21 18:45:25,894 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-09-21 18:45:25,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-21 18:45:25,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 191. [2018-09-21 18:45:25,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-21 18:45:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 205 transitions. [2018-09-21 18:45:25,902 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 205 transitions. Word has length 96 [2018-09-21 18:45:25,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:45:25,902 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 205 transitions. [2018-09-21 18:45:25,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-21 18:45:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 205 transitions. [2018-09-21 18:45:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-21 18:45:25,906 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:45:25,906 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:45:25,906 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:45:25,906 INFO L82 PathProgramCache]: Analyzing trace with hash -621518797, now seen corresponding path program 1 times [2018-09-21 18:45:25,907 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:45:25,907 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-21 18:45:25,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:45:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:45:26,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:45:26,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:45:26,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:45:26,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:45:26,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:45:26,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:45:26,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:45:26,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:45:26,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:45:26,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:45:26,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:45:26,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:45:26,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:45:26,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-09-21 18:45:26,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-09-21 18:45:26,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:45:26,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:45:26,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:45:26,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-21 18:45:27,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-09-21 18:45:27,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-09-21 18:45:27,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:45:27,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:45:27,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:45:27,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2018-09-21 18:45:29,325 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-21 18:45:44,988 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-21 18:45:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:45:45,177 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:45:45,192 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:45:45,192 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-21 18:45:45,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-21 18:45:45,193 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-21 18:45:45,193 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=152, Unknown=4, NotChecked=0, Total=182 [2018-09-21 18:45:45,194 INFO L87 Difference]: Start difference. First operand 191 states and 205 transitions. Second operand 14 states. [2018-09-21 18:46:09,355 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-21 18:46:24,361 WARN L178 SmtUtils]: Spent 1.76 s on a formula simplification that was a NOOP. DAG size: 30 [2018-09-21 18:46:34,419 WARN L178 SmtUtils]: Spent 5.31 s on a formula simplification that was a NOOP. DAG size: 34 [2018-09-21 18:47:36,886 WARN L178 SmtUtils]: Spent 931.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-09-21 18:48:34,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:48:34,800 INFO L93 Difference]: Finished difference Result 259 states and 277 transitions. [2018-09-21 18:48:34,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-21 18:48:34,801 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 105 [2018-09-21 18:48:34,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:48:34,802 INFO L225 Difference]: With dead ends: 259 [2018-09-21 18:48:34,803 INFO L226 Difference]: Without dead ends: 232 [2018-09-21 18:48:34,803 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 64.9s TimeCoverageRelationStatistics Valid=141, Invalid=714, Unknown=15, NotChecked=0, Total=870 [2018-09-21 18:48:34,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-09-21 18:48:34,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2018-09-21 18:48:34,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-21 18:48:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 208 transitions. [2018-09-21 18:48:34,809 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 208 transitions. Word has length 105 [2018-09-21 18:48:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:48:34,809 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 208 transitions. [2018-09-21 18:48:34,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-21 18:48:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 208 transitions. [2018-09-21 18:48:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-21 18:48:34,811 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:48:34,811 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:48:34,811 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:48:34,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1651996947, now seen corresponding path program 1 times [2018-09-21 18:48:34,815 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:48:34,815 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-21 18:48:34,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:48:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:48:35,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:48:35,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:48:35,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:48:35,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:48:35,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:48:35,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:48:35,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:48:35,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:48:35,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:48:35,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:48:35,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:48:35,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:48:35,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:48:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:48:36,179 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:48:36,197 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:48:36,197 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-21 18:48:36,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-21 18:48:36,198 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-21 18:48:36,198 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-21 18:48:36,198 INFO L87 Difference]: Start difference. First operand 194 states and 208 transitions. Second operand 11 states. [2018-09-21 18:49:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:49:08,689 INFO L93 Difference]: Finished difference Result 232 states and 247 transitions. [2018-09-21 18:49:08,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-21 18:49:08,690 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2018-09-21 18:49:08,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:49:08,692 INFO L225 Difference]: With dead ends: 232 [2018-09-21 18:49:08,692 INFO L226 Difference]: Without dead ends: 191 [2018-09-21 18:49:08,692 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:49:08,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-21 18:49:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-09-21 18:49:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-21 18:49:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 204 transitions. [2018-09-21 18:49:08,697 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 204 transitions. Word has length 116 [2018-09-21 18:49:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:49:08,697 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 204 transitions. [2018-09-21 18:49:08,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-21 18:49:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 204 transitions. [2018-09-21 18:49:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-21 18:49:08,700 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:49:08,700 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:49:08,701 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:49:08,701 INFO L82 PathProgramCache]: Analyzing trace with hash -58261069, now seen corresponding path program 1 times [2018-09-21 18:49:08,703 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:49:08,703 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-21 18:49:08,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:49:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:49:09,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:49:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:49:09,220 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:49:09,240 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:49:09,240 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-21 18:49:09,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-21 18:49:09,241 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-21 18:49:09,241 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:49:09,243 INFO L87 Difference]: Start difference. First operand 191 states and 204 transitions. Second operand 4 states. [2018-09-21 18:49:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:49:13,652 INFO L93 Difference]: Finished difference Result 191 states and 203 transitions. [2018-09-21 18:49:13,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-21 18:49:13,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-09-21 18:49:13,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:49:13,707 INFO L225 Difference]: With dead ends: 191 [2018-09-21 18:49:13,707 INFO L226 Difference]: Without dead ends: 191 [2018-09-21 18:49:13,708 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:49:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-21 18:49:13,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-09-21 18:49:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-21 18:49:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2018-09-21 18:49:13,714 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 126 [2018-09-21 18:49:13,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:49:13,714 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2018-09-21 18:49:13,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-21 18:49:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2018-09-21 18:49:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-21 18:49:13,716 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:49:13,716 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:49:13,716 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:49:13,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2018577566, now seen corresponding path program 1 times [2018-09-21 18:49:13,717 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:49:13,717 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-21 18:49:13,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:49:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:49:14,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:49:14,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:49:14,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:49:14,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:49:14,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:49:14,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:49:14,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:49:14,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:49:14,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:49:14,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:49:14,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:49:14,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:49:14,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:49:15,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:49:15,321 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:49:15,338 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:49:15,338 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-21 18:49:15,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-21 18:49:15,339 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-21 18:49:15,339 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-21 18:49:15,339 INFO L87 Difference]: Start difference. First operand 191 states and 203 transitions. Second operand 12 states. [2018-09-21 18:49:39,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:49:39,639 INFO L93 Difference]: Finished difference Result 205 states and 216 transitions. [2018-09-21 18:49:39,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-21 18:49:39,640 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2018-09-21 18:49:39,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:49:39,641 INFO L225 Difference]: With dead ends: 205 [2018-09-21 18:49:39,641 INFO L226 Difference]: Without dead ends: 178 [2018-09-21 18:49:39,642 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-09-21 18:49:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-21 18:49:39,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-09-21 18:49:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-09-21 18:49:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 188 transitions. [2018-09-21 18:49:39,647 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 188 transitions. Word has length 137 [2018-09-21 18:49:39,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:49:39,647 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 188 transitions. [2018-09-21 18:49:39,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-21 18:49:39,647 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 188 transitions. [2018-09-21 18:49:39,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-21 18:49:39,648 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:49:39,650 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:49:39,650 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:49:39,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1803771518, now seen corresponding path program 1 times [2018-09-21 18:49:39,651 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:49:39,651 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-21 18:49:39,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-21 18:49:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:49:40,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:49:40,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:49:40,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:49:40,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:49:40,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:49:40,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:49:40,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:49:40,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:49:40,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:49:40,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:49:40,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:49:40,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:49:40,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:49:41,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:49:41,268 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:49:41,285 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:49:41,285 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-21 18:49:41,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-21 18:49:41,286 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-21 18:49:41,286 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-21 18:49:41,286 INFO L87 Difference]: Start difference. First operand 178 states and 188 transitions. Second operand 12 states. [2018-09-21 18:49:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:49:53,737 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2018-09-21 18:49:53,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-21 18:49:53,738 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2018-09-21 18:49:53,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:49:53,739 INFO L225 Difference]: With dead ends: 159 [2018-09-21 18:49:53,739 INFO L226 Difference]: Without dead ends: 0 [2018-09-21 18:49:53,739 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-09-21 18:49:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-21 18:49:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-21 18:49:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-21 18:49:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-21 18:49:53,740 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 148 [2018-09-21 18:49:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:49:53,740 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-21 18:49:53,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-21 18:49:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-21 18:49:53,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-21 18:49:53,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 06:49:53 BoogieIcfgContainer [2018-09-21 18:49:53,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-21 18:49:53,746 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-21 18:49:53,746 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-21 18:49:53,746 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-21 18:49:53,747 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:40:13" (3/4) ... [2018-09-21 18:49:53,750 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-21 18:49:53,757 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-21 18:49:53,758 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_float [2018-09-21 18:49:53,758 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-21 18:49:53,758 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_hypotf [2018-09-21 18:49:53,758 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_sqrtf [2018-09-21 18:49:53,778 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2018-09-21 18:49:53,779 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-09-21 18:49:53,779 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-09-21 18:49:53,878 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-21 18:49:53,878 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-21 18:49:53,879 INFO L168 Benchmark]: Toolchain (without parser) took 583462.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 251.1 MB). Free memory was 953.2 MB in the beginning and 924.0 MB in the end (delta: 29.2 MB). Peak memory consumption was 280.4 MB. Max. memory is 11.5 GB. [2018-09-21 18:49:53,880 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-21 18:49:53,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 513.69 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-21 18:49:53,881 INFO L168 Benchmark]: Boogie Preprocessor took 107.27 ms. Allocated memory is still 1.0 GB. Free memory was 937.1 MB in the beginning and 931.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-21 18:49:53,881 INFO L168 Benchmark]: RCFGBuilder took 2533.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-09-21 18:49:53,881 INFO L168 Benchmark]: TraceAbstraction took 580168.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 88.6 MB). Free memory was 1.1 GB in the beginning and 933.2 MB in the end (delta: 152.6 MB). Peak memory consumption was 241.2 MB. Max. memory is 11.5 GB. [2018-09-21 18:49:53,882 INFO L168 Benchmark]: Witness Printer took 132.23 ms. Allocated memory is still 1.3 GB. Free memory was 933.2 MB in the beginning and 924.0 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2018-09-21 18:49:53,887 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 513.69 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 107.27 ms. Allocated memory is still 1.0 GB. Free memory was 937.1 MB in the beginning and 931.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2533.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 580168.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 88.6 MB). Free memory was 1.1 GB in the beginning and 933.2 MB in the end (delta: 152.6 MB). Peak memory consumption was 241.2 MB. Max. memory is 11.5 GB. * Witness Printer took 132.23 ms. Allocated memory is still 1.3 GB. Free memory was 933.2 MB in the beginning and 924.0 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 235]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 231 locations, 1 error locations. SAFE Result, 580.1s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 539.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3286 SDtfs, 3682 SDslu, 27955 SDs, 0 SdLazy, 4709 SolverSat, 168 SolverUnsat, 175 SolverUnknown, 0 SolverNotchecked, 462.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1356 GetRequests, 1050 SyntacticMatches, 0 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1479 ImplicationChecksByTransitivity, 101.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 338 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 36.6s InterpolantComputationTime, 1207 NumberOfCodeBlocks, 1207 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1194 ConstructedInterpolants, 587 QuantifiedInterpolants, 1428563 SizeOfPredicates, 140 NumberOfNonLiveVariables, 2267 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...