/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/float_req_bl_0684b_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_0684b_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 257f0fae8650c1e4803d7d611e8fd1306d4688fe --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_0684b_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 257f0fae8650c1e4803d7d611e8fd1306d4688fe --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:25:01,501 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 18:25:01,503 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 18:25:01,515 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 18:25:01,516 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 18:25:01,517 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 18:25:01,518 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 18:25:01,521 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 18:25:01,523 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 18:25:01,524 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 18:25:01,525 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 18:25:01,525 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 18:25:01,526 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 18:25:01,527 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 18:25:01,528 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 18:25:01,530 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 18:25:01,531 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 18:25:01,533 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 18:25:01,535 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 18:25:01,537 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 18:25:01,539 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 18:25:01,540 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 18:25:01,543 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 18:25:01,543 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 18:25:01,543 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 18:25:01,545 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 18:25:01,546 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 18:25:01,547 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 18:25:01,548 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 18:25:01,549 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 18:25:01,550 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 18:25:01,551 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 18:25:01,551 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 18:25:01,551 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 18:25:01,552 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 18:25:01,553 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 18:25:01,554 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:25:01,570 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 18:25:01,570 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 18:25:01,571 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 18:25:01,571 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 18:25:01,572 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 18:25:01,572 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 18:25:01,573 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 18:25:01,573 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 18:25:01,573 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 18:25:01,574 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-21 18:25:01,574 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 18:25:01,574 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 18:25:01,574 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 18:25:01,574 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 18:25:01,575 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 18:25:01,575 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 18:25:01,576 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 18:25:01,576 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 18:25:01,576 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 18:25:01,576 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 18:25:01,577 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 18:25:01,577 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 18:25:01,577 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:25:01,578 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 18:25:01,578 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 18:25:01,578 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 18:25:01,578 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-21 18:25:01,578 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 18:25:01,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-21 18:25:01,579 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 -> 257f0fae8650c1e4803d7d611e8fd1306d4688fe 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:25:01,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 18:25:01,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 18:25:01,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 18:25:01,652 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 18:25:01,653 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 18:25:01,654 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_0684b_true-unreach-call.c [2018-09-21 18:25:02,019 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce44742e/debd8563e22d44faa7bc8f7df1944809/FLAG9b1ff22f2 [2018-09-21 18:25:02,217 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 18:25:02,218 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_0684b_true-unreach-call.c [2018-09-21 18:25:02,229 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce44742e/debd8563e22d44faa7bc8f7df1944809/FLAG9b1ff22f2 [2018-09-21 18:25:02,248 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce44742e/debd8563e22d44faa7bc8f7df1944809 [2018-09-21 18:25:02,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 18:25:02,254 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 18:25:02,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 18:25:02,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 18:25:02,263 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 18:25:02,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:25:02" (1/1) ... [2018-09-21 18:25:02,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d4b36e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:02, skipping insertion in model container [2018-09-21 18:25:02,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:25:02" (1/1) ... [2018-09-21 18:25:02,280 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 18:25:02,562 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:25:02,592 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-21 18:25:02,688 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:25:02,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:02 WrapperNode [2018-09-21 18:25:02,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-21 18:25:02,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-21 18:25:02,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-21 18:25:02,735 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-21 18:25:02,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:02" (1/1) ... [2018-09-21 18:25:02,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:02" (1/1) ... [2018-09-21 18:25:02,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:02" (1/1) ... [2018-09-21 18:25:02,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:02" (1/1) ... [2018-09-21 18:25:02,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:02" (1/1) ... [2018-09-21 18:25:02,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:02" (1/1) ... [2018-09-21 18:25:02,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:02" (1/1) ... [2018-09-21 18:25:02,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-21 18:25:02,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-21 18:25:02,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-21 18:25:02,797 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-21 18:25:02,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:02" (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:25:02,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-21 18:25:02,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-21 18:25:02,952 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2018-09-21 18:25:02,953 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2018-09-21 18:25:02,953 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_atan2f [2018-09-21 18:25:02,953 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_float [2018-09-21 18:25:02,953 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-21 18:25:02,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-21 18:25:02,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-21 18:25:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2018-09-21 18:25:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-21 18:25:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-21 18:25:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-21 18:25:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-21 18:25:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-21 18:25:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-21 18:25:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2018-09-21 18:25:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_atan2f [2018-09-21 18:25:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_float [2018-09-21 18:25:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-21 18:25:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-21 18:25:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-21 18:25:02,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-21 18:25:02,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-21 18:25:04,186 INFO L373 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-21 18:25:04,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:25:04 BoogieIcfgContainer [2018-09-21 18:25:04,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-21 18:25:04,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-21 18:25:04,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-21 18:25:04,191 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-21 18:25:04,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 06:25:02" (1/3) ... [2018-09-21 18:25:04,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6681eea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:25:04, skipping insertion in model container [2018-09-21 18:25:04,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:02" (2/3) ... [2018-09-21 18:25:04,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6681eea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:25:04, skipping insertion in model container [2018-09-21 18:25:04,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:25:04" (3/3) ... [2018-09-21 18:25:04,196 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0684b_true-unreach-call.c [2018-09-21 18:25:04,204 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-21 18:25:04,212 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-21 18:25:04,251 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-21 18:25:04,252 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-21 18:25:04,252 INFO L382 AbstractCegarLoop]: Hoare is false [2018-09-21 18:25:04,252 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-21 18:25:04,252 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-21 18:25:04,253 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-21 18:25:04,253 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-21 18:25:04,253 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-21 18:25:04,253 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-21 18:25:04,274 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2018-09-21 18:25:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-21 18:25:04,287 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:25:04,288 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] [2018-09-21 18:25:04,291 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:25:04,297 INFO L82 PathProgramCache]: Analyzing trace with hash 412578962, now seen corresponding path program 1 times [2018-09-21 18:25:04,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-21 18:25:04,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-21 18:25:04,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:25:04,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:25:04,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:25:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:25:04,481 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:25:04,484 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:25:04,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-21 18:25:04,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-21 18:25:04,506 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-21 18:25:04,507 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:25:04,509 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 2 states. [2018-09-21 18:25:04,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:25:04,543 INFO L93 Difference]: Finished difference Result 173 states and 213 transitions. [2018-09-21 18:25:04,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-21 18:25:04,546 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-09-21 18:25:04,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:25:04,560 INFO L225 Difference]: With dead ends: 173 [2018-09-21 18:25:04,560 INFO L226 Difference]: Without dead ends: 168 [2018-09-21 18:25:04,562 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:25:04,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-09-21 18:25:04,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-09-21 18:25:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-21 18:25:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 207 transitions. [2018-09-21 18:25:04,622 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 207 transitions. Word has length 26 [2018-09-21 18:25:04,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:25:04,622 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 207 transitions. [2018-09-21 18:25:04,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-21 18:25:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 207 transitions. [2018-09-21 18:25:04,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-21 18:25:04,625 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:25:04,626 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] [2018-09-21 18:25:04,626 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:25:04,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1377003294, now seen corresponding path program 1 times [2018-09-21 18:25:04,627 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-21 18:25:04,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-21 18:25:04,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:25:04,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:25:04,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:25:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-21 18:25:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-21 18:25:04,931 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-21 18:25:05,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 06:25:05 BoogieIcfgContainer [2018-09-21 18:25:05,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-21 18:25:05,025 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-21 18:25:05,026 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-21 18:25:05,026 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-21 18:25:05,028 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:25:04" (3/4) ... [2018-09-21 18:25:05,035 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-21 18:25:05,036 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-21 18:25:05,037 INFO L168 Benchmark]: Toolchain (without parser) took 2785.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 951.9 MB in the beginning and 1.1 GB in the end (delta: -104.4 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-09-21 18:25:05,040 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:25:05,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.86 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 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:25:05,043 INFO L168 Benchmark]: Boogie Preprocessor took 61.65 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:25:05,046 INFO L168 Benchmark]: RCFGBuilder took 1389.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 930.4 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-09-21 18:25:05,047 INFO L168 Benchmark]: TraceAbstraction took 837.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-09-21 18:25:05,048 INFO L168 Benchmark]: Witness Printer took 10.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-21 18:25:05,054 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 478.86 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 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 61.65 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 1389.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 930.4 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 837.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. * Witness Printer took 10.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 243]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 242, overapproximation of someUnaryDOUBLEoperation at line 42, overapproximation of bitwiseAnd at line 133, overapproximation of someBinaryArithmeticFLOAToperation at line 135. Possible FailurePath: [L27-L32] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L27-L32] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L27-L32] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L27-L32] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L34-L39] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L34-L39] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L34-L39] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L34-L39] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L47-L49] static const float one_atan = 1.0, huge_atan = 1.0e30, pi_o_4 = 7.8539818525e-01, pi_o_2 = 1.5707963705e+00, pi = 3.1415927410e+00; [L115-L116] static const float tiny_atan2 = 1.0e-30, zero_atan2 = 0.0, pi_lo_atan2 = -8.7422776573e-08; VAL [\old(huge_atan)=10737418255, \old(one_atan)=10737418241, \old(pi)=10737418250, \old(pi_lo_atan2)=10737418263, \old(pi_o_2)=10737418242, \old(pi_o_4)=10737418247, \old(tiny_atan2)=10737418257, \old(zero_atan2)=10737418256, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L234] float x = __VERIFIER_nondet_float(); [L235] float y = -1.0f / 0.0f; VAL [huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L237] CALL isfinite_float(x) VAL [\old(x)=10737418248, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L217] __int32_t ix; VAL [\old(x)=10737418248, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L219] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=10737418248, gf_u={10737418258:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L220] FCALL gf_u.value = (x) VAL [\old(x)=10737418248, gf_u={10737418258:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L221] EXPR, FCALL gf_u.word VAL [\old(x)=10737418248, gf_u={10737418258:0}, gf_u.word=10737418240, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L221] (ix) = gf_u.word VAL [\old(x)=10737418248, gf_u={10737418258:0}, gf_u.word=10737418240, huge_atan=1000000000000000000000000000000, ix=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L221] FCALL (ix) = gf_u.word VAL [(ix) = gf_u.word=10737418254, \old(x)=10737418248, gf_u={10737418258:0}, gf_u.word=10737418240, huge_atan=1000000000000000000000000000000, ix=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L222] COND FALSE !(0) VAL [\old(x)=10737418248, huge_atan=1000000000000000000000000000000, ix=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L223] ix &= 0x7fffffff [L224] RET return (((ix) < 0x7f800000L)); VAL [\old(x)=10737418248, \result=1, huge_atan=1000000000000000000000000000000, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L237] isfinite_float(x) VAL [huge_atan=1000000000000000000000000000000, isfinite_float(x)=1, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L237] COND TRUE isfinite_float(x) [L239] CALL, EXPR __ieee754_atan2f(y, x) VAL [\old(x)=10737418248, \old(y)=10737418243, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L119] float z; [L120] __int32_t k, m, hx, hy, ix, iy; VAL [\old(x)=10737418248, \old(y)=10737418243, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L123] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=10737418248, \old(y)=10737418243, gf_u={10737418258:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L124] FCALL gf_u.value = (x) VAL [\old(x)=10737418248, \old(y)=10737418243, gf_u={10737418258:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L125] EXPR, FCALL gf_u.word VAL [\old(x)=10737418248, \old(y)=10737418243, gf_u={10737418258:0}, gf_u.word=10737418240, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L125] (hx) = gf_u.word VAL [\old(x)=10737418248, \old(y)=10737418243, gf_u={10737418258:0}, gf_u.word=10737418240, huge_atan=1000000000000000000000000000000, hx=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L125] FCALL (hx) = gf_u.word VAL [(hx) = gf_u.word=10737418246, \old(x)=10737418248, \old(y)=10737418243, gf_u={10737418258:0}, gf_u.word=10737418240, huge_atan=1000000000000000000000000000000, hx=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L126] COND FALSE !(0) VAL [\old(x)=10737418248, \old(y)=10737418243, huge_atan=1000000000000000000000000000000, hx=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L127] ix = hx & 0x7fffffff VAL [\old(x)=10737418248, \old(y)=10737418243, huge_atan=1000000000000000000000000000000, hx=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L129] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=10737418248, \old(y)=10737418243, gf_u={10737418261:0}, huge_atan=1000000000000000000000000000000, hx=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L130] FCALL gf_u.value = (y) VAL [\old(x)=10737418248, \old(y)=10737418243, gf_u={10737418261:0}, huge_atan=1000000000000000000000000000000, hx=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L131] EXPR, FCALL gf_u.word VAL [\old(x)=10737418248, \old(y)=10737418243, gf_u={10737418261:0}, gf_u.word=-6442450944, huge_atan=1000000000000000000000000000000, hx=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L131] (hy) = gf_u.word VAL [\old(x)=10737418248, \old(y)=10737418243, gf_u={10737418261:0}, gf_u.word=-6442450944, huge_atan=1000000000000000000000000000000, hx=-2147483648, hy=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L131] FCALL (hy) = gf_u.word VAL [(hy) = gf_u.word=10737418249, \old(x)=10737418248, \old(y)=10737418243, gf_u={10737418261:0}, gf_u.word=-6442450944, huge_atan=1000000000000000000000000000000, hx=-2147483648, hy=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L132] COND FALSE !(0) VAL [\old(x)=10737418248, \old(y)=10737418243, huge_atan=1000000000000000000000000000000, hx=-2147483648, hy=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L133] iy = hy & 0x7fffffff VAL [\old(x)=10737418248, \old(y)=10737418243, huge_atan=1000000000000000000000000000000, hx=-2147483648, hy=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L134] COND TRUE ((ix) > 0x7f800000L) || ((iy) > 0x7f800000L) [L135] RET return x + y; VAL [\old(x)=10737418248, \old(y)=10737418243, huge_atan=1000000000000000000000000000000, hx=-2147483648, hy=-2147483648, ix=2139095041, iy=2139095041, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L239] EXPR __ieee754_atan2f(y, x) VAL [__ieee754_atan2f(y, x)=10737418253, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L239] float res = __ieee754_atan2f(y, x); [L242] COND TRUE res != -pi_o_2 VAL [huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=10737418253, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L243] __VERIFIER_error() VAL [huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=10737418253, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 173 locations, 1 error locations. UNSAFE Result, 0.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 213 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=173occurred 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, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 625 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:25:07,446 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 18:25:07,448 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 18:25:07,461 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 18:25:07,462 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 18:25:07,463 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 18:25:07,464 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 18:25:07,467 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 18:25:07,469 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 18:25:07,470 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 18:25:07,471 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 18:25:07,471 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 18:25:07,472 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 18:25:07,474 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 18:25:07,475 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 18:25:07,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 18:25:07,477 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 18:25:07,479 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 18:25:07,481 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 18:25:07,483 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 18:25:07,484 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 18:25:07,486 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 18:25:07,488 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 18:25:07,489 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 18:25:07,489 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 18:25:07,490 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 18:25:07,491 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 18:25:07,492 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 18:25:07,493 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 18:25:07,494 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 18:25:07,494 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 18:25:07,495 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 18:25:07,496 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 18:25:07,496 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 18:25:07,497 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 18:25:07,498 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 18:25:07,498 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:25:07,529 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 18:25:07,529 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 18:25:07,530 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 18:25:07,531 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 18:25:07,532 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 18:25:07,533 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 18:25:07,534 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 18:25:07,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 18:25:07,534 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 18:25:07,534 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 18:25:07,535 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 18:25:07,535 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 18:25:07,536 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 18:25:07,536 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 18:25:07,536 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-21 18:25:07,537 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-21 18:25:07,537 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 18:25:07,537 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 18:25:07,537 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 18:25:07,539 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 18:25:07,539 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 18:25:07,539 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 18:25:07,540 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 18:25:07,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:25:07,540 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 18:25:07,540 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 18:25:07,540 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 18:25:07,542 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-21 18:25:07,542 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 18:25:07,542 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-21 18:25:07,543 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-21 18:25:07,543 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 -> 257f0fae8650c1e4803d7d611e8fd1306d4688fe 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:25:07,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 18:25:07,612 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 18:25:07,616 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 18:25:07,618 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 18:25:07,619 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 18:25:07,619 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_0684b_true-unreach-call.c [2018-09-21 18:25:07,991 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38789f644/5f2707ea34494a569b7e22f19caff5f6/FLAG410eefc34 [2018-09-21 18:25:08,226 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 18:25:08,227 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_0684b_true-unreach-call.c [2018-09-21 18:25:08,239 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38789f644/5f2707ea34494a569b7e22f19caff5f6/FLAG410eefc34 [2018-09-21 18:25:08,263 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38789f644/5f2707ea34494a569b7e22f19caff5f6 [2018-09-21 18:25:08,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 18:25:08,274 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 18:25:08,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 18:25:08,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 18:25:08,286 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 18:25:08,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:25:08" (1/1) ... [2018-09-21 18:25:08,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b836825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:08, skipping insertion in model container [2018-09-21 18:25:08,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:25:08" (1/1) ... [2018-09-21 18:25:08,305 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 18:25:08,628 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:25:08,670 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-21 18:25:08,744 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:25:08,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:08 WrapperNode [2018-09-21 18:25:08,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-21 18:25:08,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-21 18:25:08,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-21 18:25:08,790 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-21 18:25:08,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:08" (1/1) ... [2018-09-21 18:25:08,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:08" (1/1) ... [2018-09-21 18:25:08,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:08" (1/1) ... [2018-09-21 18:25:08,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:08" (1/1) ... [2018-09-21 18:25:08,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:08" (1/1) ... [2018-09-21 18:25:08,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:08" (1/1) ... [2018-09-21 18:25:08,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:08" (1/1) ... [2018-09-21 18:25:08,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-21 18:25:08,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-21 18:25:08,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-21 18:25:08,881 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-21 18:25:08,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:08" (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:25:09,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-21 18:25:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-21 18:25:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2018-09-21 18:25:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2018-09-21 18:25:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_atan2f [2018-09-21 18:25:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_float [2018-09-21 18:25:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-21 18:25:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-21 18:25:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-21 18:25:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2018-09-21 18:25:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-21 18:25:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-09-21 18:25:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-21 18:25:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-21 18:25:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-21 18:25:09,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-09-21 18:25:09,054 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2018-09-21 18:25:09,054 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_atan2f [2018-09-21 18:25:09,054 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_float [2018-09-21 18:25:09,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-21 18:25:09,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-21 18:25:09,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-21 18:25:09,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2018-09-21 18:25:09,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-21 18:25:09,325 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:25:09,366 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:25:09,449 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:25:09,468 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:25:10,385 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:25:10,412 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:25:11,329 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:25:11,353 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:25:13,479 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:25:13,486 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:25:16,544 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:25:18,710 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:25:22,511 INFO L373 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-21 18:25:22,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:25:22 BoogieIcfgContainer [2018-09-21 18:25:22,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-21 18:25:22,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-21 18:25:22,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-21 18:25:22,517 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-21 18:25:22,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 06:25:08" (1/3) ... [2018-09-21 18:25:22,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9b086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:25:22, skipping insertion in model container [2018-09-21 18:25:22,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:25:08" (2/3) ... [2018-09-21 18:25:22,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9b086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:25:22, skipping insertion in model container [2018-09-21 18:25:22,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:25:22" (3/3) ... [2018-09-21 18:25:22,525 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0684b_true-unreach-call.c [2018-09-21 18:25:22,535 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-21 18:25:22,544 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-21 18:25:22,585 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-21 18:25:22,586 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-21 18:25:22,587 INFO L382 AbstractCegarLoop]: Hoare is false [2018-09-21 18:25:22,587 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-21 18:25:22,587 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-21 18:25:22,587 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-21 18:25:22,587 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-21 18:25:22,587 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-21 18:25:22,588 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-21 18:25:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states. [2018-09-21 18:25:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-21 18:25:22,623 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:25:22,624 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] [2018-09-21 18:25:22,627 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:25:22,631 INFO L82 PathProgramCache]: Analyzing trace with hash -516610885, now seen corresponding path program 1 times [2018-09-21 18:25:22,636 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:25:22,637 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:25:22,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:25:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:25:22,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:25:22,810 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:25:22,811 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:25:22,827 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:25:22,828 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-21 18:25:22,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-21 18:25:22,848 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-21 18:25:22,849 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:25:22,853 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 2 states. [2018-09-21 18:25:22,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:25:22,885 INFO L93 Difference]: Finished difference Result 172 states and 212 transitions. [2018-09-21 18:25:22,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-21 18:25:22,887 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-09-21 18:25:22,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:25:22,905 INFO L225 Difference]: With dead ends: 172 [2018-09-21 18:25:22,911 INFO L226 Difference]: Without dead ends: 167 [2018-09-21 18:25:22,913 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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:25:22,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-21 18:25:22,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-21 18:25:22,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-21 18:25:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 206 transitions. [2018-09-21 18:25:22,990 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 206 transitions. Word has length 25 [2018-09-21 18:25:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:25:22,992 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 206 transitions. [2018-09-21 18:25:22,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-21 18:25:22,993 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 206 transitions. [2018-09-21 18:25:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-21 18:25:22,995 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:25:22,995 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] [2018-09-21 18:25:22,996 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:25:22,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2008941523, now seen corresponding path program 1 times [2018-09-21 18:25:22,998 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:25:22,998 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:25:23,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:25:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:25:23,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:25:23,236 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:25:23,252 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:25:23,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:23,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:23,271 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:25:23,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:25:23,306 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:25:23,319 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:25:23,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:23,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:23,353 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:25:23,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:25:23,777 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-09-21 18:25:24,132 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-21 18:25:24,543 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:25:24,550 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:25:24,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:24,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:24,605 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:25:24,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-21 18:25:24,721 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:25:24,729 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:25:24,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:24,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:24,763 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:25:24,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-21 18:25:25,073 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:25:25,096 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:25:25,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:25,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:25,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:25:25,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:36 [2018-09-21 18:25:25,263 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:25:25,270 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:25:25,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:25,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:25,294 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:25:25,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:24 [2018-09-21 18:25:26,026 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2018-09-21 18:25:26,073 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:25:26,073 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:25:26,089 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:25:26,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-09-21 18:25:26,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-21 18:25:26,093 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-21 18:25:26,094 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:25:26,094 INFO L87 Difference]: Start difference. First operand 167 states and 206 transitions. Second operand 20 states. [2018-09-21 18:25:30,205 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-09-21 18:25:33,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:25:33,541 INFO L93 Difference]: Finished difference Result 169 states and 207 transitions. [2018-09-21 18:25:33,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-21 18:25:33,543 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-09-21 18:25:33,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:25:33,546 INFO L225 Difference]: With dead ends: 169 [2018-09-21 18:25:33,546 INFO L226 Difference]: Without dead ends: 167 [2018-09-21 18:25:33,548 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2018-09-21 18:25:33,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-21 18:25:33,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-21 18:25:33,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-21 18:25:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 205 transitions. [2018-09-21 18:25:33,565 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 205 transitions. Word has length 52 [2018-09-21 18:25:33,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:25:33,566 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 205 transitions. [2018-09-21 18:25:33,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-21 18:25:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 205 transitions. [2018-09-21 18:25:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-21 18:25:33,569 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:25:33,569 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] [2018-09-21 18:25:33,569 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:25:33,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1514815398, now seen corresponding path program 1 times [2018-09-21 18:25:33,571 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:25:33,571 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:25:33,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:25:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:25:33,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:25:33,926 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-21 18:25:34,059 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-21 18:25:34,242 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:25:34,242 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:25:34,256 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:25:34,256 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-21 18:25:34,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-21 18:25:34,256 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-21 18:25:34,257 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-21 18:25:34,257 INFO L87 Difference]: Start difference. First operand 167 states and 205 transitions. Second operand 7 states. [2018-09-21 18:25:47,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:25:47,686 INFO L93 Difference]: Finished difference Result 172 states and 209 transitions. [2018-09-21 18:25:47,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-21 18:25:47,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-09-21 18:25:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:25:47,691 INFO L225 Difference]: With dead ends: 172 [2018-09-21 18:25:47,694 INFO L226 Difference]: Without dead ends: 167 [2018-09-21 18:25:47,695 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:25:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-21 18:25:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-21 18:25:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-21 18:25:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 204 transitions. [2018-09-21 18:25:47,710 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 204 transitions. Word has length 57 [2018-09-21 18:25:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:25:47,711 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 204 transitions. [2018-09-21 18:25:47,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-21 18:25:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 204 transitions. [2018-09-21 18:25:47,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-21 18:25:47,716 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:25:47,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] [2018-09-21 18:25:47,717 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:25:47,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1005144536, now seen corresponding path program 1 times [2018-09-21 18:25:47,717 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:25:47,718 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:25:47,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:25:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:25:47,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:25:47,892 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:25:47,897 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:25:47,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:47,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:47,916 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:25:47,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:25:47,955 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:25:47,959 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:25:47,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:47,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:47,971 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:25:47,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:25:48,057 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:25:48,057 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:25:48,069 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:25:48,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-21 18:25:48,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-21 18:25:48,070 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-21 18:25:48,070 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-21 18:25:48,070 INFO L87 Difference]: Start difference. First operand 167 states and 204 transitions. Second operand 8 states. [2018-09-21 18:25:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:25:50,595 INFO L93 Difference]: Finished difference Result 170 states and 206 transitions. [2018-09-21 18:25:50,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-21 18:25:50,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-09-21 18:25:50,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:25:50,599 INFO L225 Difference]: With dead ends: 170 [2018-09-21 18:25:50,599 INFO L226 Difference]: Without dead ends: 165 [2018-09-21 18:25:50,600 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-09-21 18:25:50,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-21 18:25:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-21 18:25:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-21 18:25:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 200 transitions. [2018-09-21 18:25:50,614 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 200 transitions. Word has length 57 [2018-09-21 18:25:50,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:25:50,614 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 200 transitions. [2018-09-21 18:25:50,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-21 18:25:50,614 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 200 transitions. [2018-09-21 18:25:50,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-21 18:25:50,618 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:25:50,618 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] [2018-09-21 18:25:50,618 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:25:50,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1633972200, now seen corresponding path program 1 times [2018-09-21 18:25:50,619 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:25:50,619 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:25:50,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:25:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:25:50,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:25:50,831 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:25:50,845 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:25:50,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:50,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:50,935 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:25:50,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:25:50,978 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:25:50,986 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:25:50,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:50,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:50,993 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:25:50,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:25:51,164 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:25:51,165 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:25:51,176 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:25:51,176 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-21 18:25:51,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-21 18:25:51,176 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-21 18:25:51,177 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:25:51,177 INFO L87 Difference]: Start difference. First operand 165 states and 200 transitions. Second operand 9 states. [2018-09-21 18:25:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:25:55,110 INFO L93 Difference]: Finished difference Result 208 states and 255 transitions. [2018-09-21 18:25:55,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-21 18:25:55,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-09-21 18:25:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:25:55,114 INFO L225 Difference]: With dead ends: 208 [2018-09-21 18:25:55,114 INFO L226 Difference]: Without dead ends: 159 [2018-09-21 18:25:55,115 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-09-21 18:25:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-21 18:25:55,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-09-21 18:25:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-21 18:25:55,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2018-09-21 18:25:55,123 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 57 [2018-09-21 18:25:55,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:25:55,124 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2018-09-21 18:25:55,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-21 18:25:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2018-09-21 18:25:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-21 18:25:55,126 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:25:55,126 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] [2018-09-21 18:25:55,126 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:25:55,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1637364306, now seen corresponding path program 1 times [2018-09-21 18:25:55,127 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:25:55,127 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:25:55,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:25:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:25:55,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:25:55,368 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:25:55,374 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:25:55,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:55,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:55,390 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:25:55,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:25:55,406 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:25:55,412 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:25:55,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:55,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:55,421 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:25:55,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:25:55,739 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:25:55,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:25:55,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:55,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:55,758 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:25:55,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:25:55,808 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:25:55,812 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:25:55,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:55,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:55,819 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:25:55,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:25:56,113 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:25:56,113 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:25:56,124 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:25:56,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-21 18:25:56,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-21 18:25:56,125 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-21 18:25:56,125 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-21 18:25:56,126 INFO L87 Difference]: Start difference. First operand 159 states and 189 transitions. Second operand 15 states. [2018-09-21 18:25:59,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:25:59,924 INFO L93 Difference]: Finished difference Result 196 states and 234 transitions. [2018-09-21 18:25:59,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-21 18:25:59,925 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-09-21 18:25:59,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:25:59,927 INFO L225 Difference]: With dead ends: 196 [2018-09-21 18:25:59,927 INFO L226 Difference]: Without dead ends: 148 [2018-09-21 18:25:59,928 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-09-21 18:25:59,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-21 18:25:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-09-21 18:25:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-09-21 18:25:59,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2018-09-21 18:25:59,948 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 58 [2018-09-21 18:25:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:25:59,949 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2018-09-21 18:25:59,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-21 18:25:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2018-09-21 18:25:59,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-21 18:25:59,951 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:25:59,951 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] [2018-09-21 18:25:59,951 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:25:59,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1325264794, now seen corresponding path program 1 times [2018-09-21 18:25:59,952 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:25:59,952 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:25:59,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:26:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:26:00,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:26:00,582 WARN L178 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-21 18:26:00,786 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-21 18:26:01,062 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-21 18:26:01,236 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-21 18:26:01,250 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:26:01,250 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:26:01,262 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:26:01,262 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-21 18:26:01,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-21 18:26:01,263 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-21 18:26:01,263 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-21 18:26:01,263 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand 7 states. [2018-09-21 18:26:11,710 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-21 18:26:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:26:13,056 INFO L93 Difference]: Finished difference Result 152 states and 171 transitions. [2018-09-21 18:26:13,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-21 18:26:13,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-09-21 18:26:13,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:26:13,061 INFO L225 Difference]: With dead ends: 152 [2018-09-21 18:26:13,061 INFO L226 Difference]: Without dead ends: 146 [2018-09-21 18:26:13,061 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:26:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-21 18:26:13,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-09-21 18:26:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-21 18:26:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 165 transitions. [2018-09-21 18:26:13,067 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 165 transitions. Word has length 59 [2018-09-21 18:26:13,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:26:13,068 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 165 transitions. [2018-09-21 18:26:13,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-21 18:26:13,068 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 165 transitions. [2018-09-21 18:26:13,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-21 18:26:13,070 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:26:13,070 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] [2018-09-21 18:26:13,071 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:26:13,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1400643683, now seen corresponding path program 1 times [2018-09-21 18:26:13,073 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:26:13,073 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:26:13,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:26:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:26:13,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:26:13,262 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:26:13,267 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:26:13,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:26:13,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:26:13,282 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:26:13,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:26:13,301 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:26:13,313 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:26:13,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:26:13,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:26:13,320 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:26:13,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:26:13,574 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:26:13,575 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:26:13,590 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:26:13,591 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-21 18:26:13,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-21 18:26:13,591 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-21 18:26:13,591 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:26:13,592 INFO L87 Difference]: Start difference. First operand 146 states and 165 transitions. Second operand 9 states. [2018-09-21 18:26:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:26:15,042 INFO L93 Difference]: Finished difference Result 148 states and 166 transitions. [2018-09-21 18:26:15,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-21 18:26:15,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-09-21 18:26:15,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:26:15,045 INFO L225 Difference]: With dead ends: 148 [2018-09-21 18:26:15,046 INFO L226 Difference]: Without dead ends: 110 [2018-09-21 18:26:15,046 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-09-21 18:26:15,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-21 18:26:15,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-09-21 18:26:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-21 18:26:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2018-09-21 18:26:15,050 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 60 [2018-09-21 18:26:15,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:26:15,050 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2018-09-21 18:26:15,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-21 18:26:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2018-09-21 18:26:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-21 18:26:15,051 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:26:15,051 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] [2018-09-21 18:26:15,054 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:26:15,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1937904289, now seen corresponding path program 1 times [2018-09-21 18:26:15,055 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:26:15,055 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:26:15,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:26:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:26:15,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:26:15,212 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:26:15,216 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:26:15,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:26:15,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:26:15,234 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:26:15,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:26:15,256 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:26:15,266 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:26:15,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:26:15,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:26:15,272 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:26:15,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:26:15,461 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:26:15,461 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:26:15,472 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:26:15,472 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-21 18:26:15,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-21 18:26:15,473 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-21 18:26:15,473 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-21 18:26:15,473 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 11 states. [2018-09-21 18:26:31,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:26:31,223 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2018-09-21 18:26:31,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-21 18:26:31,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-09-21 18:26:31,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:26:31,277 INFO L225 Difference]: With dead ends: 118 [2018-09-21 18:26:31,277 INFO L226 Difference]: Without dead ends: 113 [2018-09-21 18:26:31,278 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:26:31,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-21 18:26:31,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2018-09-21 18:26:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-21 18:26:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2018-09-21 18:26:31,283 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 71 [2018-09-21 18:26:31,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:26:31,284 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2018-09-21 18:26:31,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-21 18:26:31,284 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2018-09-21 18:26:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-21 18:26:31,285 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:26:31,285 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:26:31,285 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:26:31,288 INFO L82 PathProgramCache]: Analyzing trace with hash -533955026, now seen corresponding path program 1 times [2018-09-21 18:26:31,288 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:26:31,289 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:26:31,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:26:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:26:31,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:26:33,470 INFO L303 Elim1Store]: Index analysis took 2037 ms [2018-09-21 18:26:33,470 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2018-09-21 18:26:37,496 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 37748947079.0 1000000000000000000.0))) (select v_arrayElimArr_1 (_ bv0 32))) [2018-09-21 18:26:37,497 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:37,500 INFO L303 Elim1Store]: Index analysis took 4028 ms [2018-09-21 18:26:37,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-09-21 18:26:41,500 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (select v_arrayElimArr_2 (_ bv1 32)) (select v_arrayElimArr_2 (_ bv0 32))) [2018-09-21 18:26:41,501 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:41,915 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:43,233 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:43,236 INFO L303 Elim1Store]: Index analysis took 5733 ms [2018-09-21 18:26:43,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 76 [2018-09-21 18:26:46,462 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (select v_arrayElimArr_3 (_ bv0 32)) (select v_arrayElimArr_3 (_ bv1 32))) [2018-09-21 18:26:46,463 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:47,805 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:49,815 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (select v_arrayElimArr_3 (_ bv1 32)) ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 75497894159.0 1000000000000000000.0)))) [2018-09-21 18:26:49,817 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:51,036 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:53,044 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (select v_arrayElimArr_3 (_ bv0 32)) ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 75497894159.0 1000000000000000000.0)))) [2018-09-21 18:26:53,044 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:54,818 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:54,821 INFO L303 Elim1Store]: Index analysis took 11582 ms [2018-09-21 18:26:54,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 121 [2018-09-21 18:26:54,824 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-21 18:27:05,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:11,154 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:15,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:25,933 INFO L303 Elim1Store]: Index analysis took 1179 ms [2018-09-21 18:27:25,934 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2018-09-21 18:27:26,105 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,108 INFO L303 Elim1Store]: Index analysis took 171 ms [2018-09-21 18:27:26,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-09-21 18:27:26,589 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,648 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,844 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,846 INFO L303 Elim1Store]: Index analysis took 735 ms [2018-09-21 18:27:26,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 76 [2018-09-21 18:27:26,909 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,953 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,968 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:27,011 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:27,031 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:27,097 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:27,099 INFO L303 Elim1Store]: Index analysis took 248 ms [2018-09-21 18:27:27,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 121 [2018-09-21 18:27:27,101 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-21 18:27:27,231 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:27,297 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:27,365 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:27,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:27,515 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:70, output treesize:80 [2018-09-21 18:27:27,667 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-09-21 18:27:28,231 WARN L178 SmtUtils]: Spent 469.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-09-21 18:27:28,690 WARN L178 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-09-21 18:27:29,185 WARN L178 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-09-21 18:27:29,211 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:29,216 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:29,221 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:29,226 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:29,231 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:29,235 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:29,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 62 [2018-09-21 18:27:29,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-21 18:27:29,454 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:29,456 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:29,457 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:29,459 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:29,460 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:29,462 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:29,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 64 [2018-09-21 18:27:29,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:27:29,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:29,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:23 [2018-09-21 18:27:29,755 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:27:29,755 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:27:29,767 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:27:29,767 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-21 18:27:29,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-21 18:27:29,768 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-21 18:27:29,768 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-21 18:27:29,768 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 8 states. [2018-09-21 18:27:43,933 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-09-21 18:27:44,274 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-09-21 18:27:44,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:27:44,390 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-09-21 18:27:44,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-21 18:27:44,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-09-21 18:27:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:27:44,395 INFO L225 Difference]: With dead ends: 117 [2018-09-21 18:27:44,395 INFO L226 Difference]: Without dead ends: 110 [2018-09-21 18:27:44,395 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-21 18:27:44,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-21 18:27:44,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-09-21 18:27:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-21 18:27:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-09-21 18:27:44,401 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 72 [2018-09-21 18:27:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:27:44,402 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-09-21 18:27:44,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-21 18:27:44,402 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-09-21 18:27:44,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-21 18:27:44,403 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:27:44,403 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:27:44,403 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:27:44,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1273499437, now seen corresponding path program 1 times [2018-09-21 18:27:44,404 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:27:44,404 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:27:44,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:27:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:27:44,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:27:44,602 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:27:44,608 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:27:44,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:27:44,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:44,625 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:27:44,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:27:44,650 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:27:44,653 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:27:44,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:27:44,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:44,660 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:27:44,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:27:44,809 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:27:44,810 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:27:44,822 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:27:44,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-21 18:27:44,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-21 18:27:44,823 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-21 18:27:44,824 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-21 18:27:44,824 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 10 states. [2018-09-21 18:27:58,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:27:58,449 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-09-21 18:27:58,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-21 18:27:58,502 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2018-09-21 18:27:58,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:27:58,504 INFO L225 Difference]: With dead ends: 118 [2018-09-21 18:27:58,504 INFO L226 Difference]: Without dead ends: 111 [2018-09-21 18:27:58,504 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-09-21 18:27:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-21 18:27:58,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-09-21 18:27:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-21 18:27:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2018-09-21 18:27:58,508 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 72 [2018-09-21 18:27:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:27:58,509 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2018-09-21 18:27:58,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-21 18:27:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-09-21 18:27:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-21 18:27:58,510 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:27:58,510 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:27:58,510 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:27:58,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2040063844, now seen corresponding path program 1 times [2018-09-21 18:27:58,511 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:27:58,511 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:27:58,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:27:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:27:58,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:27:58,696 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:27:58,701 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:27:58,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:27:58,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:58,716 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:27:58,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:27:58,739 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:27:58,743 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:27:58,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:27:58,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:58,750 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:27:58,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:27:58,942 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:27:58,943 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:27:58,954 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:27:58,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-21 18:27:58,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-21 18:27:58,955 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-21 18:27:58,955 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-21 18:27:58,955 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 11 states. [2018-09-21 18:28:14,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:28:14,068 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-09-21 18:28:14,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-21 18:28:14,125 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-09-21 18:28:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:28:14,126 INFO L225 Difference]: With dead ends: 115 [2018-09-21 18:28:14,127 INFO L226 Difference]: Without dead ends: 110 [2018-09-21 18:28:14,127 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:28:14,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-21 18:28:14,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-09-21 18:28:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-21 18:28:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2018-09-21 18:28:14,131 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 73 [2018-09-21 18:28:14,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:28:14,132 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-09-21 18:28:14,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-21 18:28:14,132 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2018-09-21 18:28:14,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-21 18:28:14,134 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:28:14,135 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] [2018-09-21 18:28:14,135 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:28:14,135 INFO L82 PathProgramCache]: Analyzing trace with hash -347725818, now seen corresponding path program 1 times [2018-09-21 18:28:14,137 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:28:14,137 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:28:14,143 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:28:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:28:15,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:28:15,360 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:28:15,364 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:28:15,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:15,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:15,380 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:28:15,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:28:15,405 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:28:15,407 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:28:15,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:15,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:15,414 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:28:15,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:28:15,602 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:28:15,602 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:28:15,630 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:28:15,630 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-21 18:28:15,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-21 18:28:15,631 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-21 18:28:15,631 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-21 18:28:15,631 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 11 states. [2018-09-21 18:28:27,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:28:27,598 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-09-21 18:28:27,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-21 18:28:27,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-09-21 18:28:27,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:28:27,601 INFO L225 Difference]: With dead ends: 118 [2018-09-21 18:28:27,601 INFO L226 Difference]: Without dead ends: 104 [2018-09-21 18:28:27,602 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:28:27,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-21 18:28:27,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-21 18:28:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-21 18:28:27,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-09-21 18:28:27,606 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 75 [2018-09-21 18:28:27,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:28:27,607 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-09-21 18:28:27,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-21 18:28:27,607 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-09-21 18:28:27,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-21 18:28:27,608 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:28:27,608 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] [2018-09-21 18:28:27,608 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:28:27,609 INFO L82 PathProgramCache]: Analyzing trace with hash 353323623, now seen corresponding path program 1 times [2018-09-21 18:28:27,609 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:28:27,609 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-21 18:28:27,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:28:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:28:29,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:28:29,087 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:28:29,091 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:28:29,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:29,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:29,107 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:28:29,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:28:29,132 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:28:29,137 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:28:29,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:29,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:29,144 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:28:29,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:28:29,404 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:28:29,404 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:28:29,439 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:28:29,439 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-21 18:28:29,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-21 18:28:29,440 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-21 18:28:29,440 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-21 18:28:29,440 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 11 states. [2018-09-21 18:28:37,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:28:37,994 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2018-09-21 18:28:37,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-21 18:28:37,994 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 101 [2018-09-21 18:28:37,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:28:37,995 INFO L225 Difference]: With dead ends: 100 [2018-09-21 18:28:37,995 INFO L226 Difference]: Without dead ends: 0 [2018-09-21 18:28:37,996 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:28:37,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-21 18:28:37,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-21 18:28:37,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-21 18:28:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-21 18:28:37,996 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2018-09-21 18:28:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:28:37,996 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-21 18:28:37,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-21 18:28:37,997 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-21 18:28:37,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-21 18:28:38,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 06:28:38 BoogieIcfgContainer [2018-09-21 18:28:38,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-21 18:28:38,005 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-21 18:28:38,006 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-21 18:28:38,006 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-21 18:28:38,007 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:25:22" (3/4) ... [2018-09-21 18:28:38,016 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-21 18:28:38,027 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-21 18:28:38,028 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_float [2018-09-21 18:28:38,028 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_atan2f [2018-09-21 18:28:38,028 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isfinite_float [2018-09-21 18:28:38,028 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-21 18:28:38,028 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure atan_float [2018-09-21 18:28:38,042 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2018-09-21 18:28:38,043 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-09-21 18:28:38,043 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-09-21 18:28:38,164 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-21 18:28:38,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-21 18:28:38,169 INFO L168 Benchmark]: Toolchain (without parser) took 209895.02 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 255.9 MB). Free memory was 953.2 MB in the beginning and 956.4 MB in the end (delta: -3.2 MB). Peak memory consumption was 252.6 MB. Max. memory is 11.5 GB. [2018-09-21 18:28:38,170 INFO L168 Benchmark]: CDTParser took 0.19 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:28:38,170 INFO L168 Benchmark]: CACSL2BoogieTranslator took 512.40 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:28:38,171 INFO L168 Benchmark]: Boogie Preprocessor took 91.44 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:28:38,171 INFO L168 Benchmark]: RCFGBuilder took 13630.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-09-21 18:28:38,173 INFO L168 Benchmark]: TraceAbstraction took 195491.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 117.4 MB). Free memory was 1.1 GB in the beginning and 965.1 MB in the end (delta: 104.3 MB). Peak memory consumption was 221.8 MB. Max. memory is 11.5 GB. [2018-09-21 18:28:38,174 INFO L168 Benchmark]: Witness Printer took 159.12 ms. Allocated memory is still 1.3 GB. Free memory was 965.1 MB in the beginning and 956.4 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2018-09-21 18:28:38,178 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.19 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 512.40 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 91.44 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 13630.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 195491.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 117.4 MB). Free memory was 1.1 GB in the beginning and 965.1 MB in the end (delta: 104.3 MB). Peak memory consumption was 221.8 MB. Max. memory is 11.5 GB. * Witness Printer took 159.12 ms. Allocated memory is still 1.3 GB. Free memory was 965.1 MB in the beginning and 956.4 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 243]: 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 7 procedures, 172 locations, 1 error locations. SAFE Result, 195.4s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 124.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2112 SDtfs, 2100 SDslu, 12747 SDs, 0 SdLazy, 2423 SolverSat, 123 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 111.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 976 GetRequests, 761 SyntacticMatches, 3 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 15.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 66.6s InterpolantComputationTime, 889 NumberOfCodeBlocks, 889 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 875 ConstructedInterpolants, 109 QuantifiedInterpolants, 767373 SizeOfPredicates, 113 NumberOfNonLiveVariables, 2165 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...