/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 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/double_req_bl_1251b_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 fdb278616c84242b474f2f44982daec1395fc08c ............................................................................................................................................................................................................................................................................................................................................................................................ 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/double_req_bl_1251b_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 fdb278616c84242b474f2f44982daec1395fc08c .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 15:06:30,062 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:06:30,064 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:06:30,082 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:06:30,083 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:06:30,085 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:06:30,088 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:06:30,091 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:06:30,093 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:06:30,095 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:06:30,099 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:06:30,099 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:06:30,101 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:06:30,103 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:06:30,110 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:06:30,114 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:06:30,115 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:06:30,118 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:06:30,122 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:06:30,124 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:06:30,128 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:06:30,130 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:06:30,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:06:30,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:06:30,138 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:06:30,139 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:06:30,140 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:06:30,140 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:06:30,143 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:06:30,145 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:06:30,147 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:06:30,148 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:06:30,148 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:06:30,148 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:06:30,151 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:06:30,153 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:06:30,155 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 15:06:30,181 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:06:30,183 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:06:30,184 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:06:30,185 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:06:30,189 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:06:30,190 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:06:30,190 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:06:30,191 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:06:30,191 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:06:30,191 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 15:06:30,191 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:06:30,191 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:06:30,193 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:06:30,193 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:06:30,193 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:06:30,193 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:06:30,193 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:06:30,194 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:06:30,194 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:06:30,194 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:06:30,194 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:06:30,197 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:06:30,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:06:30,197 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:06:30,197 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:06:30,197 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:06:30,198 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 15:06:30,198 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:06:30,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 15:06:30,198 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 -> fdb278616c84242b474f2f44982daec1395fc08c [2018-09-20 15:06:30,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:06:30,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:06:30,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:06:30,287 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:06:30,290 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:06:30,291 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-09-20 15:06:30,653 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72fb01800/7c59a43ee60342d098668f7f6c7f1ee4/FLAG685889434 [2018-09-20 15:06:30,856 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:06:30,857 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-09-20 15:06:30,868 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72fb01800/7c59a43ee60342d098668f7f6c7f1ee4/FLAG685889434 [2018-09-20 15:06:30,892 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72fb01800/7c59a43ee60342d098668f7f6c7f1ee4 [2018-09-20 15:06:30,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:06:30,901 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:06:30,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:06:30,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:06:30,910 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:06:30,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:06:30" (1/1) ... [2018-09-20 15:06:30,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c570ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:30, skipping insertion in model container [2018-09-20 15:06:30,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:06:30" (1/1) ... [2018-09-20 15:06:30,929 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:06:31,194 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:06:31,213 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:06:31,230 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:06:31,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:31 WrapperNode [2018-09-20 15:06:31,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:06:31,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:06:31,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:06:31,262 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:06:31,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:31" (1/1) ... [2018-09-20 15:06:31,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:31" (1/1) ... [2018-09-20 15:06:31,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:31" (1/1) ... [2018-09-20 15:06:31,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:31" (1/1) ... [2018-09-20 15:06:31,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:31" (1/1) ... [2018-09-20 15:06:31,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:31" (1/1) ... [2018-09-20 15:06:31,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:31" (1/1) ... [2018-09-20 15:06:31,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:06:31,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:06:31,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:06:31,340 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:06:31,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:06:31,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:06:31,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:06:31,425 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-20 15:06:31,425 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-09-20 15:06:31,426 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-09-20 15:06:31,426 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:06:31,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:06:31,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 15:06:31,427 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-20 15:06:31,427 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-09-20 15:06:31,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:06:31,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-20 15:06:31,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-20 15:06:31,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:06:31,430 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-09-20 15:06:31,431 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:06:31,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:06:31,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:06:31,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-20 15:06:31,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-20 15:06:31,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-20 15:06:31,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-20 15:06:32,074 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:06:32,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:06:32 BoogieIcfgContainer [2018-09-20 15:06:32,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:06:32,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:06:32,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:06:32,079 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:06:32,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:06:30" (1/3) ... [2018-09-20 15:06:32,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6abb514b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:06:32, skipping insertion in model container [2018-09-20 15:06:32,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:31" (2/3) ... [2018-09-20 15:06:32,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6abb514b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:06:32, skipping insertion in model container [2018-09-20 15:06:32,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:06:32" (3/3) ... [2018-09-20 15:06:32,083 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b_true-unreach-call.c [2018-09-20 15:06:32,095 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:06:32,104 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:06:32,152 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:06:32,152 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:06:32,153 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:06:32,153 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:06:32,153 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:06:32,153 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:06:32,153 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:06:32,154 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:06:32,154 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:06:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-09-20 15:06:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-20 15:06:32,184 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:32,186 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:32,188 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:32,194 INFO L82 PathProgramCache]: Analyzing trace with hash 754859581, now seen corresponding path program 1 times [2018-09-20 15:06:32,197 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:06:32,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:06:32,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:06:32,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:32,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:06:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:32,359 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-20 15:06:32,362 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:32,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:06:32,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:06:32,380 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:06:32,380 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:06:32,383 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-09-20 15:06:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:32,412 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2018-09-20 15:06:32,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:06:32,413 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-09-20 15:06:32,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:32,426 INFO L225 Difference]: With dead ends: 93 [2018-09-20 15:06:32,426 INFO L226 Difference]: Without dead ends: 49 [2018-09-20 15:06:32,430 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-20 15:06:32,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-20 15:06:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-20 15:06:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:06:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-09-20 15:06:32,480 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 27 [2018-09-20 15:06:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:32,483 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-09-20 15:06:32,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:06:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-09-20 15:06:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-20 15:06:32,488 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:32,489 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] [2018-09-20 15:06:32,489 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:32,489 INFO L82 PathProgramCache]: Analyzing trace with hash -952121448, now seen corresponding path program 1 times [2018-09-20 15:06:32,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:06:32,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:06:32,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:06:32,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:32,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:06:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:32,823 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-20 15:06:32,824 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:32,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:32,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:32,827 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:32,828 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:32,828 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 4 states. [2018-09-20 15:06:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:32,918 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-09-20 15:06:32,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:32,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-09-20 15:06:32,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:32,923 INFO L225 Difference]: With dead ends: 59 [2018-09-20 15:06:32,923 INFO L226 Difference]: Without dead ends: 53 [2018-09-20 15:06:32,924 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:32,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-20 15:06:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-20 15:06:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-20 15:06:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-09-20 15:06:32,936 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 40 [2018-09-20 15:06:32,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:32,937 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-09-20 15:06:32,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:32,937 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-09-20 15:06:32,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-20 15:06:32,939 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:32,939 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] [2018-09-20 15:06:32,939 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:32,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1784721648, now seen corresponding path program 1 times [2018-09-20 15:06:32,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:06:32,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:06:32,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:06:32,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:32,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:06:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:33,067 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-20 15:06:33,068 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:33,068 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:33,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:33,069 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:33,069 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:33,069 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 4 states. [2018-09-20 15:06:33,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:33,178 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-09-20 15:06:33,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:33,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-09-20 15:06:33,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:33,183 INFO L225 Difference]: With dead ends: 63 [2018-09-20 15:06:33,183 INFO L226 Difference]: Without dead ends: 57 [2018-09-20 15:06:33,183 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:33,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-20 15:06:33,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-09-20 15:06:33,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-20 15:06:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-09-20 15:06:33,193 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 43 [2018-09-20 15:06:33,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:33,194 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-09-20 15:06:33,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:33,194 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-09-20 15:06:33,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-20 15:06:33,197 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:33,197 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] [2018-09-20 15:06:33,197 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:33,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1981235153, now seen corresponding path program 1 times [2018-09-20 15:06:33,198 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:06:33,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:06:33,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:06:33,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:33,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:06:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:06:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:06:33,309 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 15:06:33,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:06:33 BoogieIcfgContainer [2018-09-20 15:06:33,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:06:33,346 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:06:33,346 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:06:33,346 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:06:33,347 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:06:32" (3/4) ... [2018-09-20 15:06:33,351 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 15:06:33,351 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:06:33,352 INFO L168 Benchmark]: Toolchain (without parser) took 2454.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 950.5 MB in the beginning and 1.1 GB in the end (delta: -118.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:33,354 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-20 15:06:33,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.68 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 939.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:33,356 INFO L168 Benchmark]: Boogie Preprocessor took 76.11 ms. Allocated memory is still 1.0 GB. Free memory is still 939.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:06:33,356 INFO L168 Benchmark]: RCFGBuilder took 736.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:33,357 INFO L168 Benchmark]: TraceAbstraction took 1269.42 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: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:33,358 INFO L168 Benchmark]: Witness Printer took 5.50 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-20 15:06:33,363 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 359.68 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 939.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.11 ms. Allocated memory is still 1.0 GB. Free memory is still 939.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 736.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1269.42 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: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.50 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: 78]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryArithmeticDOUBLEoperation at line 65. Possible FailurePath: [L64] double x = __VERIFIER_nondet_double(); [L65] double y = 0.0 / 0.0; VAL [x=4294967301] [L72] CALL, EXPR isnan_double(x) VAL [\old(x)=4294967301] [L16] RET return x != x; VAL [\old(x)=4294967301, \result=0, x=4294967301] [L72] EXPR isnan_double(x) VAL [isnan_double(x)=0, x=4294967301] [L72] COND TRUE !isnan_double(x) [L74] CALL, EXPR fmax_double(x, y) VAL [\old(x)=4294967301, \old(y)=4294967302] [L55] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967301] [L27] __uint32_t msw, lsw; VAL [\old(x)=4294967301, x=4294967301] [L30] FCALL ieee_double_shape_type ew_u; VAL [\old(x)=4294967301, ew_u={4294967299:0}, x=4294967301] [L31] FCALL ew_u.value = (x) VAL [\old(x)=4294967301, ew_u={4294967299:0}, x=4294967301] [L32] EXPR, FCALL ew_u.parts.msw VAL [\old(x)=4294967301, ew_u={4294967299:0}, ew_u.parts.msw=4293918721, x=4294967301] [L32] (msw) = ew_u.parts.msw VAL [\old(x)=4294967301, ew_u={4294967299:0}, ew_u.parts.msw=4293918721, msw=4293918721, x=4294967301] [L32] FCALL (msw) = ew_u.parts.msw VAL [(msw) = ew_u.parts.msw=4294967300, \old(x)=4294967301, ew_u={4294967299:0}, ew_u.parts.msw=4293918721, msw=4293918721, x=4294967301] [L33] EXPR, FCALL ew_u.parts.lsw VAL [\old(x)=4294967301, ew_u={4294967299:0}, ew_u.parts.lsw=4294967297, msw=4293918721, x=4294967301] [L33] (lsw) = ew_u.parts.lsw VAL [\old(x)=4294967301, ew_u={4294967299:0}, ew_u.parts.lsw=4294967297, lsw=4294967297, msw=4293918721, x=4294967301] [L33] FCALL (lsw) = ew_u.parts.lsw VAL [(lsw) = ew_u.parts.lsw=4294967304, \old(x)=4294967301, ew_u={4294967299:0}, ew_u.parts.lsw=4294967297, lsw=4294967297, msw=4293918721, x=4294967301] [L34] COND FALSE !(0) VAL [\old(x)=4294967301, lsw=4294967297, msw=4293918721, x=4294967301] [L36-L37] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967301, lsw=4294967297, msw=4293918721, x=4294967301] [L39-L40] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967301, lsw=4294967297, msw=4293918721, x=4294967301] [L42-L43] COND FALSE !((msw >= 0x00000000 && msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967301, lsw=4294967297, msw=4293918721, x=4294967301] [L46-L47] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L50] RET return 0; VAL [\old(x)=4294967301, \result=0, lsw=4294967297, msw=4293918721, x=4294967301] [L55] EXPR __fpclassify_double(x) VAL [\old(x)=4294967301, \old(y)=4294967302, __fpclassify_double(x)=0, x=4294967301, y=4294967302] [L55] COND TRUE __fpclassify_double(x) == 0 [L56] RET return y; VAL [\old(x)=4294967301, \old(y)=4294967302, \result=4294967302, x=4294967301, y=4294967302] [L74] EXPR fmax_double(x, y) VAL [fmax_double(x, y)=4294967302, x=4294967301, y=4294967302] [L74] double res = fmax_double(x, y); [L77] COND TRUE res != x VAL [res=4294967302, x=4294967301, y=4294967302] [L78] __VERIFIER_error() VAL [res=4294967302, x=4294967301, y=4294967302] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 54 locations, 1 error locations. UNSAFE Result, 1.1s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 175 SDtfs, 0 SDslu, 210 SDs, 0 SdLazy, 21 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred 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, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 4609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-40ef509 [2018-09-20 15:06:35,755 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:06:35,757 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:06:35,769 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:06:35,770 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:06:35,771 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:06:35,772 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:06:35,774 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:06:35,775 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:06:35,776 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:06:35,777 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:06:35,778 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:06:35,778 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:06:35,779 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:06:35,781 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:06:35,781 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:06:35,782 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:06:35,784 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:06:35,786 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:06:35,788 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:06:35,789 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:06:35,790 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:06:35,793 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:06:35,793 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:06:35,793 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:06:35,794 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:06:35,795 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:06:35,796 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:06:35,797 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:06:35,798 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:06:35,798 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:06:35,799 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:06:35,799 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:06:35,800 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:06:35,801 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:06:35,801 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:06:35,802 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 15:06:35,818 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:06:35,818 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:06:35,819 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:06:35,819 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:06:35,820 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:06:35,820 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:06:35,820 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:06:35,820 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:06:35,820 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:06:35,821 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:06:35,821 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:06:35,821 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:06:35,821 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:06:35,821 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:06:35,821 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 15:06:35,822 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 15:06:35,822 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:06:35,822 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:06:35,822 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:06:35,822 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:06:35,823 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:06:35,823 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:06:35,823 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:06:35,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:06:35,823 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:06:35,824 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:06:35,824 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:06:35,824 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 15:06:35,824 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:06:35,824 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 15:06:35,824 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 15:06:35,825 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 -> fdb278616c84242b474f2f44982daec1395fc08c [2018-09-20 15:06:35,874 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:06:35,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:06:35,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:06:35,893 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:06:35,893 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:06:35,894 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-09-20 15:06:36,257 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5f75f80/48bebea247c44141be22ea47cf6f70cb/FLAG638590c43 [2018-09-20 15:06:36,407 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:06:36,408 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-09-20 15:06:36,415 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5f75f80/48bebea247c44141be22ea47cf6f70cb/FLAG638590c43 [2018-09-20 15:06:36,432 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5f75f80/48bebea247c44141be22ea47cf6f70cb [2018-09-20 15:06:36,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:06:36,441 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:06:36,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:06:36,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:06:36,449 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:06:36,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:06:36" (1/1) ... [2018-09-20 15:06:36,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dff9781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36, skipping insertion in model container [2018-09-20 15:06:36,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:06:36" (1/1) ... [2018-09-20 15:06:36,468 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:06:36,701 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:06:36,724 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:06:36,748 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:06:36,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36 WrapperNode [2018-09-20 15:06:36,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:06:36,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:06:36,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:06:36,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:06:36,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (1/1) ... [2018-09-20 15:06:36,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (1/1) ... [2018-09-20 15:06:36,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (1/1) ... [2018-09-20 15:06:36,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (1/1) ... [2018-09-20 15:06:36,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (1/1) ... [2018-09-20 15:06:36,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (1/1) ... [2018-09-20 15:06:36,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (1/1) ... [2018-09-20 15:06:36,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:06:36,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:06:36,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:06:36,863 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:06:36,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (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-20 15:06:37,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:06:37,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:06:37,010 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-20 15:06:37,010 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-09-20 15:06:37,011 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-09-20 15:06:37,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:06:37,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:06:37,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 15:06:37,011 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-20 15:06:37,011 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-09-20 15:06:37,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:06:37,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-20 15:06:37,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 15:06:37,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:06:37,012 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-09-20 15:06:37,012 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:06:37,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:06:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:06:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-20 15:06:37,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 15:06:37,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 15:06:37,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-20 15:06:37,396 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:06:37,426 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:06:37,447 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:06:37,589 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:06:37,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:06:37 BoogieIcfgContainer [2018-09-20 15:06:37,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:06:37,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:06:37,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:06:37,596 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:06:37,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:06:36" (1/3) ... [2018-09-20 15:06:37,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17303fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:06:37, skipping insertion in model container [2018-09-20 15:06:37,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (2/3) ... [2018-09-20 15:06:37,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17303fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:06:37, skipping insertion in model container [2018-09-20 15:06:37,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:06:37" (3/3) ... [2018-09-20 15:06:37,601 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b_true-unreach-call.c [2018-09-20 15:06:37,612 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:06:37,619 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:06:37,666 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:06:37,667 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:06:37,667 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:06:37,667 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:06:37,667 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:06:37,667 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:06:37,668 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:06:37,668 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:06:37,668 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:06:37,691 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-09-20 15:06:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-20 15:06:37,699 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:37,700 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:37,703 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:37,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1700649700, now seen corresponding path program 1 times [2018-09-20 15:06:37,716 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:37,718 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) [2018-09-20 15:06:37,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:37,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:37,829 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-20 15:06:37,829 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:37,844 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:37,845 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:06:37,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:06:37,865 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:06:37,865 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:06:37,868 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-09-20 15:06:37,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:37,897 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2018-09-20 15:06:37,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:06:37,899 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-09-20 15:06:37,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:37,911 INFO L225 Difference]: With dead ends: 88 [2018-09-20 15:06:37,912 INFO L226 Difference]: Without dead ends: 46 [2018-09-20 15:06:37,916 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-20 15:06:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-20 15:06:37,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-20 15:06:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-20 15:06:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-09-20 15:06:37,965 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 25 [2018-09-20 15:06:37,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:37,966 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-09-20 15:06:37,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:06:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-09-20 15:06:37,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-20 15:06:37,969 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:37,969 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] [2018-09-20 15:06:37,969 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:37,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1378721572, now seen corresponding path program 1 times [2018-09-20 15:06:37,970 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:37,971 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) [2018-09-20 15:06:37,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:38,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:38,184 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-20 15:06:38,189 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:38,203 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:38,204 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:38,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:38,207 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:38,208 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:38,208 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-09-20 15:06:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:38,354 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-09-20 15:06:38,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:38,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-09-20 15:06:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:38,361 INFO L225 Difference]: With dead ends: 55 [2018-09-20 15:06:38,365 INFO L226 Difference]: Without dead ends: 49 [2018-09-20 15:06:38,367 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:38,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-20 15:06:38,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-20 15:06:38,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:06:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-20 15:06:38,390 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 38 [2018-09-20 15:06:38,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:38,391 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-20 15:06:38,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:38,391 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-20 15:06:38,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-20 15:06:38,393 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:38,393 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] [2018-09-20 15:06:38,394 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:38,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1304320947, now seen corresponding path program 1 times [2018-09-20 15:06:38,395 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:38,395 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) [2018-09-20 15:06:38,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:38,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:38,573 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-20 15:06:38,573 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:38,588 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:38,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:38,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:38,589 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:38,589 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:38,592 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-20 15:06:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:38,679 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-20 15:06:38,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:38,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-09-20 15:06:38,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:38,686 INFO L225 Difference]: With dead ends: 58 [2018-09-20 15:06:38,686 INFO L226 Difference]: Without dead ends: 52 [2018-09-20 15:06:38,686 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-20 15:06:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-20 15:06:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:06:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-20 15:06:38,701 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 39 [2018-09-20 15:06:38,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:38,702 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-20 15:06:38,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-20 15:06:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-20 15:06:38,703 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:38,704 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] [2018-09-20 15:06:38,704 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1932752128, now seen corresponding path program 1 times [2018-09-20 15:06:38,705 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:38,705 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-20 15:06:38,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:38,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:38,836 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-20 15:06:38,836 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:38,849 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:38,849 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:38,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:38,850 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:38,850 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:38,850 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-20 15:06:39,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:39,027 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-20 15:06:39,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:39,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-09-20 15:06:39,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:39,032 INFO L225 Difference]: With dead ends: 58 [2018-09-20 15:06:39,032 INFO L226 Difference]: Without dead ends: 52 [2018-09-20 15:06:39,033 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:39,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-20 15:06:39,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-20 15:06:39,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:06:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-20 15:06:39,053 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 40 [2018-09-20 15:06:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:39,054 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-20 15:06:39,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-20 15:06:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-20 15:06:39,055 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:39,059 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] [2018-09-20 15:06:39,059 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:39,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1420834481, now seen corresponding path program 1 times [2018-09-20 15:06:39,060 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:39,060 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) [2018-09-20 15:06:39,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:39,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:39,262 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-20 15:06:39,263 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:39,275 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:39,276 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:39,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:39,276 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:39,277 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:39,277 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-20 15:06:39,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:39,332 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-20 15:06:39,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:39,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-09-20 15:06:39,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:39,334 INFO L225 Difference]: With dead ends: 58 [2018-09-20 15:06:39,334 INFO L226 Difference]: Without dead ends: 52 [2018-09-20 15:06:39,335 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-20 15:06:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-20 15:06:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:06:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-20 15:06:39,342 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 41 [2018-09-20 15:06:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:39,343 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-20 15:06:39,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-20 15:06:39,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-20 15:06:39,344 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:39,344 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] [2018-09-20 15:06:39,345 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:39,345 INFO L82 PathProgramCache]: Analyzing trace with hash -386619982, now seen corresponding path program 1 times [2018-09-20 15:06:39,345 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:39,346 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-20 15:06:39,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:39,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:39,761 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:39,762 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:39,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 27 treesize of output 35 [2018-09-20 15:06:39,784 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:39,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-20 15:06:39,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:39,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:39,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:39,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-20 15:06:40,343 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:40,352 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:40,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 54 treesize of output 56 [2018-09-20 15:06:40,386 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:40,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-20 15:06:40,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:40,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:40,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:40,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-20 15:06:40,904 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 35 treesize of output 27 [2018-09-20 15:06:40,911 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:40,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-20 15:06:40,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:40,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:40,950 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-20 15:06:40,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-20 15:06:41,521 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-09-20 15:06:41,815 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2018-09-20 15:06:42,284 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-20 15:06:42,285 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:42,303 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:42,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-20 15:06:42,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-20 15:06:42,304 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-20 15:06:42,305 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-09-20 15:06:42,306 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 16 states. [2018-09-20 15:06:44,017 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-20 15:06:44,832 WARN L178 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:06:47,949 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2018-09-20 15:06:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:48,964 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2018-09-20 15:06:48,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-20 15:06:48,966 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-09-20 15:06:48,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:48,967 INFO L225 Difference]: With dead ends: 66 [2018-09-20 15:06:48,968 INFO L226 Difference]: Without dead ends: 52 [2018-09-20 15:06:48,969 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=120, Invalid=635, Unknown=1, NotChecked=0, Total=756 [2018-09-20 15:06:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-20 15:06:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-09-20 15:06:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-20 15:06:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-09-20 15:06:48,976 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 41 [2018-09-20 15:06:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:48,977 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-09-20 15:06:48,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-20 15:06:48,977 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-09-20 15:06:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-20 15:06:48,978 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:48,978 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-20 15:06:48,979 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:48,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1132927488, now seen corresponding path program 1 times [2018-09-20 15:06:48,979 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:48,980 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-20 15:06:49,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:49,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:06:49,131 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:49,146 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:49,146 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:49,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:49,147 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:49,147 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:49,147 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 4 states. [2018-09-20 15:06:49,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:49,206 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-09-20 15:06:49,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:49,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-09-20 15:06:49,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:49,208 INFO L225 Difference]: With dead ends: 57 [2018-09-20 15:06:49,208 INFO L226 Difference]: Without dead ends: 51 [2018-09-20 15:06:49,209 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:49,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-20 15:06:49,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-20 15:06:49,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-20 15:06:49,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-09-20 15:06:49,215 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 58 [2018-09-20 15:06:49,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:49,216 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-09-20 15:06:49,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:49,216 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-09-20 15:06:49,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-20 15:06:49,218 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:49,218 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-20 15:06:49,218 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:49,218 INFO L82 PathProgramCache]: Analyzing trace with hash 310309699, now seen corresponding path program 1 times [2018-09-20 15:06:49,219 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:49,219 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-20 15:06:49,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:49,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:06:49,336 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:49,348 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:49,348 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:49,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:49,349 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:49,350 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:49,350 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 4 states. [2018-09-20 15:06:49,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:49,478 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-09-20 15:06:49,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:49,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-09-20 15:06:49,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:49,480 INFO L225 Difference]: With dead ends: 60 [2018-09-20 15:06:49,481 INFO L226 Difference]: Without dead ends: 54 [2018-09-20 15:06:49,481 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-20 15:06:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-09-20 15:06:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-20 15:06:49,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-09-20 15:06:49,488 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 59 [2018-09-20 15:06:49,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:49,488 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-09-20 15:06:49,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-09-20 15:06:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-20 15:06:49,490 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:49,490 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-20 15:06:49,490 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:49,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1101257373, now seen corresponding path program 1 times [2018-09-20 15:06:49,491 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:49,491 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-20 15:06:49,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:49,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:49,684 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 14 treesize of output 11 [2018-09-20 15:06:49,690 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 11 treesize of output 10 [2018-09-20 15:06:49,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:49,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:49,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:49,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:06:49,839 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 20 treesize of output 16 [2018-09-20 15:06:49,853 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 16 treesize of output 4 [2018-09-20 15:06:49,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:49,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:49,877 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-20 15:06:49,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:06:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:50,372 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:50,382 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:50,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:06:50,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:06:50,383 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:06:50,384 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:06:50,384 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 10 states. [2018-09-20 15:06:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:53,821 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-09-20 15:06:53,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:06:53,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-09-20 15:06:53,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:53,824 INFO L225 Difference]: With dead ends: 62 [2018-09-20 15:06:53,824 INFO L226 Difference]: Without dead ends: 53 [2018-09-20 15:06:53,824 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-09-20 15:06:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-20 15:06:53,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-20 15:06:53,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-20 15:06:53,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-09-20 15:06:53,832 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 60 [2018-09-20 15:06:53,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:53,832 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-09-20 15:06:53,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:06:53,833 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-09-20 15:06:53,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-20 15:06:53,834 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:53,834 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-20 15:06:53,835 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:53,836 INFO L82 PathProgramCache]: Analyzing trace with hash -833861020, now seen corresponding path program 1 times [2018-09-20 15:06:53,836 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:53,836 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-20 15:06:53,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:53,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:06:53,979 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:53,993 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:53,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:53,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:53,994 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:53,994 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:53,995 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 4 states. [2018-09-20 15:06:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:54,035 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-09-20 15:06:54,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:54,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-09-20 15:06:54,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:54,037 INFO L225 Difference]: With dead ends: 62 [2018-09-20 15:06:54,037 INFO L226 Difference]: Without dead ends: 56 [2018-09-20 15:06:54,038 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-20 15:06:54,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-09-20 15:06:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-20 15:06:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-09-20 15:06:54,045 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 60 [2018-09-20 15:06:54,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:54,045 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-09-20 15:06:54,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-09-20 15:06:54,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-20 15:06:54,047 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:54,047 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-20 15:06:54,047 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:54,047 INFO L82 PathProgramCache]: Analyzing trace with hash 777757472, now seen corresponding path program 1 times [2018-09-20 15:06:54,048 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:54,048 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-20 15:06:54,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:54,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:54,354 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 14 treesize of output 11 [2018-09-20 15:06:54,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 11 treesize of output 10 [2018-09-20 15:06:54,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:54,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:54,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:54,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:06:54,426 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 20 treesize of output 16 [2018-09-20 15:06:54,430 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 16 treesize of output 4 [2018-09-20 15:06:54,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:54,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:54,442 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-20 15:06:54,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:06:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:54,774 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:54,792 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:54,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:06:54,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:06:54,793 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:06:54,793 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:06:54,793 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 10 states. [2018-09-20 15:06:57,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:57,007 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-09-20 15:06:57,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:06:57,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-09-20 15:06:57,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:57,010 INFO L225 Difference]: With dead ends: 64 [2018-09-20 15:06:57,010 INFO L226 Difference]: Without dead ends: 55 [2018-09-20 15:06:57,011 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-09-20 15:06:57,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-20 15:06:57,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-09-20 15:06:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-20 15:06:57,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-09-20 15:06:57,019 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 61 [2018-09-20 15:06:57,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:57,019 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-09-20 15:06:57,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:06:57,020 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-09-20 15:06:57,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-20 15:06:57,021 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:57,021 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-20 15:06:57,021 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:57,021 INFO L82 PathProgramCache]: Analyzing trace with hash -583298201, now seen corresponding path program 1 times [2018-09-20 15:06:57,022 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:57,022 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-20 15:06:57,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:57,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:57,137 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:06:57,138 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:57,148 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:57,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:57,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:57,149 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:57,149 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:57,149 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 4 states. [2018-09-20 15:06:57,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:57,197 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-09-20 15:06:57,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:57,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-09-20 15:06:57,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:57,199 INFO L225 Difference]: With dead ends: 60 [2018-09-20 15:06:57,199 INFO L226 Difference]: Without dead ends: 54 [2018-09-20 15:06:57,199 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-20 15:06:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-09-20 15:06:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-20 15:06:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-09-20 15:06:57,205 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 61 [2018-09-20 15:06:57,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:57,205 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-09-20 15:06:57,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:57,205 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-09-20 15:06:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-20 15:06:57,210 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:57,211 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-20 15:06:57,211 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:57,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1904214632, now seen corresponding path program 1 times [2018-09-20 15:06:57,212 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:57,213 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) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:57,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:57,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:57,366 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 14 treesize of output 11 [2018-09-20 15:06:57,372 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 11 treesize of output 10 [2018-09-20 15:06:57,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:57,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:57,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:57,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:06:57,423 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 20 treesize of output 16 [2018-09-20 15:06:57,430 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 16 treesize of output 4 [2018-09-20 15:06:57,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:57,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:57,443 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-20 15:06:57,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:06:57,867 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-20 15:06:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:58,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:06:58,575 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-20 15:06:58,766 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-20 15:06:59,061 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-20 15:06:59,247 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-20 15:06:59,361 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-20 15:06:59,823 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-20 15:07:00,149 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 15:07:00,149 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 15:07:00,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:07:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:07:00,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:07:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-20 15:07:00,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:07:01,540 WARN L178 SmtUtils]: Spent 523.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-20 15:07:01,842 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-20 15:07:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:07:02,734 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:07:02,734 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 10] total 24 [2018-09-20 15:07:02,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-20 15:07:02,735 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-20 15:07:02,735 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2018-09-20 15:07:02,735 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 24 states. [2018-09-20 15:07:05,793 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-09-20 15:07:06,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:07:06,155 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2018-09-20 15:07:06,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-20 15:07:06,156 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-09-20 15:07:06,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:07:06,157 INFO L225 Difference]: With dead ends: 71 [2018-09-20 15:07:06,157 INFO L226 Difference]: Without dead ends: 61 [2018-09-20 15:07:06,159 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 185 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2018-09-20 15:07:06,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-20 15:07:06,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2018-09-20 15:07:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-20 15:07:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-09-20 15:07:06,165 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 61 [2018-09-20 15:07:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:07:06,166 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-09-20 15:07:06,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-20 15:07:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-09-20 15:07:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-20 15:07:06,167 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:07:06,167 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-20 15:07:06,167 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:07:06,167 INFO L82 PathProgramCache]: Analyzing trace with hash 741324289, now seen corresponding path program 1 times [2018-09-20 15:07:06,168 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:07:06,168 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:07:06,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-09-20 15:07:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:07:06,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:07:06,335 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 14 treesize of output 11 [2018-09-20 15:07:06,340 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 11 treesize of output 10 [2018-09-20 15:07:06,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:07:06,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:07:06,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:07:06,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:07:06,420 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 20 treesize of output 16 [2018-09-20 15:07:06,425 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 16 treesize of output 4 [2018-09-20 15:07:06,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:07:06,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:07:06,442 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-20 15:07:06,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:07:06,729 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:07:06,729 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:07:06,745 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:07:06,745 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:07:06,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:07:06,747 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:07:06,747 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:07:06,747 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 10 states. [2018-09-20 15:07:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:07:08,471 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-09-20 15:07:08,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:07:08,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2018-09-20 15:07:08,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:07:08,474 INFO L225 Difference]: With dead ends: 63 [2018-09-20 15:07:08,474 INFO L226 Difference]: Without dead ends: 54 [2018-09-20 15:07:08,475 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-09-20 15:07:08,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-20 15:07:08,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-09-20 15:07:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-20 15:07:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-09-20 15:07:08,481 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 62 [2018-09-20 15:07:08,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:07:08,482 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-09-20 15:07:08,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:07:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-09-20 15:07:08,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-20 15:07:08,483 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:07:08,483 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-20 15:07:08,483 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:07:08,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1014024772, now seen corresponding path program 1 times [2018-09-20 15:07:08,484 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:07:08,484 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-09-20 15:07:08,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:07:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:07:08,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:07:08,653 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:07:08,654 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:07:08,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 27 treesize of output 35 [2018-09-20 15:07:08,663 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:08,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-20 15:07:08,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:07:08,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:07:08,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:07:08,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-20 15:07:08,867 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:07:08,868 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:07:08,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 54 treesize of output 56 [2018-09-20 15:07:08,877 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:08,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-20 15:07:08,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:07:08,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:07:08,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 15:07:08,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-20 15:07:09,021 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 35 treesize of output 27 [2018-09-20 15:07:09,063 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:09,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-20 15:07:09,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:07:09,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:07:09,110 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-20 15:07:09,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-20 15:07:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:07:09,441 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:07:09,452 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:07:09,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-20 15:07:09,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-20 15:07:09,453 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-20 15:07:09,453 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-20 15:07:09,453 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 12 states. [2018-09-20 15:07:11,310 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 15:07:11,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:07:11,699 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-09-20 15:07:11,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-20 15:07:11,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-09-20 15:07:11,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:07:11,702 INFO L225 Difference]: With dead ends: 59 [2018-09-20 15:07:11,702 INFO L226 Difference]: Without dead ends: 50 [2018-09-20 15:07:11,703 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2018-09-20 15:07:11,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-20 15:07:11,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-09-20 15:07:11,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-20 15:07:11,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-09-20 15:07:11,710 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 63 [2018-09-20 15:07:11,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:07:11,710 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-09-20 15:07:11,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-20 15:07:11,710 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-09-20 15:07:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-20 15:07:11,711 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:07:11,711 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-20 15:07:11,711 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:07:11,712 INFO L82 PathProgramCache]: Analyzing trace with hash -782926587, now seen corresponding path program 1 times [2018-09-20 15:07:11,712 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:07:11,713 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2018-09-20 15:07:11,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:07:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:07:11,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:07:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:07:11,822 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:07:11,832 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:07:11,833 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:07:11,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:07:11,833 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:07:11,833 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:07:11,834 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 4 states. [2018-09-20 15:07:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:07:11,850 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-09-20 15:07:11,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:07:11,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-09-20 15:07:11,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:07:11,852 INFO L225 Difference]: With dead ends: 48 [2018-09-20 15:07:11,852 INFO L226 Difference]: Without dead ends: 0 [2018-09-20 15:07:11,853 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:07:11,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-20 15:07:11,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-20 15:07:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-20 15:07:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-20 15:07:11,854 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2018-09-20 15:07:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:07:11,855 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-20 15:07:11,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:07:11,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-20 15:07:11,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-20 15:07:11,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-20 15:07:12,158 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-20 15:07:12,227 INFO L429 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 16) the Hoare annotation is: true [2018-09-20 15:07:12,227 INFO L426 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 16) no Hoare annotation was computed. [2018-09-20 15:07:12,227 INFO L426 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 16) no Hoare annotation was computed. [2018-09-20 15:07:12,228 INFO L426 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-09-20 15:07:12,228 INFO L426 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2018-09-20 15:07:12,228 INFO L426 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-09-20 15:07:12,228 INFO L426 ceAbstractionStarter]: For program point L33-2(line 33) no Hoare annotation was computed. [2018-09-20 15:07:12,228 INFO L426 ceAbstractionStarter]: For program point L33-3(line 33) no Hoare annotation was computed. [2018-09-20 15:07:12,228 INFO L426 ceAbstractionStarter]: For program point L29-1(lines 29 34) no Hoare annotation was computed. [2018-09-20 15:07:12,229 INFO L426 ceAbstractionStarter]: For program point __fpclassify_doubleFINAL(lines 26 51) no Hoare annotation was computed. [2018-09-20 15:07:12,229 INFO L422 ceAbstractionStarter]: At program point L29-3(lines 29 34) the Hoare annotation is: (= |__fpclassify_double_#in~x| __fpclassify_double_~x) [2018-09-20 15:07:12,229 INFO L426 ceAbstractionStarter]: For program point L29-4(lines 26 51) no Hoare annotation was computed. [2018-09-20 15:07:12,229 INFO L426 ceAbstractionStarter]: For program point L46(lines 46 50) no Hoare annotation was computed. [2018-09-20 15:07:12,229 INFO L429 ceAbstractionStarter]: At program point __fpclassify_doubleENTRY(lines 26 51) the Hoare annotation is: true [2018-09-20 15:07:12,229 INFO L426 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2018-09-20 15:07:12,229 INFO L426 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-09-20 15:07:12,229 INFO L426 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-09-20 15:07:12,229 INFO L426 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-09-20 15:07:12,229 INFO L426 ceAbstractionStarter]: For program point L32-2(line 32) no Hoare annotation was computed. [2018-09-20 15:07:12,230 INFO L426 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2018-09-20 15:07:12,230 INFO L426 ceAbstractionStarter]: For program point L30-2(line 30) no Hoare annotation was computed. [2018-09-20 15:07:12,230 INFO L426 ceAbstractionStarter]: For program point L30-3(line 30) no Hoare annotation was computed. [2018-09-20 15:07:12,230 INFO L426 ceAbstractionStarter]: For program point __fpclassify_doubleEXIT(lines 26 51) no Hoare annotation was computed. [2018-09-20 15:07:12,230 INFO L426 ceAbstractionStarter]: For program point L39(lines 39 50) no Hoare annotation was computed. [2018-09-20 15:07:12,230 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:07:12,230 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:07:12,230 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:07:12,230 INFO L426 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-09-20 15:07:12,230 INFO L426 ceAbstractionStarter]: For program point L60-2(line 60) no Hoare annotation was computed. [2018-09-20 15:07:12,231 INFO L422 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (= fmax_double_~x |fmax_double_#in~x|))) (or (and .cse0 (exists ((v_prenex_12 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12)) |fmax_double_#in~x|) (not (bvule ((_ extract 63 32) v_prenex_12) (_ bv4293918719 32))) (not (= (_ bv0 32) ((_ extract 31 0) v_prenex_12)))))) (and .cse0 (= fmax_double_~y |fmax_double_#in~y|)))) [2018-09-20 15:07:12,231 INFO L429 ceAbstractionStarter]: At program point fmax_doubleENTRY(lines 53 61) the Hoare annotation is: true [2018-09-20 15:07:12,231 INFO L426 ceAbstractionStarter]: For program point L57-1(lines 57 58) no Hoare annotation was computed. [2018-09-20 15:07:12,231 INFO L422 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (and (= fmax_double_~x |fmax_double_#in~x|) (= fmax_double_~y |fmax_double_#in~y|)) [2018-09-20 15:07:12,231 INFO L426 ceAbstractionStarter]: For program point L55-1(lines 55 56) no Hoare annotation was computed. [2018-09-20 15:07:12,231 INFO L426 ceAbstractionStarter]: For program point fmax_doubleFINAL(lines 53 61) no Hoare annotation was computed. [2018-09-20 15:07:12,231 INFO L426 ceAbstractionStarter]: For program point fmax_doubleEXIT(lines 53 61) no Hoare annotation was computed. [2018-09-20 15:07:12,231 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:07:12,231 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-20 15:07:12,231 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:07:12,232 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:07:12,232 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 78) no Hoare annotation was computed. [2018-09-20 15:07:12,232 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 63 84) the Hoare annotation is: true [2018-09-20 15:07:12,232 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 63 84) no Hoare annotation was computed. [2018-09-20 15:07:12,232 INFO L426 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-09-20 15:07:12,232 INFO L426 ceAbstractionStarter]: For program point L77(lines 77 80) no Hoare annotation was computed. [2018-09-20 15:07:12,232 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 63 84) no Hoare annotation was computed. [2018-09-20 15:07:12,232 INFO L422 ceAbstractionStarter]: At program point L74(line 74) the Hoare annotation is: (and (= (fp.div RNE (_ +zero 11 53) (_ +zero 11 53)) main_~y~0) (fp.eq main_~x~0 main_~x~0)) [2018-09-20 15:07:12,232 INFO L426 ceAbstractionStarter]: For program point L74-1(line 74) no Hoare annotation was computed. [2018-09-20 15:07:12,233 INFO L422 ceAbstractionStarter]: At program point L72(line 72) the Hoare annotation is: (= (fp.div RNE (_ +zero 11 53) (_ +zero 11 53)) main_~y~0) [2018-09-20 15:07:12,233 INFO L426 ceAbstractionStarter]: For program point L72-1(lines 72 81) no Hoare annotation was computed. [2018-09-20 15:07:12,233 INFO L426 ceAbstractionStarter]: For program point L72-3(lines 72 81) no Hoare annotation was computed. [2018-09-20 15:07:12,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:07:12 BoogieIcfgContainer [2018-09-20 15:07:12,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:07:12,249 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:07:12,249 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:07:12,249 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:07:12,250 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:06:37" (3/4) ... [2018-09-20 15:07:12,253 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-20 15:07:12,260 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_double [2018-09-20 15:07:12,260 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-20 15:07:12,261 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2018-09-20 15:07:12,261 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure fmax_double [2018-09-20 15:07:12,261 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-20 15:07:12,268 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-09-20 15:07:12,268 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-09-20 15:07:12,269 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-09-20 15:07:12,296 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-09-20 15:07:12,321 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-20 15:07:12,321 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:07:12,322 INFO L168 Benchmark]: Toolchain (without parser) took 35884.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.4 MB). Free memory was 953.2 MB in the beginning and 903.0 MB in the end (delta: 50.2 MB). Peak memory consumption was 338.6 MB. Max. memory is 11.5 GB. [2018-09-20 15:07:12,324 INFO L168 Benchmark]: CDTParser took 0.22 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-20 15:07:12,324 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.42 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:07:12,325 INFO L168 Benchmark]: Boogie Preprocessor took 53.28 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:07:12,325 INFO L168 Benchmark]: RCFGBuilder took 728.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2018-09-20 15:07:12,327 INFO L168 Benchmark]: TraceAbstraction took 34656.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 1.1 GB in the beginning and 903.0 MB in the end (delta: 213.7 MB). Peak memory consumption was 351.5 MB. Max. memory is 11.5 GB. [2018-09-20 15:07:12,328 INFO L168 Benchmark]: Witness Printer took 72.79 ms. Allocated memory is still 1.3 GB. Free memory is still 903.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:07:12,331 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.22 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 366.42 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.28 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 728.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34656.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 1.1 GB in the beginning and 903.0 MB in the end (delta: 213.7 MB). Peak memory consumption was 351.5 MB. Max. memory is 11.5 GB. * Witness Printer took 72.79 ms. Allocated memory is still 1.3 GB. Free memory is still 903.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 78]: 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 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 51 locations, 1 error locations. SAFE Result, 34.5s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 20.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 726 SDtfs, 306 SDslu, 2286 SDs, 0 SdLazy, 1450 SolverSat, 42 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1024 GetRequests, 879 SyntacticMatches, 5 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=9, 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, 16 MinimizatonAttempts, 41 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 18 PreInvPairs, 23 NumberOfFragments, 66 HoareAnnotationTreeSize, 18 FomulaSimplifications, 53 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 893 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 936 ConstructedInterpolants, 123 QuantifiedInterpolants, 245704 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1886 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 196/216 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...