/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251a_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 84abb26640f37e4e810dde89d6f06da8a4d3f9c6 ........................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251a_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 84abb26640f37e4e810dde89d6f06da8a4d3f9c6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_30 term size 40 --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 15:06:29,372 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:06:29,375 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:06:29,394 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:06:29,394 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:06:29,396 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:06:29,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:06:29,400 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:06:29,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:06:29,405 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:06:29,406 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:06:29,408 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:06:29,409 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:06:29,412 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:06:29,420 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:06:29,421 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:06:29,422 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:06:29,423 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:06:29,428 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:06:29,432 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:06:29,433 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:06:29,434 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:06:29,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:06:29,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:06:29,439 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:06:29,441 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:06:29,442 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:06:29,443 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:06:29,446 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:06:29,448 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:06:29,448 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:06:29,449 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:06:29,451 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:06:29,451 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:06:29,452 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:06:29,453 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:06:29,454 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 15:06:29,481 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:06:29,481 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:06:29,482 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:06:29,483 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:06:29,483 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:06:29,483 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:06:29,484 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:06:29,484 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:06:29,484 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:06:29,484 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 15:06:29,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:06:29,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:06:29,486 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:06:29,486 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:06:29,486 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:06:29,486 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:06:29,486 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:06:29,486 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:06:29,487 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:06:29,487 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:06:29,487 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:06:29,487 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:06:29,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:06:29,489 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:06:29,489 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:06:29,489 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:06:29,489 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 15:06:29,489 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:06:29,490 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 15:06:29,490 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 -> 84abb26640f37e4e810dde89d6f06da8a4d3f9c6 [2018-09-20 15:06:29,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:06:29,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:06:29,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:06:29,575 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:06:29,575 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:06:29,576 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251a_true-unreach-call.c [2018-09-20 15:06:29,943 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44ea9608f/1cfee25bbf454fc0a7b50a1cdc319d45/FLAG0a838f0e2 [2018-09-20 15:06:30,135 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:06:30,137 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1251a_true-unreach-call.c [2018-09-20 15:06:30,147 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44ea9608f/1cfee25bbf454fc0a7b50a1cdc319d45/FLAG0a838f0e2 [2018-09-20 15:06:30,178 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44ea9608f/1cfee25bbf454fc0a7b50a1cdc319d45 [2018-09-20 15:06:30,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:06:30,187 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:06:30,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:06:30,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:06:30,197 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:06:30,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:06:30" (1/1) ... [2018-09-20 15:06:30,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a5f1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:30, skipping insertion in model container [2018-09-20 15:06:30,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:06:30" (1/1) ... [2018-09-20 15:06:30,215 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:06:30,473 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:06:30,492 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:06:30,511 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:06:30,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:30 WrapperNode [2018-09-20 15:06:30,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:06:30,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:06:30,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:06:30,555 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:06:30,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:30" (1/1) ... [2018-09-20 15:06:30,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:30" (1/1) ... [2018-09-20 15:06:30,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:30" (1/1) ... [2018-09-20 15:06:30,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:30" (1/1) ... [2018-09-20 15:06:30,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:30" (1/1) ... [2018-09-20 15:06:30,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:30" (1/1) ... [2018-09-20 15:06:30,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:30" (1/1) ... [2018-09-20 15:06:30,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:06:30,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:06:30,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:06:30,609 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:06:30,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:06:30,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:06:30,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:06:30,690 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-20 15:06:30,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-09-20 15:06:30,690 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-09-20 15:06:30,690 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:06:30,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:06:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 15:06:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-20 15:06:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-09-20 15:06:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:06:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-20 15:06:30,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-20 15:06:30,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:06:30,692 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-09-20 15:06:30,692 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:06:30,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:06:30,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:06:30,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-20 15:06:30,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-20 15:06:30,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-20 15:06:30,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-20 15:06:31,380 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:06:31,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:06:31 BoogieIcfgContainer [2018-09-20 15:06:31,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:06:31,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:06:31,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:06:31,386 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:06:31,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:06:30" (1/3) ... [2018-09-20 15:06:31,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b667d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:06:31, skipping insertion in model container [2018-09-20 15:06:31,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:30" (2/3) ... [2018-09-20 15:06:31,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b667d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:06:31, skipping insertion in model container [2018-09-20 15:06:31,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:06:31" (3/3) ... [2018-09-20 15:06:31,391 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251a_true-unreach-call.c [2018-09-20 15:06:31,402 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:06:31,416 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:06:31,473 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:06:31,474 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:06:31,474 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:06:31,474 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:06:31,475 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:06:31,475 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:06:31,475 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:06:31,475 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:06:31,475 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:06:31,510 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-09-20 15:06:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-20 15:06:31,519 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:31,521 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:31,523 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:31,532 INFO L82 PathProgramCache]: Analyzing trace with hash 754859581, now seen corresponding path program 1 times [2018-09-20 15:06:31,535 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:06:31,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:06:31,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:06:31,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:31,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:06:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:06:31,751 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:31,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:06:31,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:06:31,774 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:06:31,775 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:06:31,778 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-09-20 15:06:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:31,817 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2018-09-20 15:06:31,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:06:31,821 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-09-20 15:06:31,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:31,832 INFO L225 Difference]: With dead ends: 93 [2018-09-20 15:06:31,833 INFO L226 Difference]: Without dead ends: 49 [2018-09-20 15:06:31,837 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:06:31,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-20 15:06:31,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-20 15:06:31,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:06:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-09-20 15:06:31,891 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 27 [2018-09-20 15:06:31,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:31,892 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-09-20 15:06:31,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:06:31,892 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-09-20 15:06:31,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-20 15:06:31,896 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:31,896 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:31,896 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:31,897 INFO L82 PathProgramCache]: Analyzing trace with hash -952121448, now seen corresponding path program 1 times [2018-09-20 15:06:31,897 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:06:31,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:06:31,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:06:31,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:31,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:06:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:06:32,088 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:32,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:32,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:32,091 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:32,091 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:32,092 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 4 states. [2018-09-20 15:06:32,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:32,156 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-09-20 15:06:32,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:32,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-09-20 15:06:32,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:32,161 INFO L225 Difference]: With dead ends: 59 [2018-09-20 15:06:32,161 INFO L226 Difference]: Without dead ends: 53 [2018-09-20 15:06:32,162 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:32,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-20 15:06:32,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-20 15:06:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-20 15:06:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-09-20 15:06:32,175 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 40 [2018-09-20 15:06:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:32,176 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-09-20 15:06:32,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-09-20 15:06:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-20 15:06:32,178 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:32,178 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:32,178 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:32,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1784721648, now seen corresponding path program 1 times [2018-09-20 15:06:32,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:06:32,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:06:32,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:06:32,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:32,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:06:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:06:32,306 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:32,306 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:32,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:32,307 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:32,308 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:32,308 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 4 states. [2018-09-20 15:06:32,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:32,406 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-09-20 15:06:32,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:32,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-09-20 15:06:32,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:32,410 INFO L225 Difference]: With dead ends: 63 [2018-09-20 15:06:32,410 INFO L226 Difference]: Without dead ends: 57 [2018-09-20 15:06:32,411 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:32,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-20 15:06:32,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-09-20 15:06:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-20 15:06:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-09-20 15:06:32,422 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 43 [2018-09-20 15:06:32,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:32,424 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-09-20 15:06:32,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:32,424 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-09-20 15:06:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-20 15:06:32,426 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:32,426 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:32,427 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:32,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1981235153, now seen corresponding path program 1 times [2018-09-20 15:06:32,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:06:32,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:06:32,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:06:32,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:32,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:06:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:06:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:06:32,512 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 15:06:32,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:06:32 BoogieIcfgContainer [2018-09-20 15:06:32,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:06:32,549 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:06:32,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:06:32,549 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:06:32,550 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:06:31" (3/4) ... [2018-09-20 15:06:32,554 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 15:06:32,554 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:06:32,555 INFO L168 Benchmark]: Toolchain (without parser) took 2371.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 953.2 MB in the beginning and 1.0 GB in the end (delta: -59.1 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:32,557 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:06:32,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.38 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:32,559 INFO L168 Benchmark]: Boogie Preprocessor took 54.97 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:32,560 INFO L168 Benchmark]: RCFGBuilder took 772.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -125.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:32,561 INFO L168 Benchmark]: TraceAbstraction took 1167.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:32,562 INFO L168 Benchmark]: Witness Printer took 5.57 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:06:32,566 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 364.38 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.97 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 772.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -125.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1167.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.57 ms. Allocated memory is still 1.1 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: 78]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryArithmeticDOUBLEoperation at line 64. Possible FailurePath: [L64] double x = 0.0 / 0.0; [L65] double y = __VERIFIER_nondet_double(); [L72] CALL, EXPR isnan_double(y) VAL [\old(x)=4294967300] [L16] RET return x != x; VAL [\old(x)=4294967300, \result=0, x=4294967300] [L72] EXPR isnan_double(y) VAL [isnan_double(y)=0, y=4294967300] [L72] COND TRUE !isnan_double(y) [L74] CALL, EXPR fmax_double(x, y) VAL [\old(x)=4294967302, \old(y)=4294967300] [L55] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967302] [L27] __uint32_t msw, lsw; VAL [\old(x)=4294967302, x=4294967302] [L30] FCALL ieee_double_shape_type ew_u; VAL [\old(x)=4294967302, ew_u={4294967299:0}, x=4294967302] [L31] FCALL ew_u.value = (x) VAL [\old(x)=4294967302, ew_u={4294967299:0}, x=4294967302] [L32] EXPR, FCALL ew_u.parts.msw VAL [\old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.msw=4293918721, x=4294967302] [L32] (msw) = ew_u.parts.msw VAL [\old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.msw=4293918721, msw=4293918721, x=4294967302] [L32] FCALL (msw) = ew_u.parts.msw VAL [(msw) = ew_u.parts.msw=4294967301, \old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.msw=4293918721, msw=4293918721, x=4294967302] [L33] EXPR, FCALL ew_u.parts.lsw VAL [\old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.lsw=4294967297, msw=4293918721, x=4294967302] [L33] (lsw) = ew_u.parts.lsw VAL [\old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.lsw=4294967297, lsw=4294967297, msw=4293918721, x=4294967302] [L33] FCALL (lsw) = ew_u.parts.lsw VAL [(lsw) = ew_u.parts.lsw=4294967304, \old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.lsw=4294967297, lsw=4294967297, msw=4293918721, x=4294967302] [L34] COND FALSE !(0) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L36-L37] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L39-L40] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L42-L43] COND FALSE !((msw >= 0x00000000 && msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L46-L47] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L50] RET return 0; VAL [\old(x)=4294967302, \result=0, lsw=4294967297, msw=4293918721, x=4294967302] [L55] EXPR __fpclassify_double(x) VAL [\old(x)=4294967302, \old(y)=4294967300, __fpclassify_double(x)=0, x=4294967302, y=4294967300] [L55] COND TRUE __fpclassify_double(x) == 0 [L56] RET return y; VAL [\old(x)=4294967302, \old(y)=4294967300, \result=4294967300, x=4294967302, y=4294967300] [L74] EXPR fmax_double(x, y) VAL [fmax_double(x, y)=4294967300, x=4294967302, y=4294967300] [L74] double res = fmax_double(x, y); [L77] COND TRUE res != y VAL [res=4294967300, x=4294967302, y=4294967300] [L78] __VERIFIER_error() VAL [res=4294967300, x=4294967302, y=4294967300] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 54 locations, 1 error locations. UNSAFE Result, 1.0s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 175 SDtfs, 0 SDslu, 210 SDs, 0 SdLazy, 21 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 4609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-40ef509 [2018-09-20 15:06:34,918 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:06:34,920 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:06:34,937 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:06:34,937 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:06:34,939 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:06:34,940 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:06:34,942 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:06:34,944 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:06:34,945 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:06:34,946 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:06:34,946 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:06:34,947 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:06:34,948 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:06:34,949 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:06:34,950 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:06:34,951 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:06:34,953 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:06:34,955 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:06:34,957 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:06:34,958 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:06:34,959 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:06:34,962 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:06:34,962 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:06:34,962 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:06:34,963 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:06:34,964 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:06:34,965 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:06:34,966 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:06:34,967 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:06:34,967 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:06:34,968 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:06:34,968 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:06:34,968 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:06:34,970 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:06:34,970 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:06:34,971 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 15:06:34,992 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:06:34,992 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:06:34,993 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:06:34,993 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:06:34,994 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:06:34,994 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:06:34,994 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:06:34,995 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:06:34,995 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:06:34,995 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:06:34,995 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:06:34,995 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:06:34,996 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:06:34,996 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:06:34,996 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 15:06:34,996 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 15:06:34,996 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:06:34,996 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:06:34,997 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:06:34,997 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:06:34,997 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:06:34,997 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:06:34,997 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:06:34,997 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:06:34,998 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:06:34,998 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:06:34,998 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:06:34,998 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 15:06:34,998 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:06:34,998 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 15:06:34,999 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 15:06:34,999 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 -> 84abb26640f37e4e810dde89d6f06da8a4d3f9c6 [2018-09-20 15:06:35,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:06:35,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:06:35,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:06:35,092 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:06:35,093 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:06:35,094 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251a_true-unreach-call.c [2018-09-20 15:06:35,435 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63fec532/e6c210264d8748909cd2b9903a78d9d0/FLAG35e143dc0 [2018-09-20 15:06:35,648 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:06:35,650 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1251a_true-unreach-call.c [2018-09-20 15:06:35,659 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63fec532/e6c210264d8748909cd2b9903a78d9d0/FLAG35e143dc0 [2018-09-20 15:06:35,691 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63fec532/e6c210264d8748909cd2b9903a78d9d0 [2018-09-20 15:06:35,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:06:35,700 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:06:35,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:06:35,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:06:35,713 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:06:35,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:06:35" (1/1) ... [2018-09-20 15:06:35,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@312a656a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:35, skipping insertion in model container [2018-09-20 15:06:35,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:06:35" (1/1) ... [2018-09-20 15:06:35,731 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:06:35,995 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:06:36,019 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:06:36,040 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:06:36,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36 WrapperNode [2018-09-20 15:06:36,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:06:36,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:06:36,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:06:36,079 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:06:36,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (1/1) ... [2018-09-20 15:06:36,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (1/1) ... [2018-09-20 15:06:36,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (1/1) ... [2018-09-20 15:06:36,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (1/1) ... [2018-09-20 15:06:36,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (1/1) ... [2018-09-20 15:06:36,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (1/1) ... [2018-09-20 15:06:36,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (1/1) ... [2018-09-20 15:06:36,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:06:36,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:06:36,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:06:36,134 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:06:36,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:06:36,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:06:36,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:06:36,290 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-20 15:06:36,290 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-09-20 15:06:36,290 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-09-20 15:06:36,290 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:06:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:06:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 15:06:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-20 15:06:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-09-20 15:06:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:06:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-20 15:06:36,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 15:06:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:06:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-09-20 15:06:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:06:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:06:36,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:06:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-20 15:06:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 15:06:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 15:06:36,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-20 15:06:36,688 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:06:36,727 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:06:36,752 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:06:36,888 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:06:36,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:06:36 BoogieIcfgContainer [2018-09-20 15:06:36,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:06:36,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:06:36,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:06:36,895 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:06:36,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:06:35" (1/3) ... [2018-09-20 15:06:36,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101a9860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:06:36, skipping insertion in model container [2018-09-20 15:06:36,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:06:36" (2/3) ... [2018-09-20 15:06:36,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101a9860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:06:36, skipping insertion in model container [2018-09-20 15:06:36,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:06:36" (3/3) ... [2018-09-20 15:06:36,899 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251a_true-unreach-call.c [2018-09-20 15:06:36,910 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:06:36,920 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:06:36,972 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:06:36,973 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:06:36,973 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:06:36,973 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:06:36,973 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:06:36,974 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:06:36,974 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:06:36,974 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:06:36,974 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:06:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-09-20 15:06:37,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-20 15:06:37,006 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:37,008 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:37,011 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:37,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1700649700, now seen corresponding path program 1 times [2018-09-20 15:06:37,021 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:37,022 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:37,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:37,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:37,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:06:37,130 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:37,150 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:37,151 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:06:37,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:06:37,168 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:06:37,169 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:06:37,172 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-09-20 15:06:37,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:37,200 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2018-09-20 15:06:37,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:06:37,201 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-09-20 15:06:37,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:37,216 INFO L225 Difference]: With dead ends: 88 [2018-09-20 15:06:37,217 INFO L226 Difference]: Without dead ends: 46 [2018-09-20 15:06:37,221 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:06:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-20 15:06:37,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-20 15:06:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-20 15:06:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-09-20 15:06:37,269 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 25 [2018-09-20 15:06:37,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:37,269 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-09-20 15:06:37,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:06:37,269 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-09-20 15:06:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-20 15:06:37,272 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:37,272 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:37,272 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:37,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1378721572, now seen corresponding path program 1 times [2018-09-20 15:06:37,273 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:37,273 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:37,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:37,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:37,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:06:37,463 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:37,476 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:37,477 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:37,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:37,481 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:37,481 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:37,482 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-09-20 15:06:37,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:37,565 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-09-20 15:06:37,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:37,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-09-20 15:06:37,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:37,570 INFO L225 Difference]: With dead ends: 55 [2018-09-20 15:06:37,570 INFO L226 Difference]: Without dead ends: 49 [2018-09-20 15:06:37,571 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:37,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-20 15:06:37,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-20 15:06:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:06:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-20 15:06:37,582 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 38 [2018-09-20 15:06:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:37,583 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-20 15:06:37,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-20 15:06:37,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-20 15:06:37,585 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:37,585 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:37,586 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:37,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1304320947, now seen corresponding path program 1 times [2018-09-20 15:06:37,588 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:37,588 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 15:06:37,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:37,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:06:37,732 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:37,746 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:37,746 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:37,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:37,747 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:37,747 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:37,747 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-20 15:06:37,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:37,822 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-20 15:06:37,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:37,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-09-20 15:06:37,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:37,825 INFO L225 Difference]: With dead ends: 58 [2018-09-20 15:06:37,826 INFO L226 Difference]: Without dead ends: 52 [2018-09-20 15:06:37,826 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-20 15:06:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-20 15:06:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:06:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-20 15:06:37,836 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 39 [2018-09-20 15:06:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:37,837 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-20 15:06:37,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-20 15:06:37,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-20 15:06:37,839 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:37,839 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:37,839 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:37,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1932752128, now seen corresponding path program 1 times [2018-09-20 15:06:37,841 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:37,841 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:37,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:37,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:06:37,958 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:37,972 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:37,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:37,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:37,973 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:37,973 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:37,974 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-20 15:06:38,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:38,117 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-20 15:06:38,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:38,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-09-20 15:06:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:38,121 INFO L225 Difference]: With dead ends: 58 [2018-09-20 15:06:38,121 INFO L226 Difference]: Without dead ends: 52 [2018-09-20 15:06:38,122 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:38,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-20 15:06:38,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-20 15:06:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:06:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-20 15:06:38,130 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 40 [2018-09-20 15:06:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:38,131 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-20 15:06:38,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-20 15:06:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-20 15:06:38,133 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:38,133 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:38,133 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:38,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1420834481, now seen corresponding path program 1 times [2018-09-20 15:06:38,134 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:38,135 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:38,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:38,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:06:38,322 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:38,338 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:38,339 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:38,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:38,339 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:38,340 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:38,341 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-20 15:06:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:38,415 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-20 15:06:38,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:38,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-09-20 15:06:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:38,417 INFO L225 Difference]: With dead ends: 58 [2018-09-20 15:06:38,417 INFO L226 Difference]: Without dead ends: 52 [2018-09-20 15:06:38,418 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-20 15:06:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-20 15:06:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:06:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-20 15:06:38,426 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 41 [2018-09-20 15:06:38,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:38,427 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-20 15:06:38,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:38,427 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-20 15:06:38,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-20 15:06:38,429 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:38,429 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:38,429 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:38,430 INFO L82 PathProgramCache]: Analyzing trace with hash -386619982, now seen corresponding path program 1 times [2018-09-20 15:06:38,430 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:38,430 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:38,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:38,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:06:39,160 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:39,179 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:39,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 15:06:39,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 15:06:39,180 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 15:06:39,180 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-20 15:06:39,181 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 9 states. [2018-09-20 15:06:39,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:39,866 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-09-20 15:06:39,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-20 15:06:39,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-09-20 15:06:39,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:39,869 INFO L225 Difference]: With dead ends: 55 [2018-09-20 15:06:39,870 INFO L226 Difference]: Without dead ends: 49 [2018-09-20 15:06:39,870 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:06:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-20 15:06:39,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-09-20 15:06:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-20 15:06:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-09-20 15:06:39,877 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 41 [2018-09-20 15:06:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:39,878 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-09-20 15:06:39,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 15:06:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-09-20 15:06:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-20 15:06:39,880 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:39,880 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:39,882 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:39,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1132927488, now seen corresponding path program 1 times [2018-09-20 15:06:39,883 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:39,883 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:39,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:39,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:06:40,038 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:40,055 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:40,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:40,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:40,056 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:40,056 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:40,056 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-09-20 15:06:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:40,119 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-09-20 15:06:40,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:40,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-09-20 15:06:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:40,122 INFO L225 Difference]: With dead ends: 55 [2018-09-20 15:06:40,122 INFO L226 Difference]: Without dead ends: 49 [2018-09-20 15:06:40,123 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-20 15:06:40,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-20 15:06:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:06:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-09-20 15:06:40,128 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 58 [2018-09-20 15:06:40,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:40,129 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-09-20 15:06:40,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-09-20 15:06:40,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-20 15:06:40,130 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:40,131 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:40,131 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:40,131 INFO L82 PathProgramCache]: Analyzing trace with hash 310309699, now seen corresponding path program 1 times [2018-09-20 15:06:40,133 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:40,133 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:40,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:40,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:06:40,315 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:40,326 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:40,327 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:40,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:40,328 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:40,328 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:40,328 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 4 states. [2018-09-20 15:06:40,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:40,353 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-09-20 15:06:40,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:40,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-09-20 15:06:40,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:40,356 INFO L225 Difference]: With dead ends: 58 [2018-09-20 15:06:40,356 INFO L226 Difference]: Without dead ends: 52 [2018-09-20 15:06:40,357 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:40,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-20 15:06:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-20 15:06:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:06:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-09-20 15:06:40,364 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 59 [2018-09-20 15:06:40,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:40,365 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-09-20 15:06:40,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-09-20 15:06:40,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-20 15:06:40,368 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:40,368 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:40,368 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1101257373, now seen corresponding path program 1 times [2018-09-20 15:06:40,369 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:40,369 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:40,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:40,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:40,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:06:40,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:06:40,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:40,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:40,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:40,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:06:40,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:06:40,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:06:40,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:40,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:40,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:40,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:06:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:41,693 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:41,704 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:41,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-20 15:06:41,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-20 15:06:41,705 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-20 15:06:41,705 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-20 15:06:41,705 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 13 states. [2018-09-20 15:06:45,832 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-09-20 15:06:46,196 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-09-20 15:06:46,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:46,512 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-09-20 15:06:46,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-20 15:06:46,513 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-09-20 15:06:46,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:46,514 INFO L225 Difference]: With dead ends: 63 [2018-09-20 15:06:46,514 INFO L226 Difference]: Without dead ends: 56 [2018-09-20 15:06:46,516 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-09-20 15:06:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-20 15:06:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-09-20 15:06:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-20 15:06:46,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-09-20 15:06:46,523 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 60 [2018-09-20 15:06:46,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:46,523 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-09-20 15:06:46,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-20 15:06:46,524 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-09-20 15:06:46,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-20 15:06:46,526 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:46,526 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:46,526 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:46,527 INFO L82 PathProgramCache]: Analyzing trace with hash -673749989, now seen corresponding path program 1 times [2018-09-20 15:06:46,527 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:46,527 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:46,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:46,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:06:46,787 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:46,798 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:46,798 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-20 15:06:46,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-20 15:06:46,799 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-20 15:06:46,799 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-20 15:06:46,801 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2018-09-20 15:06:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:47,200 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-09-20 15:06:47,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-20 15:06:47,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-09-20 15:06:47,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:47,203 INFO L225 Difference]: With dead ends: 60 [2018-09-20 15:06:47,203 INFO L226 Difference]: Without dead ends: 51 [2018-09-20 15:06:47,203 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-20 15:06:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-20 15:06:47,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-20 15:06:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-20 15:06:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-09-20 15:06:47,210 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 60 [2018-09-20 15:06:47,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:47,210 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-09-20 15:06:47,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-20 15:06:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-09-20 15:06:47,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-20 15:06:47,211 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:47,212 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:47,212 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:47,212 INFO L82 PathProgramCache]: Analyzing trace with hash -833861020, now seen corresponding path program 1 times [2018-09-20 15:06:47,215 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:47,215 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:47,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:47,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:06:47,343 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:47,358 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:47,358 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:47,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:47,359 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:47,359 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:47,359 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 4 states. [2018-09-20 15:06:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:47,393 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-09-20 15:06:47,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:47,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-09-20 15:06:47,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:47,395 INFO L225 Difference]: With dead ends: 60 [2018-09-20 15:06:47,396 INFO L226 Difference]: Without dead ends: 54 [2018-09-20 15:06:47,396 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:47,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-20 15:06:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-09-20 15:06:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-20 15:06:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-09-20 15:06:47,410 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 60 [2018-09-20 15:06:47,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:47,411 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-09-20 15:06:47,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:47,411 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-09-20 15:06:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-20 15:06:47,411 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:47,412 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:47,412 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:47,412 INFO L82 PathProgramCache]: Analyzing trace with hash 777757472, now seen corresponding path program 1 times [2018-09-20 15:06:47,415 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:47,415 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:47,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:47,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:06:47,795 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:47,806 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:47,806 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:06:47,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:06:47,807 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:06:47,807 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:06:47,807 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 10 states. [2018-09-20 15:06:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:48,390 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-09-20 15:06:48,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-20 15:06:48,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-09-20 15:06:48,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:48,392 INFO L225 Difference]: With dead ends: 57 [2018-09-20 15:06:48,392 INFO L226 Difference]: Without dead ends: 48 [2018-09-20 15:06:48,393 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-09-20 15:06:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-20 15:06:48,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-09-20 15:06:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-20 15:06:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-09-20 15:06:48,400 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 61 [2018-09-20 15:06:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:48,400 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-09-20 15:06:48,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:06:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-09-20 15:06:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-20 15:06:48,401 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:48,403 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:48,403 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:48,404 INFO L82 PathProgramCache]: Analyzing trace with hash -583298201, now seen corresponding path program 1 times [2018-09-20 15:06:48,404 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:48,404 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:48,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:48,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:06:48,539 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:48,555 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:48,555 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:48,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:48,556 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:48,556 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:48,556 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2018-09-20 15:06:48,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:48,589 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-09-20 15:06:48,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:48,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-09-20 15:06:48,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:48,591 INFO L225 Difference]: With dead ends: 55 [2018-09-20 15:06:48,591 INFO L226 Difference]: Without dead ends: 48 [2018-09-20 15:06:48,591 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:48,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-20 15:06:48,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-09-20 15:06:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-20 15:06:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-09-20 15:06:48,596 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 61 [2018-09-20 15:06:48,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:48,598 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-09-20 15:06:48,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:48,598 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-09-20 15:06:48,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-20 15:06:48,599 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:48,599 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:48,599 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:48,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1904214632, now seen corresponding path program 1 times [2018-09-20 15:06:48,601 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:48,602 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:48,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:48,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:48,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:06:48,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:06:48,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:48,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:48,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:48,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:06:48,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:06:48,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:06:48,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:48,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:48,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:48,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:06:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:49,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:06:49,833 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-20 15:06:49,950 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 15:06:49,950 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 15:06:49,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:50,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:50,055 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:50,069 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:50,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-20 15:06:50,113 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:50,208 INFO L303 Elim1Store]: Index analysis took 136 ms [2018-09-20 15:06:50,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-20 15:06:50,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:50,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:50,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:50,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-20 15:06:50,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-09-20 15:06:50,468 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:50,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-09-20 15:06:50,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:50,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:50,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:50,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:14 [2018-09-20 15:06:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:50,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:06:50,775 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-20 15:06:50,907 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:06:51,104 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:06:51,586 WARN L178 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-20 15:06:51,751 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-20 15:06:51,859 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-09-20 15:06:51,983 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-09-20 15:06:51,999 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:52,002 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:52,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2018-09-20 15:06:52,013 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:52,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-20 15:06:52,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:52,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-20 15:06:52,071 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:52,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-20 15:06:52,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:52,087 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:52,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:52,196 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:52,199 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:52,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2018-09-20 15:06:52,221 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:52,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-20 15:06:52,236 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:52,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-20 15:06:52,283 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:52,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-20 15:06:52,287 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:52,291 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:52,298 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:52,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-20 15:06:52,330 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:81, output treesize:33 [2018-09-20 15:06:52,433 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:06:52,433 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-09-20 15:06:52,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 15:06:52,434 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 15:06:52,434 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-20 15:06:52,435 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 11 states. [2018-09-20 15:06:53,443 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-20 15:06:53,988 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-20 15:06:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:54,819 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-09-20 15:06:54,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:06:54,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-09-20 15:06:54,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:54,823 INFO L225 Difference]: With dead ends: 57 [2018-09-20 15:06:54,823 INFO L226 Difference]: Without dead ends: 46 [2018-09-20 15:06:54,823 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-09-20 15:06:54,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-20 15:06:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-20 15:06:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-20 15:06:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-09-20 15:06:54,828 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 61 [2018-09-20 15:06:54,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:54,829 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-09-20 15:06:54,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 15:06:54,829 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-09-20 15:06:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-20 15:06:54,830 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:54,830 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:06:54,830 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:54,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2059046953, now seen corresponding path program 1 times [2018-09-20 15:06:54,831 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:54,831 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) [2018-09-20 15:06:54,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:54,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:55,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:06:55,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:06:55,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:55,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:55,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:55,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:06:55,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:06:55,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:06:55,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:55,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:55,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:55,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:06:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:55,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:06:55,590 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 15:06:55,842 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-09-20 15:06:56,281 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 15:06:56,281 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 15:06:56,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:56,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:56,355 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:56,356 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:56,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-20 15:06:56,375 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:56,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-20 15:06:56,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:56,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:56,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:56,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-20 15:06:56,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-09-20 15:06:56,571 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:56,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-09-20 15:06:56,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:56,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:56,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:56,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:14 [2018-09-20 15:06:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:56,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:06:56,876 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-09-20 15:06:57,287 WARN L178 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-09-20 15:06:57,507 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 15:06:57,684 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:06:57,770 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:57,773 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:57,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2018-09-20 15:06:57,784 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:57,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-20 15:06:57,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:57,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-20 15:06:57,880 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:57,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-20 15:06:57,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:57,919 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:57,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:58,051 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:58,055 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:58,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 63 [2018-09-20 15:06:58,063 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:58,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-20 15:06:58,079 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:58,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-20 15:06:58,131 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:58,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-20 15:06:58,136 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:58,140 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:58,155 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:58,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-20 15:06:58,201 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:101, output treesize:43 [2018-09-20 15:06:58,292 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:06:58,292 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-09-20 15:06:58,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-20 15:06:58,293 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-20 15:06:58,293 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-20 15:06:58,293 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 11 states. [2018-09-20 15:07:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:07:00,768 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-09-20 15:07:00,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:07:00,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-09-20 15:07:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:07:00,771 INFO L225 Difference]: With dead ends: 57 [2018-09-20 15:07:00,771 INFO L226 Difference]: Without dead ends: 46 [2018-09-20 15:07:00,772 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-09-20 15:07:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-20 15:07:00,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-20 15:07:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-20 15:07:00,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-09-20 15:07:00,777 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 62 [2018-09-20 15:07:00,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:07:00,777 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-09-20 15:07:00,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-20 15:07:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-09-20 15:07:00,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-20 15:07:00,778 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:07:00,780 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:07:00,780 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:07:00,780 INFO L82 PathProgramCache]: Analyzing trace with hash 183414724, now seen corresponding path program 1 times [2018-09-20 15:07:00,781 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:07:00,781 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-09-20 15:07:00,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:07:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:07:00,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:07:00,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:07:00,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:07:00,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:07:00,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:07:00,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:07:00,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:07:00,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:07:00,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:07:00,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:07:00,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:07:01,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:07:01,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:07:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:07:01,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:07:01,442 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-09-20 15:07:01,729 WARN L178 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-09-20 15:07:02,186 WARN L178 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-20 15:07:02,437 WARN L178 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-20 15:07:02,546 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 15:07:02,546 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 15:07:02,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:07:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:07:02,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:07:02,621 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:07:02,622 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:07:02,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-20 15:07:02,630 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:02,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-20 15:07:02,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:07:02,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:07:02,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:07:02,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-20 15:07:02,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-09-20 15:07:02,827 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:02,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-09-20 15:07:02,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:07:02,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:07:02,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:07:02,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:14 [2018-09-20 15:07:03,299 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-09-20 15:07:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:07:03,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:07:04,271 WARN L178 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2018-09-20 15:07:04,522 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-09-20 15:07:04,662 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:07:04,802 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-20 15:07:05,079 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-20 15:07:05,276 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-20 15:07:05,288 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:05,292 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:05,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 63 [2018-09-20 15:07:05,299 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:07:05,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-20 15:07:05,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:07:05,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-20 15:07:05,362 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:07:05,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-20 15:07:05,368 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-20 15:07:05,372 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:07:05,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:07:05,469 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:05,473 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:05,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2018-09-20 15:07:05,498 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:07:05,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-20 15:07:05,518 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-20 15:07:05,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-20 15:07:05,569 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:07:05,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-20 15:07:05,576 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-20 15:07:05,579 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:07:05,589 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:07:05,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-20 15:07:05,623 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:91, output treesize:38 [2018-09-20 15:07:05,729 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:07:05,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 14 [2018-09-20 15:07:05,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-20 15:07:05,729 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-20 15:07:05,730 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-09-20 15:07:05,730 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 14 states. [2018-09-20 15:07:07,178 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-20 15:07:07,579 WARN L178 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-09-20 15:07:08,401 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2018-09-20 15:07:08,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:07:08,484 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-09-20 15:07:08,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-20 15:07:08,486 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-09-20 15:07:08,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:07:08,487 INFO L225 Difference]: With dead ends: 57 [2018-09-20 15:07:08,487 INFO L226 Difference]: Without dead ends: 46 [2018-09-20 15:07:08,488 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-09-20 15:07:08,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-20 15:07:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-20 15:07:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-20 15:07:08,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-09-20 15:07:08,494 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 63 [2018-09-20 15:07:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:07:08,494 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-09-20 15:07:08,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-20 15:07:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-09-20 15:07:08,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-20 15:07:08,495 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:07:08,495 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:07:08,495 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:07:08,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1529769203, now seen corresponding path program 1 times [2018-09-20 15:07:08,496 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:07:08,496 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2018-09-20 15:07:08,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:07:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:07:08,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:07:08,668 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:07:08,670 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:07:08,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-20 15:07:08,679 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:08,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-20 15:07:08,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:07:08,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:07:08,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:07:08,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-20 15:07:08,910 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:07:08,911 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:07:08,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-09-20 15:07:08,926 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:08,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-20 15:07:08,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:07:08,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:07:09,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 15:07:09,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-20 15:07:09,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-09-20 15:07:09,074 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:09,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-20 15:07:09,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:07:09,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:07:09,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:07:09,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-20 15:07:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:07:09,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:07:10,446 WARN L178 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-09-20 15:07:10,622 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-20 15:07:11,012 WARN L178 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-20 15:07:11,510 WARN L178 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-20 15:07:11,699 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-20 15:07:11,941 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-09-20 15:07:12,064 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-09-20 15:07:12,082 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:12,083 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:12,085 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:12,087 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:12,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 132 [2018-09-20 15:07:12,297 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2018-09-20 15:07:12,305 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:07:12,305 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:07:12,306 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:07:12,308 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:12,309 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:07:12,511 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2018-09-20 15:07:12,512 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_30 term size 40 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:430) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) 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) [2018-09-20 15:07:12,515 INFO L168 Benchmark]: Toolchain (without parser) took 36819.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.1 MB). Free memory was 950.5 MB in the beginning and 1.3 GB in the end (delta: -336.5 MB). Peak memory consumption was 436.8 MB. Max. memory is 11.5 GB. [2018-09-20 15:07:12,516 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:07:12,516 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.90 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 939.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:07:12,517 INFO L168 Benchmark]: Boogie Preprocessor took 54.34 ms. Allocated memory is still 1.0 GB. Free memory was 939.8 MB in the beginning and 934.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:07:12,517 INFO L168 Benchmark]: RCFGBuilder took 755.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -147.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2018-09-20 15:07:12,518 INFO L168 Benchmark]: TraceAbstraction took 35623.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -205.6 MB). Peak memory consumption was 454.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:07:12,524 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 376.90 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 939.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.34 ms. Allocated memory is still 1.0 GB. Free memory was 939.8 MB in the beginning and 934.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 755.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -147.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35623.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -205.6 MB). Peak memory consumption was 454.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_30 term size 40 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_30 term size 40: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...