./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0661a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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 /storage/repos/svcomp/c/float-newlib/double_req_bl_0661a_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 affc33a17eeaac5bbef8bea17cfba29382789d60 ....................................................................................................................................................................................................................................................................................................................... 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 /storage/repos/svcomp/c/float-newlib/double_req_bl_0661a_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 affc33a17eeaac5bbef8bea17cfba29382789d60 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:49:04,365 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:49:04,369 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:49:04,387 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:49:04,388 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:49:04,389 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:49:04,391 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:49:04,393 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:49:04,395 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:49:04,396 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:49:04,397 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:49:04,398 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:49:04,399 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:49:04,400 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:49:04,402 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:49:04,403 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:49:04,404 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:49:04,406 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:49:04,409 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:49:04,411 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:49:04,413 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:49:04,414 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:49:04,418 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:49:04,418 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:49:04,418 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:49:04,420 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:49:04,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:49:04,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:49:04,424 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:49:04,426 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:49:04,426 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:49:04,426 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:49:04,427 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:49:04,427 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:49:04,428 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:49:04,429 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:49:04,429 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 03:49:04,446 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:49:04,446 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:49:04,447 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:49:04,447 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:49:04,448 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:49:04,448 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:49:04,448 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:49:04,449 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:49:04,449 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:49:04,449 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:49:04,449 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:49:04,449 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:49:04,451 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:49:04,451 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:49:04,451 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:49:04,451 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:49:04,451 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:49:04,452 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:49:04,452 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:49:04,452 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:49:04,452 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:49:04,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:49:04,452 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:49:04,454 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:49:04,454 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:49:04,454 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:49:04,454 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:49:04,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:49:04,455 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 -> affc33a17eeaac5bbef8bea17cfba29382789d60 [2018-12-31 03:49:04,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:49:04,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:49:04,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:49:04,525 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:49:04,525 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:49:04,526 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0661a_true-unreach-call.c [2018-12-31 03:49:04,586 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020dde7b4/1284aae3e2cd488db138cdfaa5da6b36/FLAGa1accb168 [2018-12-31 03:49:05,087 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:49:05,088 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0661a_true-unreach-call.c [2018-12-31 03:49:05,098 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020dde7b4/1284aae3e2cd488db138cdfaa5da6b36/FLAGa1accb168 [2018-12-31 03:49:05,406 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020dde7b4/1284aae3e2cd488db138cdfaa5da6b36 [2018-12-31 03:49:05,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:49:05,415 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:49:05,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:49:05,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:49:05,423 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:49:05,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:49:05" (1/1) ... [2018-12-31 03:49:05,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bce8417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:05, skipping insertion in model container [2018-12-31 03:49:05,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:49:05" (1/1) ... [2018-12-31 03:49:05,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:49:05,476 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:49:05,802 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:49:05,814 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:49:05,892 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:49:06,012 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:49:06,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:06 WrapperNode [2018-12-31 03:49:06,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:49:06,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:49:06,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:49:06,014 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:49:06,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:06" (1/1) ... [2018-12-31 03:49:06,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:06" (1/1) ... [2018-12-31 03:49:06,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:49:06,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:49:06,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:49:06,089 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:49:06,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:06" (1/1) ... [2018-12-31 03:49:06,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:06" (1/1) ... [2018-12-31 03:49:06,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:06" (1/1) ... [2018-12-31 03:49:06,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:06" (1/1) ... [2018-12-31 03:49:06,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:06" (1/1) ... [2018-12-31 03:49:06,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:06" (1/1) ... [2018-12-31 03:49:06,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:06" (1/1) ... [2018-12-31 03:49:06,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:49:06,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:49:06,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:49:06,167 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:49:06,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:06" (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-12-31 03:49:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:49:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-12-31 03:49:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 03:49:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 03:49:06,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:49:06,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:49:06,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 03:49:06,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2018-12-31 03:49:06,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:49:07,709 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:49:07,710 INFO L280 CfgBuilder]: Removed 48 assue(true) statements. [2018-12-31 03:49:07,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:49:07 BoogieIcfgContainer [2018-12-31 03:49:07,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:49:07,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:49:07,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:49:07,716 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:49:07,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:49:05" (1/3) ... [2018-12-31 03:49:07,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789c3b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:49:07, skipping insertion in model container [2018-12-31 03:49:07,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:06" (2/3) ... [2018-12-31 03:49:07,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789c3b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:49:07, skipping insertion in model container [2018-12-31 03:49:07,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:49:07" (3/3) ... [2018-12-31 03:49:07,719 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0661a_true-unreach-call.c [2018-12-31 03:49:07,730 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:49:07,740 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:49:07,760 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:49:07,802 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:49:07,803 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:49:07,803 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:49:07,803 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:49:07,804 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:49:07,804 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:49:07,804 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:49:07,804 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:49:07,804 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:49:07,824 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2018-12-31 03:49:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:49:07,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:49:07,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:49:07,834 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:49:07,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:49:07,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1517456143, now seen corresponding path program 1 times [2018-12-31 03:49:07,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:49:07,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:49:07,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:49:07,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:49:07,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:49:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:49:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:49:08,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:49:08,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:49:08,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:49:08,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:49:08,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:49:08,039 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 2 states. [2018-12-31 03:49:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:49:08,085 INFO L93 Difference]: Finished difference Result 237 states and 398 transitions. [2018-12-31 03:49:08,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:49:08,087 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-12-31 03:49:08,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:49:08,111 INFO L225 Difference]: With dead ends: 237 [2018-12-31 03:49:08,112 INFO L226 Difference]: Without dead ends: 116 [2018-12-31 03:49:08,117 INFO L631 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-12-31 03:49:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-31 03:49:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-31 03:49:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-31 03:49:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 165 transitions. [2018-12-31 03:49:08,190 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 165 transitions. Word has length 12 [2018-12-31 03:49:08,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:49:08,190 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 165 transitions. [2018-12-31 03:49:08,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:49:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 165 transitions. [2018-12-31 03:49:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:49:08,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:49:08,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:49:08,194 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:49:08,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:49:08,196 INFO L82 PathProgramCache]: Analyzing trace with hash -229938040, now seen corresponding path program 1 times [2018-12-31 03:49:08,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:49:08,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:49:08,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:49:08,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:49:08,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:49:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:49:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:49:08,586 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:49:08,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:49:08 BoogieIcfgContainer [2018-12-31 03:49:08,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:49:08,652 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:49:08,653 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:49:08,653 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:49:08,653 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:49:07" (3/4) ... [2018-12-31 03:49:08,658 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:49:08,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:49:08,659 INFO L168 Benchmark]: Toolchain (without parser) took 3247.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -58.9 MB). Peak memory consumption was 72.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:49:08,662 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:49:08,663 INFO L168 Benchmark]: CACSL2BoogieTranslator took 597.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:49:08,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.66 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:49:08,666 INFO L168 Benchmark]: Boogie Preprocessor took 77.03 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:49:08,667 INFO L168 Benchmark]: RCFGBuilder took 1544.79 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2018-12-31 03:49:08,667 INFO L168 Benchmark]: TraceAbstraction took 940.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:49:08,668 INFO L168 Benchmark]: Witness Printer took 5.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:49:08,674 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 597.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.66 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.03 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1544.79 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 940.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 271]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of someUnaryDOUBLEoperation at line 265, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 270. Possible FailurePath: [L37-L42] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L44-L49] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L51-L58] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L60-L62] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L139-L140] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L264] double x = __VERIFIER_nondet_double(); [L265] double y = -0.0; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L267] COND TRUE x > 0.0 [L143] double z; [L144] __int32_t k, m, hx, hy, ix, iy; [L145] __uint32_t lx, ly; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L148] ieee_double_shape_type ew_u; [L149] ew_u.value = (x) [L150] EXPR ew_u.parts.msw [L150] (hx) = ew_u.parts.msw [L151] EXPR ew_u.parts.lsw [L151] (lx) = ew_u.parts.lsw [L153] ix = hx & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L155] ieee_double_shape_type ew_u; [L156] ew_u.value = (y) [L157] EXPR ew_u.parts.msw [L157] (hy) = ew_u.parts.msw [L158] EXPR ew_u.parts.lsw [L158] (ly) = ew_u.parts.lsw [L160] iy = hy & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L161-L162] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L163] return x + y; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L268] double res = __ieee754_atan2(y, x); [L270] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L270] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L271] __VERIFIER_error() VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 1 error locations. UNSAFE Result, 0.8s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 170 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:49:11,137 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:49:11,139 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:49:11,152 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:49:11,152 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:49:11,153 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:49:11,154 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:49:11,156 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:49:11,158 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:49:11,159 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:49:11,160 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:49:11,160 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:49:11,162 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:49:11,162 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:49:11,164 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:49:11,164 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:49:11,165 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:49:11,167 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:49:11,169 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:49:11,171 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:49:11,172 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:49:11,173 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:49:11,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:49:11,176 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:49:11,176 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:49:11,177 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:49:11,178 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:49:11,179 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:49:11,179 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:49:11,180 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:49:11,181 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:49:11,182 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:49:11,182 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:49:11,182 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:49:11,183 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:49:11,183 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:49:11,184 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 03:49:11,200 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:49:11,201 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:49:11,202 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:49:11,202 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:49:11,202 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:49:11,203 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:49:11,203 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:49:11,203 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:49:11,203 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:49:11,203 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:49:11,203 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:49:11,204 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:49:11,204 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:49:11,204 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:49:11,204 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:49:11,204 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:49:11,204 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:49:11,206 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:49:11,206 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:49:11,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:49:11,207 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:49:11,207 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:49:11,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:49:11,207 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:49:11,208 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:49:11,209 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:49:11,209 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:49:11,209 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:49:11,209 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:49:11,209 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:49:11,209 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 -> affc33a17eeaac5bbef8bea17cfba29382789d60 [2018-12-31 03:49:11,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:49:11,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:49:11,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:49:11,275 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:49:11,276 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:49:11,276 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0661a_true-unreach-call.c [2018-12-31 03:49:11,340 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a45a80b5f/78096405d999481e83457a1c4b1f5f78/FLAG000fa7fb2 [2018-12-31 03:49:11,860 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:49:11,861 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0661a_true-unreach-call.c [2018-12-31 03:49:11,871 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a45a80b5f/78096405d999481e83457a1c4b1f5f78/FLAG000fa7fb2 [2018-12-31 03:49:12,165 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a45a80b5f/78096405d999481e83457a1c4b1f5f78 [2018-12-31 03:49:12,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:49:12,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:49:12,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:49:12,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:49:12,176 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:49:12,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:49:12" (1/1) ... [2018-12-31 03:49:12,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be24df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:12, skipping insertion in model container [2018-12-31 03:49:12,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:49:12" (1/1) ... [2018-12-31 03:49:12,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:49:12,232 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:49:12,590 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:49:12,605 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:49:12,684 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:49:12,741 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:49:12,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:12 WrapperNode [2018-12-31 03:49:12,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:49:12,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:49:12,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:49:12,744 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:49:12,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:12" (1/1) ... [2018-12-31 03:49:12,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:12" (1/1) ... [2018-12-31 03:49:12,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:49:12,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:49:12,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:49:12,916 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:49:12,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:12" (1/1) ... [2018-12-31 03:49:12,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:12" (1/1) ... [2018-12-31 03:49:12,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:12" (1/1) ... [2018-12-31 03:49:12,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:12" (1/1) ... [2018-12-31 03:49:12,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:12" (1/1) ... [2018-12-31 03:49:13,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:12" (1/1) ... [2018-12-31 03:49:13,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:12" (1/1) ... [2018-12-31 03:49:13,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:49:13,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:49:13,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:49:13,019 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:49:13,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:12" (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-12-31 03:49:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-12-31 03:49:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-31 03:49:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:49:13,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2018-12-31 03:49:13,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 03:49:13,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:49:13,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:49:13,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-31 03:49:13,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:49:13,550 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:13,681 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:13,787 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:13,947 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:14,011 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:14,671 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:14,699 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:36,226 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:36,306 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:36,345 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:36,383 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:37,413 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:37,445 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:53,961 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:53,987 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:55,195 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:55,221 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:49:55,221 INFO L280 CfgBuilder]: Removed 48 assue(true) statements. [2018-12-31 03:49:55,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:49:55 BoogieIcfgContainer [2018-12-31 03:49:55,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:49:55,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:49:55,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:49:55,227 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:49:55,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:49:12" (1/3) ... [2018-12-31 03:49:55,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a49384d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:49:55, skipping insertion in model container [2018-12-31 03:49:55,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:12" (2/3) ... [2018-12-31 03:49:55,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a49384d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:49:55, skipping insertion in model container [2018-12-31 03:49:55,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:49:55" (3/3) ... [2018-12-31 03:49:55,233 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0661a_true-unreach-call.c [2018-12-31 03:49:55,242 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:49:55,251 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:49:55,271 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:49:55,304 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:49:55,305 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:49:55,305 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:49:55,305 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:49:55,305 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:49:55,306 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:49:55,306 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:49:55,306 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:49:55,306 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:49:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2018-12-31 03:49:55,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:49:55,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:49:55,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:49:55,333 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:49:55,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:49:55,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1517456143, now seen corresponding path program 1 times [2018-12-31 03:49:55,346 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:49:55,346 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-31 03:49:55,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:49:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:49:55,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:49:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:49:55,710 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:49:55,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:49:55,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:49:55,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:49:55,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:49:55,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:49:55,751 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 2 states. [2018-12-31 03:49:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:49:55,784 INFO L93 Difference]: Finished difference Result 237 states and 398 transitions. [2018-12-31 03:49:55,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:49:55,786 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-12-31 03:49:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:49:55,800 INFO L225 Difference]: With dead ends: 237 [2018-12-31 03:49:55,800 INFO L226 Difference]: Without dead ends: 116 [2018-12-31 03:49:55,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-12-31 03:49:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-31 03:49:55,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-31 03:49:55,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-31 03:49:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 165 transitions. [2018-12-31 03:49:55,853 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 165 transitions. Word has length 12 [2018-12-31 03:49:55,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:49:55,854 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 165 transitions. [2018-12-31 03:49:55,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:49:55,854 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 165 transitions. [2018-12-31 03:49:55,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:49:55,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:49:55,855 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:49:55,856 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:49:55,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:49:55,856 INFO L82 PathProgramCache]: Analyzing trace with hash -229938040, now seen corresponding path program 1 times [2018-12-31 03:49:55,857 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:49:55,857 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-31 03:49:55,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:49:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:49:56,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:49:56,376 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:49:56,379 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:49:56,386 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-12-31 03:49:56,659 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-12-31 03:49:56,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 [2018-12-31 03:49:56,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 03:49:56,834 INFO L478 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 17 treesize of output 13 [2018-12-31 03:49:56,845 INFO L478 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 13 treesize of output 1 [2018-12-31 03:49:56,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 03:49:56,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:49:56,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:49:56,930 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-12-31 03:49:56,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:22 [2018-12-31 03:49:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:49:59,317 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:49:59,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:49:59,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 03:49:59,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:49:59,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:49:59,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=42, Unknown=1, NotChecked=0, Total=56 [2018-12-31 03:49:59,342 INFO L87 Difference]: Start difference. First operand 116 states and 165 transitions. Second operand 8 states. [2018-12-31 03:49:59,612 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 03:50:04,291 WARN L181 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 40 [2018-12-31 03:50:06,413 WARN L181 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 45 [2018-12-31 03:50:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:08,074 INFO L93 Difference]: Finished difference Result 171 states and 238 transitions. [2018-12-31 03:50:08,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:50:08,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-31 03:50:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:08,464 INFO L225 Difference]: With dead ends: 171 [2018-12-31 03:50:08,464 INFO L226 Difference]: Without dead ends: 107 [2018-12-31 03:50:08,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=53, Invalid=102, Unknown=1, NotChecked=0, Total=156 [2018-12-31 03:50:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-31 03:50:08,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-31 03:50:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-31 03:50:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 145 transitions. [2018-12-31 03:50:08,496 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 145 transitions. Word has length 14 [2018-12-31 03:50:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:08,497 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 145 transitions. [2018-12-31 03:50:08,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:50:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2018-12-31 03:50:08,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 03:50:08,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:08,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:08,500 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:08,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:08,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1963663166, now seen corresponding path program 1 times [2018-12-31 03:50:08,501 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:08,502 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-31 03:50:08,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:08,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:50:08,963 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:08,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:08,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:50:08,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:50:08,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:50:08,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:50:08,979 INFO L87 Difference]: Start difference. First operand 107 states and 145 transitions. Second operand 7 states. [2018-12-31 03:50:09,442 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-12-31 03:50:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:11,267 INFO L93 Difference]: Finished difference Result 184 states and 246 transitions. [2018-12-31 03:50:11,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:50:11,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-31 03:50:11,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:11,272 INFO L225 Difference]: With dead ends: 184 [2018-12-31 03:50:11,273 INFO L226 Difference]: Without dead ends: 116 [2018-12-31 03:50:11,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-31 03:50:11,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-31 03:50:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2018-12-31 03:50:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-31 03:50:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 143 transitions. [2018-12-31 03:50:11,308 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 143 transitions. Word has length 19 [2018-12-31 03:50:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:11,308 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 143 transitions. [2018-12-31 03:50:11,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:50:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 143 transitions. [2018-12-31 03:50:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 03:50:11,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:11,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:11,311 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:11,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:11,312 INFO L82 PathProgramCache]: Analyzing trace with hash -188655804, now seen corresponding path program 1 times [2018-12-31 03:50:11,312 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:11,313 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-12-31 03:50:11,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:11,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:50:11,755 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:11,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:11,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:50:11,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:50:11,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:50:11,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:50:11,778 INFO L87 Difference]: Start difference. First operand 107 states and 143 transitions. Second operand 6 states. [2018-12-31 03:50:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:18,622 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2018-12-31 03:50:18,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:50:18,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-31 03:50:18,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:18,625 INFO L225 Difference]: With dead ends: 119 [2018-12-31 03:50:18,625 INFO L226 Difference]: Without dead ends: 116 [2018-12-31 03:50:18,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-31 03:50:18,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-31 03:50:18,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2018-12-31 03:50:18,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-31 03:50:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 145 transitions. [2018-12-31 03:50:18,662 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 145 transitions. Word has length 19 [2018-12-31 03:50:18,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:18,662 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 145 transitions. [2018-12-31 03:50:18,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:50:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 145 transitions. [2018-12-31 03:50:18,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 03:50:18,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:18,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:18,666 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:18,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:18,667 INFO L82 PathProgramCache]: Analyzing trace with hash 291898349, now seen corresponding path program 1 times [2018-12-31 03:50:18,668 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:18,668 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-12-31 03:50:18,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:18,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:50:19,152 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:19,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:19,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:50:19,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:50:19,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:50:19,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:50:19,167 INFO L87 Difference]: Start difference. First operand 109 states and 145 transitions. Second operand 7 states. [2018-12-31 03:50:19,624 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-12-31 03:50:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:21,504 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2018-12-31 03:50:21,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:50:21,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-31 03:50:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:21,507 INFO L225 Difference]: With dead ends: 127 [2018-12-31 03:50:21,507 INFO L226 Difference]: Without dead ends: 118 [2018-12-31 03:50:21,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-31 03:50:21,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-31 03:50:21,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2018-12-31 03:50:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-31 03:50:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2018-12-31 03:50:21,565 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 143 transitions. Word has length 20 [2018-12-31 03:50:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:21,566 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 143 transitions. [2018-12-31 03:50:21,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:50:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2018-12-31 03:50:21,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 03:50:21,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:21,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:21,572 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:21,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:21,573 INFO L82 PathProgramCache]: Analyzing trace with hash 302239975, now seen corresponding path program 1 times [2018-12-31 03:50:21,573 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:21,573 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) [2018-12-31 03:50:21,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-31 03:50:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:21,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:50:21,884 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:21,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:21,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:50:21,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 03:50:21,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 03:50:21,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:50:21,898 INFO L87 Difference]: Start difference. First operand 109 states and 143 transitions. Second operand 5 states. [2018-12-31 03:50:23,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:23,999 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2018-12-31 03:50:24,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:50:24,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-31 03:50:24,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:24,002 INFO L225 Difference]: With dead ends: 121 [2018-12-31 03:50:24,002 INFO L226 Difference]: Without dead ends: 118 [2018-12-31 03:50:24,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:50:24,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-31 03:50:24,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2018-12-31 03:50:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-31 03:50:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2018-12-31 03:50:24,034 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 143 transitions. Word has length 21 [2018-12-31 03:50:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:24,035 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 143 transitions. [2018-12-31 03:50:24,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 03:50:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2018-12-31 03:50:24,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 03:50:24,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:24,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:24,036 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:24,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:24,037 INFO L82 PathProgramCache]: Analyzing trace with hash 839109257, now seen corresponding path program 1 times [2018-12-31 03:50:24,037 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:24,037 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-12-31 03:50:24,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:24,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:50:26,112 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:26,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:26,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 03:50:26,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:50:26,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:50:26,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:50:26,133 INFO L87 Difference]: Start difference. First operand 109 states and 143 transitions. Second operand 8 states. [2018-12-31 03:50:29,853 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-31 03:50:32,157 WARN L181 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 44 [2018-12-31 03:50:32,360 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-31 03:50:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:34,043 INFO L93 Difference]: Finished difference Result 192 states and 244 transitions. [2018-12-31 03:50:34,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:50:34,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-12-31 03:50:34,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:34,047 INFO L225 Difference]: With dead ends: 192 [2018-12-31 03:50:34,047 INFO L226 Difference]: Without dead ends: 124 [2018-12-31 03:50:34,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-12-31 03:50:34,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-31 03:50:34,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2018-12-31 03:50:34,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-31 03:50:34,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2018-12-31 03:50:34,088 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 21 [2018-12-31 03:50:34,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:34,089 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. [2018-12-31 03:50:34,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:50:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2018-12-31 03:50:34,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 03:50:34,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:34,091 INFO L402 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] [2018-12-31 03:50:34,091 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:34,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:34,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1575840196, now seen corresponding path program 1 times [2018-12-31 03:50:34,092 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:34,092 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-12-31 03:50:34,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:34,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:50:35,193 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:35,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:35,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 03:50:35,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:50:35,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:50:35,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:50:35,211 INFO L87 Difference]: Start difference. First operand 106 states and 138 transitions. Second operand 8 states. [2018-12-31 03:50:37,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:37,040 INFO L93 Difference]: Finished difference Result 135 states and 171 transitions. [2018-12-31 03:50:37,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:50:37,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-31 03:50:37,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:37,446 INFO L225 Difference]: With dead ends: 135 [2018-12-31 03:50:37,446 INFO L226 Difference]: Without dead ends: 115 [2018-12-31 03:50:37,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-12-31 03:50:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-31 03:50:37,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2018-12-31 03:50:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-31 03:50:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 137 transitions. [2018-12-31 03:50:37,483 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 137 transitions. Word has length 22 [2018-12-31 03:50:37,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:37,483 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 137 transitions. [2018-12-31 03:50:37,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:50:37,483 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2018-12-31 03:50:37,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 03:50:37,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:37,484 INFO L402 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] [2018-12-31 03:50:37,484 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:37,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:37,485 INFO L82 PathProgramCache]: Analyzing trace with hash 328100550, now seen corresponding path program 1 times [2018-12-31 03:50:37,487 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:37,487 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-12-31 03:50:37,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:37,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:50:37,907 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:37,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:37,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:50:37,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:50:37,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:50:37,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:50:37,922 INFO L87 Difference]: Start difference. First operand 106 states and 137 transitions. Second operand 7 states. [2018-12-31 03:51:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:51:13,406 INFO L93 Difference]: Finished difference Result 140 states and 173 transitions. [2018-12-31 03:51:13,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:51:13,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-31 03:51:13,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:51:13,814 INFO L225 Difference]: With dead ends: 140 [2018-12-31 03:51:13,814 INFO L226 Difference]: Without dead ends: 112 [2018-12-31 03:51:13,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-31 03:51:13,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-31 03:51:13,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2018-12-31 03:51:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-31 03:51:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2018-12-31 03:51:13,849 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 23 [2018-12-31 03:51:13,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:51:13,849 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2018-12-31 03:51:13,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:51:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2018-12-31 03:51:13,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 03:51:13,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:51:13,851 INFO L402 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] [2018-12-31 03:51:13,852 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:51:13,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:51:13,852 INFO L82 PathProgramCache]: Analyzing trace with hash -105632341, now seen corresponding path program 1 times [2018-12-31 03:51:13,852 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:51:13,853 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-12-31 03:51:13,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:51:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:51:14,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:51:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:51:14,281 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:51:14,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:51:14,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 03:51:14,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:51:14,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:51:14,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:51:14,301 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand 8 states. [2018-12-31 03:51:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:51:51,113 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2018-12-31 03:51:51,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 03:51:51,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-12-31 03:51:51,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:51:51,115 INFO L225 Difference]: With dead ends: 124 [2018-12-31 03:51:51,115 INFO L226 Difference]: Without dead ends: 121 [2018-12-31 03:51:51,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-12-31 03:51:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-31 03:51:51,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 94. [2018-12-31 03:51:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-31 03:51:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2018-12-31 03:51:51,148 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 23 [2018-12-31 03:51:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:51:51,149 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2018-12-31 03:51:51,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:51:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2018-12-31 03:51:51,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 03:51:51,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:51:51,151 INFO L402 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] [2018-12-31 03:51:51,152 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:51:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:51:51,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2123579340, now seen corresponding path program 1 times [2018-12-31 03:51:51,152 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:51:51,152 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-12-31 03:51:51,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:51:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:51:51,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:51:53,550 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 03:51:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:51:53,694 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:51:53,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:51:53,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 03:51:53,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:51:53,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:51:53,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:51:53,711 INFO L87 Difference]: Start difference. First operand 94 states and 117 transitions. Second operand 8 states. [2018-12-31 03:52:00,476 WARN L181 SmtUtils]: Spent 479.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-31 03:52:00,710 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-31 03:52:02,907 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 44 [2018-12-31 03:52:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:52:04,459 INFO L93 Difference]: Finished difference Result 169 states and 206 transitions. [2018-12-31 03:52:04,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:52:04,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-12-31 03:52:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:52:04,462 INFO L225 Difference]: With dead ends: 169 [2018-12-31 03:52:04,462 INFO L226 Difference]: Without dead ends: 111 [2018-12-31 03:52:04,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=53, Invalid=101, Unknown=2, NotChecked=0, Total=156 [2018-12-31 03:52:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-31 03:52:04,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 91. [2018-12-31 03:52:04,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-31 03:52:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2018-12-31 03:52:04,499 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 23 [2018-12-31 03:52:04,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:52:04,499 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2018-12-31 03:52:04,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:52:04,499 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2018-12-31 03:52:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 03:52:04,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:52:04,500 INFO L402 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] [2018-12-31 03:52:04,500 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:52:04,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:52:04,500 INFO L82 PathProgramCache]: Analyzing trace with hash -640851047, now seen corresponding path program 1 times [2018-12-31 03:52:04,500 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:52:04,501 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-12-31 03:52:04,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:52:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:52:04,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:52:04,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:52:04,884 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:52:04,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:52:04,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 03:52:04,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 03:52:04,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 03:52:04,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-31 03:52:04,898 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand 10 states. [2018-12-31 03:52:10,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:52:10,187 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2018-12-31 03:52:10,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 03:52:10,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-31 03:52:10,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:52:10,189 INFO L225 Difference]: With dead ends: 100 [2018-12-31 03:52:10,189 INFO L226 Difference]: Without dead ends: 88 [2018-12-31 03:52:10,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-12-31 03:52:10,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-31 03:52:10,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-31 03:52:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-31 03:52:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2018-12-31 03:52:10,225 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 23 [2018-12-31 03:52:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:52:10,225 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2018-12-31 03:52:10,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 03:52:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2018-12-31 03:52:10,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 03:52:10,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:52:10,226 INFO L402 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-12-31 03:52:10,226 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:52:10,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:52:10,226 INFO L82 PathProgramCache]: Analyzing trace with hash 941904828, now seen corresponding path program 1 times [2018-12-31 03:52:10,227 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:52:10,227 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-12-31 03:52:10,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:52:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:52:10,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:52:10,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:52:10,566 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:52:10,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:52:10,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 03:52:10,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 03:52:10,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 03:52:10,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:52:10,580 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand 9 states. [2018-12-31 03:52:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:52:12,276 INFO L93 Difference]: Finished difference Result 97 states and 116 transitions. [2018-12-31 03:52:12,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 03:52:12,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-12-31 03:52:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:52:12,278 INFO L225 Difference]: With dead ends: 97 [2018-12-31 03:52:12,279 INFO L226 Difference]: Without dead ends: 85 [2018-12-31 03:52:12,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-12-31 03:52:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-31 03:52:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-31 03:52:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-31 03:52:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2018-12-31 03:52:12,315 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 25 [2018-12-31 03:52:12,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:52:12,316 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2018-12-31 03:52:12,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 03:52:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2018-12-31 03:52:12,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 03:52:12,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:52:12,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:52:12,317 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:52:12,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:52:12,317 INFO L82 PathProgramCache]: Analyzing trace with hash 782702068, now seen corresponding path program 1 times [2018-12-31 03:52:12,318 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:52:12,318 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-12-31 03:52:12,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:52:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:52:16,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:52:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:52:17,142 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:52:17,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:52:17,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 03:52:17,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:52:17,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:52:17,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:52:17,222 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 6 states. [2018-12-31 03:52:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:52:46,583 INFO L93 Difference]: Finished difference Result 126 states and 150 transitions. [2018-12-31 03:52:46,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:52:46,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-31 03:52:46,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:52:46,682 INFO L225 Difference]: With dead ends: 126 [2018-12-31 03:52:46,682 INFO L226 Difference]: Without dead ends: 111 [2018-12-31 03:52:46,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:52:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-31 03:52:46,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 79. [2018-12-31 03:52:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-31 03:52:46,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2018-12-31 03:52:46,719 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 26 [2018-12-31 03:52:46,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:52:46,720 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2018-12-31 03:52:46,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:52:46,720 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2018-12-31 03:52:46,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 03:52:46,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:52:46,720 INFO L402 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-12-31 03:52:46,721 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:52:46,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:52:46,721 INFO L82 PathProgramCache]: Analyzing trace with hash -485446016, now seen corresponding path program 1 times [2018-12-31 03:52:46,721 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:52:46,721 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) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-12-31 03:52:46,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:52:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:52:47,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:52:47,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:52:47,303 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:52:47,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:52:47,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-31 03:52:47,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 03:52:47,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 03:52:47,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-31 03:52:47,320 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand 12 states. [2018-12-31 03:53:14,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:53:14,687 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2018-12-31 03:53:14,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 03:53:14,688 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-12-31 03:53:14,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:53:14,689 INFO L225 Difference]: With dead ends: 86 [2018-12-31 03:53:14,689 INFO L226 Difference]: Without dead ends: 69 [2018-12-31 03:53:14,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2018-12-31 03:53:14,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-31 03:53:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-31 03:53:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-31 03:53:14,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2018-12-31 03:53:14,720 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 27 [2018-12-31 03:53:14,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:53:14,720 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2018-12-31 03:53:14,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 03:53:14,720 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2018-12-31 03:53:14,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 03:53:14,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:53:14,723 INFO L402 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] [2018-12-31 03:53:14,723 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:53:14,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:53:14,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1972844972, now seen corresponding path program 1 times [2018-12-31 03:53:14,725 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:53:14,725 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-12-31 03:53:14,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:53:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:53:15,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:53:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:53:16,067 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:53:16,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:53:16,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:53:16,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:53:16,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:53:16,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:53:16,092 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 7 states. [2018-12-31 03:53:20,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:53:20,779 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2018-12-31 03:53:20,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:53:20,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-12-31 03:53:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:53:20,781 INFO L225 Difference]: With dead ends: 78 [2018-12-31 03:53:20,781 INFO L226 Difference]: Without dead ends: 69 [2018-12-31 03:53:20,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-31 03:53:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-31 03:53:20,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-31 03:53:20,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-31 03:53:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2018-12-31 03:53:20,830 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 37 [2018-12-31 03:53:20,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:53:20,831 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2018-12-31 03:53:20,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:53:20,831 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2018-12-31 03:53:20,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-31 03:53:20,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:53:20,832 INFO L402 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-12-31 03:53:20,832 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:53:20,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:53:20,832 INFO L82 PathProgramCache]: Analyzing trace with hash -515625948, now seen corresponding path program 1 times [2018-12-31 03:53:20,833 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:53:20,834 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) [2018-12-31 03:53:20,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2018-12-31 03:53:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:53:22,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:53:24,531 WARN L181 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 03:53:24,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:53:24,679 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:53:24,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:53:24,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 03:53:24,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:53:24,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:53:24,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=42, Unknown=1, NotChecked=0, Total=56 [2018-12-31 03:53:24,706 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand 8 states. [2018-12-31 03:53:29,491 WARN L181 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-31 03:53:31,677 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-31 03:53:33,793 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 44 [2018-12-31 03:53:35,569 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-31 03:53:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:53:35,594 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2018-12-31 03:53:35,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:53:35,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-12-31 03:53:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:53:35,596 INFO L225 Difference]: With dead ends: 78 [2018-12-31 03:53:35,596 INFO L226 Difference]: Without dead ends: 66 [2018-12-31 03:53:35,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=53, Invalid=101, Unknown=2, NotChecked=0, Total=156 [2018-12-31 03:53:35,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-31 03:53:35,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-31 03:53:35,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-31 03:53:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2018-12-31 03:53:35,638 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 40 [2018-12-31 03:53:35,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:53:35,638 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2018-12-31 03:53:35,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:53:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2018-12-31 03:53:35,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-31 03:53:35,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:53:35,641 INFO L402 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-12-31 03:53:35,642 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:53:35,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:53:35,643 INFO L82 PathProgramCache]: Analyzing trace with hash 169266622, now seen corresponding path program 1 times [2018-12-31 03:53:35,643 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:53:35,643 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2018-12-31 03:53:35,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:53:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:53:36,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:53:37,091 INFO L478 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 66 treesize of output 60 [2018-12-31 03:53:37,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-12-31 03:53:37,127 INFO L478 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 37 treesize of output 27 [2018-12-31 03:53:37,128 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 03:53:37,140 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:53:37,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:53:37,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-31 03:53:37,205 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:95, output treesize:56 [2018-12-31 03:53:39,678 INFO L478 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 66 treesize of output 60 [2018-12-31 03:53:39,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-12-31 03:53:39,729 INFO L478 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 37 treesize of output 27 [2018-12-31 03:53:39,729 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 03:53:39,749 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:53:39,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:53:39,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-31 03:53:39,917 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:164, output treesize:125 [2018-12-31 03:53:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:53:41,627 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:53:41,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:53:41,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-31 03:53:41,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 03:53:41,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 03:53:41,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-12-31 03:53:41,656 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand 18 states. [2018-12-31 03:53:48,830 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-12-31 03:53:53,368 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-31 03:53:55,016 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-31 03:53:55,018 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:652) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:256) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:715) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2018-12-31 03:53:55,026 INFO L168 Benchmark]: Toolchain (without parser) took 282856.81 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.6 MB). Free memory was 952.7 MB in the beginning and 962.1 MB in the end (delta: -9.4 MB). Peak memory consumption was 219.2 MB. Max. memory is 11.5 GB. [2018-12-31 03:53:55,027 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:53:55,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 570.22 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:53:55,028 INFO L168 Benchmark]: Boogie Procedure Inliner took 171.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-12-31 03:53:55,035 INFO L168 Benchmark]: Boogie Preprocessor took 102.85 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:53:55,036 INFO L168 Benchmark]: RCFGBuilder took 42203.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 11.5 GB. [2018-12-31 03:53:55,036 INFO L168 Benchmark]: TraceAbstraction took 239798.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.8 MB). Free memory was 1.0 GB in the beginning and 962.1 MB in the end (delta: 87.0 MB). Peak memory consumption was 179.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:53:55,047 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 570.22 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 171.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 102.85 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 42203.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 239798.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.8 MB). Free memory was 1.0 GB in the beginning and 962.1 MB in the end (delta: 87.0 MB). Peak memory consumption was 179.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...