./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i -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 b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:08:38,375 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:08:38,377 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:08:38,396 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:08:38,397 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:08:38,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:08:38,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:08:38,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:08:38,407 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:08:38,408 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:08:38,409 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:08:38,409 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:08:38,410 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:08:38,411 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:08:38,412 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:08:38,413 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:08:38,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:08:38,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:08:38,418 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:08:38,420 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:08:38,421 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:08:38,422 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:08:38,425 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:08:38,425 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:08:38,425 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:08:38,426 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:08:38,427 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:08:38,428 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:08:38,429 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:08:38,430 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:08:38,431 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:08:38,431 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:08:38,432 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:08:38,432 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:08:38,433 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:08:38,434 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:08:38,434 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:08:38,449 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:08:38,450 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:08:38,451 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:08:38,451 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:08:38,451 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:08:38,452 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:08:38,452 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:08:38,452 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:08:38,452 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:08:38,452 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:08:38,453 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:08:38,453 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:08:38,453 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:08:38,453 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:08:38,453 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:08:38,453 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:08:38,454 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:08:38,454 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:08:38,454 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:08:38,454 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:08:38,454 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:08:38,455 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:08:38,455 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:08:38,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:08:38,455 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:08:38,455 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:08:38,456 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:08:38,456 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:08:38,456 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:08:38,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:08:38,456 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 -> b7feccaf382e9f358fe7bd48bccc9b98dfa2aebd [2018-11-28 18:08:38,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:08:38,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:08:38,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:08:38,539 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:08:38,539 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:08:38,540 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i [2018-11-28 18:08:38,605 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c86a4a691/1fb1d662e55b4479aba3531bb85f92c0/FLAG495d73b9b [2018-11-28 18:08:39,091 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:08:39,095 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/dll-01_false-unreach-call_false-valid-memcleanup.i [2018-11-28 18:08:39,108 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c86a4a691/1fb1d662e55b4479aba3531bb85f92c0/FLAG495d73b9b [2018-11-28 18:08:39,382 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c86a4a691/1fb1d662e55b4479aba3531bb85f92c0 [2018-11-28 18:08:39,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:08:39,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:08:39,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:08:39,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:08:39,392 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:08:39,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:08:39" (1/1) ... [2018-11-28 18:08:39,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1294a511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:39, skipping insertion in model container [2018-11-28 18:08:39,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:08:39" (1/1) ... [2018-11-28 18:08:39,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:08:39,458 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:08:39,895 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:08:39,915 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:08:39,995 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:08:40,148 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:08:40,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:40 WrapperNode [2018-11-28 18:08:40,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:08:40,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:08:40,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:08:40,151 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:08:40,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:40" (1/1) ... [2018-11-28 18:08:40,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:40" (1/1) ... [2018-11-28 18:08:40,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:08:40,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:08:40,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:08:40,192 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:08:40,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:40" (1/1) ... [2018-11-28 18:08:40,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:40" (1/1) ... [2018-11-28 18:08:40,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:40" (1/1) ... [2018-11-28 18:08:40,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:40" (1/1) ... [2018-11-28 18:08:40,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:40" (1/1) ... [2018-11-28 18:08:40,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:40" (1/1) ... [2018-11-28 18:08:40,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:40" (1/1) ... [2018-11-28 18:08:40,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:08:40,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:08:40,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:08:40,253 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:08:40,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:40" (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-11-28 18:08:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 18:08:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:08:40,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:08:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:08:40,345 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:08:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 18:08:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 18:08:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 18:08:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:08:40,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:08:41,446 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:08:41,446 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2018-11-28 18:08:41,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:08:41 BoogieIcfgContainer [2018-11-28 18:08:41,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:08:41,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:08:41,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:08:41,452 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:08:41,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:08:39" (1/3) ... [2018-11-28 18:08:41,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed6eadd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:08:41, skipping insertion in model container [2018-11-28 18:08:41,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:40" (2/3) ... [2018-11-28 18:08:41,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed6eadd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:08:41, skipping insertion in model container [2018-11-28 18:08:41,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:08:41" (3/3) ... [2018-11-28 18:08:41,457 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01_false-unreach-call_false-valid-memcleanup.i [2018-11-28 18:08:41,467 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:08:41,475 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-11-28 18:08:41,493 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-11-28 18:08:41,526 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:08:41,526 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:08:41,527 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:08:41,527 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:08:41,527 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:08:41,527 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:08:41,527 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:08:41,527 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:08:41,528 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:08:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2018-11-28 18:08:41,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 18:08:41,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:41,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:41,559 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:41,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:41,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1861451205, now seen corresponding path program 1 times [2018-11-28 18:08:41,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:41,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:41,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:41,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:41,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:41,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:41,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:08:41,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:08:41,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:08:41,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:41,769 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2018-11-28 18:08:41,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:41,965 INFO L93 Difference]: Finished difference Result 186 states and 302 transitions. [2018-11-28 18:08:41,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:08:41,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-28 18:08:41,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:41,980 INFO L225 Difference]: With dead ends: 186 [2018-11-28 18:08:41,981 INFO L226 Difference]: Without dead ends: 99 [2018-11-28 18:08:41,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:42,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-28 18:08:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2018-11-28 18:08:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-28 18:08:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-11-28 18:08:42,038 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 8 [2018-11-28 18:08:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:42,039 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-11-28 18:08:42,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:08:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-11-28 18:08:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:08:42,040 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:42,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:42,041 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:42,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:42,043 INFO L82 PathProgramCache]: Analyzing trace with hash -276606363, now seen corresponding path program 1 times [2018-11-28 18:08:42,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:42,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:42,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:42,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:42,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:42,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:42,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:08:42,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:08:42,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:08:42,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:42,146 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 3 states. [2018-11-28 18:08:42,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:42,224 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-11-28 18:08:42,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:08:42,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-28 18:08:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:42,228 INFO L225 Difference]: With dead ends: 84 [2018-11-28 18:08:42,228 INFO L226 Difference]: Without dead ends: 82 [2018-11-28 18:08:42,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:42,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-28 18:08:42,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-28 18:08:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 18:08:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-11-28 18:08:42,242 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 14 [2018-11-28 18:08:42,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:42,243 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-11-28 18:08:42,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:08:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-11-28 18:08:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:08:42,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:42,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:42,246 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:42,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:42,247 INFO L82 PathProgramCache]: Analyzing trace with hash -276604441, now seen corresponding path program 1 times [2018-11-28 18:08:42,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:42,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:42,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:42,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:42,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:42,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:42,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:08:42,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:08:42,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:08:42,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:08:42,484 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 4 states. [2018-11-28 18:08:42,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:42,729 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-11-28 18:08:42,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:08:42,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-28 18:08:42,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:42,736 INFO L225 Difference]: With dead ends: 83 [2018-11-28 18:08:42,736 INFO L226 Difference]: Without dead ends: 81 [2018-11-28 18:08:42,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:08:42,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-28 18:08:42,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-28 18:08:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-28 18:08:42,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2018-11-28 18:08:42,758 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 14 [2018-11-28 18:08:42,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:42,758 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2018-11-28 18:08:42,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:08:42,761 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-11-28 18:08:42,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 18:08:42,762 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:42,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:42,762 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:42,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:42,763 INFO L82 PathProgramCache]: Analyzing trace with hash -960000523, now seen corresponding path program 1 times [2018-11-28 18:08:42,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:42,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:42,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:42,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:42,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:43,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:43,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:08:43,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:08:43,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:08:43,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:08:43,084 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 4 states. [2018-11-28 18:08:43,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:43,311 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2018-11-28 18:08:43,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:08:43,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-28 18:08:43,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:43,314 INFO L225 Difference]: With dead ends: 199 [2018-11-28 18:08:43,314 INFO L226 Difference]: Without dead ends: 132 [2018-11-28 18:08:43,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:08:43,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-28 18:08:43,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 81. [2018-11-28 18:08:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-28 18:08:43,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-11-28 18:08:43,326 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 19 [2018-11-28 18:08:43,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:43,326 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-11-28 18:08:43,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:08:43,327 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-11-28 18:08:43,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 18:08:43,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:43,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:43,328 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:43,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:43,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1769347149, now seen corresponding path program 1 times [2018-11-28 18:08:43,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:43,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:43,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:43,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:43,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:43,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:43,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:08:43,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:08:43,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:08:43,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:08:43,447 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 5 states. [2018-11-28 18:08:43,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:43,711 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2018-11-28 18:08:43,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:08:43,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-28 18:08:43,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:43,715 INFO L225 Difference]: With dead ends: 126 [2018-11-28 18:08:43,715 INFO L226 Difference]: Without dead ends: 122 [2018-11-28 18:08:43,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:08:43,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-28 18:08:43,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2018-11-28 18:08:43,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 18:08:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-11-28 18:08:43,726 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 19 [2018-11-28 18:08:43,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:43,726 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-11-28 18:08:43,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:08:43,726 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-11-28 18:08:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 18:08:43,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:43,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:43,728 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:43,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:43,728 INFO L82 PathProgramCache]: Analyzing trace with hash 984817432, now seen corresponding path program 1 times [2018-11-28 18:08:43,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:43,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:43,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:43,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:43,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:43,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:43,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:08:43,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:08:43,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:08:43,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:08:43,815 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 4 states. [2018-11-28 18:08:44,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:44,037 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-11-28 18:08:44,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:08:44,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-28 18:08:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:44,040 INFO L225 Difference]: With dead ends: 136 [2018-11-28 18:08:44,040 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 18:08:44,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:08:44,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 18:08:44,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 76. [2018-11-28 18:08:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 18:08:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-11-28 18:08:44,070 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 20 [2018-11-28 18:08:44,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:44,071 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-11-28 18:08:44,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:08:44,071 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-11-28 18:08:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 18:08:44,072 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:44,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:44,074 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:44,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:44,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1725931075, now seen corresponding path program 1 times [2018-11-28 18:08:44,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:44,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:44,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:44,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:44,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:44,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:44,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:08:44,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:08:44,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:08:44,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:44,176 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 3 states. [2018-11-28 18:08:44,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:44,272 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2018-11-28 18:08:44,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:08:44,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 18:08:44,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:44,274 INFO L225 Difference]: With dead ends: 141 [2018-11-28 18:08:44,274 INFO L226 Difference]: Without dead ends: 100 [2018-11-28 18:08:44,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:44,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-28 18:08:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2018-11-28 18:08:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-28 18:08:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2018-11-28 18:08:44,289 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 24 [2018-11-28 18:08:44,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:44,289 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2018-11-28 18:08:44,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:08:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2018-11-28 18:08:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 18:08:44,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:44,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:44,292 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:44,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:44,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1964251274, now seen corresponding path program 1 times [2018-11-28 18:08:44,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:44,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:44,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:44,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:44,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:44,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:44,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:08:44,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:08:44,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:08:44,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:44,360 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 3 states. [2018-11-28 18:08:44,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:44,383 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2018-11-28 18:08:44,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:08:44,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 18:08:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:44,388 INFO L225 Difference]: With dead ends: 79 [2018-11-28 18:08:44,388 INFO L226 Difference]: Without dead ends: 77 [2018-11-28 18:08:44,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:44,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-28 18:08:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-28 18:08:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 18:08:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-11-28 18:08:44,401 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 25 [2018-11-28 18:08:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:44,402 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-11-28 18:08:44,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:08:44,402 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-11-28 18:08:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:08:44,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:44,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:44,406 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:44,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:44,407 INFO L82 PathProgramCache]: Analyzing trace with hash 639264193, now seen corresponding path program 1 times [2018-11-28 18:08:44,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:44,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:44,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:44,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:44,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:44,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:44,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:08:44,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:08:44,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:08:44,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:44,509 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 3 states. [2018-11-28 18:08:44,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:44,543 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-11-28 18:08:44,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:08:44,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 18:08:44,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:44,546 INFO L225 Difference]: With dead ends: 80 [2018-11-28 18:08:44,546 INFO L226 Difference]: Without dead ends: 78 [2018-11-28 18:08:44,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:44,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-28 18:08:44,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-28 18:08:44,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 18:08:44,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-11-28 18:08:44,554 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 27 [2018-11-28 18:08:44,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:44,554 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-11-28 18:08:44,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:08:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-11-28 18:08:44,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:08:44,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:44,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:44,556 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:44,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:44,556 INFO L82 PathProgramCache]: Analyzing trace with hash 639266115, now seen corresponding path program 1 times [2018-11-28 18:08:44,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:44,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:44,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:44,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:44,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:44,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:44,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:08:44,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:08:44,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:08:44,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:08:44,684 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 4 states. [2018-11-28 18:08:44,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:44,948 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2018-11-28 18:08:44,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:08:44,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-28 18:08:44,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:44,950 INFO L225 Difference]: With dead ends: 79 [2018-11-28 18:08:44,950 INFO L226 Difference]: Without dead ends: 77 [2018-11-28 18:08:44,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:08:44,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-28 18:08:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-28 18:08:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-28 18:08:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-11-28 18:08:44,959 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 27 [2018-11-28 18:08:44,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:44,959 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-11-28 18:08:44,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:08:44,959 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-11-28 18:08:44,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 18:08:44,961 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:44,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:44,961 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:44,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:44,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1915606920, now seen corresponding path program 1 times [2018-11-28 18:08:44,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:44,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:44,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:44,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:44,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:45,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:45,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:08:45,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:08:45,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:08:45,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:08:45,119 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 6 states. [2018-11-28 18:08:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:45,752 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2018-11-28 18:08:45,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 18:08:45,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-28 18:08:45,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:45,755 INFO L225 Difference]: With dead ends: 179 [2018-11-28 18:08:45,756 INFO L226 Difference]: Without dead ends: 137 [2018-11-28 18:08:45,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:08:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-28 18:08:45,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2018-11-28 18:08:45,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 18:08:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2018-11-28 18:08:45,766 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 28 [2018-11-28 18:08:45,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:45,766 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2018-11-28 18:08:45,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:08:45,767 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2018-11-28 18:08:45,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 18:08:45,768 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:45,768 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:45,769 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:45,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:45,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2016202760, now seen corresponding path program 1 times [2018-11-28 18:08:45,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:45,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:45,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:45,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:45,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:46,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:46,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 18:08:46,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:08:46,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:08:46,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:08:46,228 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 8 states. [2018-11-28 18:08:46,632 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-28 18:08:47,258 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 18:08:47,609 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 18:08:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:47,630 INFO L93 Difference]: Finished difference Result 188 states and 212 transitions. [2018-11-28 18:08:47,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 18:08:47,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-28 18:08:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:47,634 INFO L225 Difference]: With dead ends: 188 [2018-11-28 18:08:47,635 INFO L226 Difference]: Without dead ends: 186 [2018-11-28 18:08:47,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:08:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-28 18:08:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 116. [2018-11-28 18:08:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-28 18:08:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2018-11-28 18:08:47,648 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 28 [2018-11-28 18:08:47,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:47,649 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2018-11-28 18:08:47,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:08:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2018-11-28 18:08:47,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 18:08:47,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:47,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:47,651 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:47,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:47,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1003425070, now seen corresponding path program 1 times [2018-11-28 18:08:47,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:47,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:47,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:47,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:47,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:47,838 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-28 18:08:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:08:47,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:47,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:08:47,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:08:47,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:08:47,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:08:47,972 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand 5 states. [2018-11-28 18:08:48,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:48,186 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-11-28 18:08:48,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:08:48,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-28 18:08:48,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:48,188 INFO L225 Difference]: With dead ends: 162 [2018-11-28 18:08:48,189 INFO L226 Difference]: Without dead ends: 144 [2018-11-28 18:08:48,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:08:48,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-28 18:08:48,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2018-11-28 18:08:48,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-28 18:08:48,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2018-11-28 18:08:48,200 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 30 [2018-11-28 18:08:48,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:48,200 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2018-11-28 18:08:48,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:08:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2018-11-28 18:08:48,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 18:08:48,202 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:48,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:48,202 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:48,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:48,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1179896658, now seen corresponding path program 1 times [2018-11-28 18:08:48,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:48,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:48,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:48,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:48,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:48,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 18:08:48,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:48,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:08:48,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:08:48,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:08:48,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:48,321 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand 3 states. [2018-11-28 18:08:48,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:48,426 INFO L93 Difference]: Finished difference Result 137 states and 163 transitions. [2018-11-28 18:08:48,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:08:48,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 18:08:48,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:48,430 INFO L225 Difference]: With dead ends: 137 [2018-11-28 18:08:48,430 INFO L226 Difference]: Without dead ends: 135 [2018-11-28 18:08:48,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:08:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-28 18:08:48,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-11-28 18:08:48,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-28 18:08:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 160 transitions. [2018-11-28 18:08:48,444 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 160 transitions. Word has length 30 [2018-11-28 18:08:48,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:48,444 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 160 transitions. [2018-11-28 18:08:48,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:08:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 160 transitions. [2018-11-28 18:08:48,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 18:08:48,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:48,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:48,446 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:48,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:48,446 INFO L82 PathProgramCache]: Analyzing trace with hash 425326620, now seen corresponding path program 1 times [2018-11-28 18:08:48,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:48,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:48,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:48,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:48,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:08:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:08:48,499 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:08:48,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:08:48 BoogieIcfgContainer [2018-11-28 18:08:48,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:08:48,549 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:08:48,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:08:48,549 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:08:48,550 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:08:41" (3/4) ... [2018-11-28 18:08:48,552 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:08:48,612 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:08:48,612 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:08:48,613 INFO L168 Benchmark]: Toolchain (without parser) took 9227.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:48,614 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:08:48,615 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:48,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:48,616 INFO L168 Benchmark]: Boogie Preprocessor took 60.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:08:48,617 INFO L168 Benchmark]: RCFGBuilder took 1193.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:48,617 INFO L168 Benchmark]: TraceAbstraction took 7100.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -37.2 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:48,618 INFO L168 Benchmark]: Witness Printer took 63.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:08:48,622 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 761.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1193.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7100.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -37.2 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Witness Printer took 63.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L992] SLL* list = malloc(sizeof(SLL)); [L993] list->next = ((void*)0) [L994] list->prev = ((void*)0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(!(list != ((void*)0))) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L995] list->inner = malloc(sizeof(SLL)) [L995] EXPR list->inner [L995] list->inner->next = ((void*)0) [L995] EXPR list->inner [L995] list->inner->inner = ((void*)0) [L995] EXPR list->inner [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={14:0}, list->inner={16:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L997] SLL* end = list; VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1015] COND FALSE !(!(((void*)0) != end)) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; [L1020] EXPR end->inner [L1020] SLL* inner = end->inner; [L1021] COND TRUE ((void*)0) != inner VAL [end={14:0}, inner={16:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1023] COND TRUE len == 0 [L1024] len = 1 VAL [end={14:0}, inner={16:0}, len=1, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1027] COND FALSE !(!(((void*)0) != inner)) VAL [end={14:0}, inner={16:0}, len=1, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1028] EXPR inner->inner VAL [end={14:0}, inner={16:0}, inner->inner={0:0}, len=1, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1028] COND FALSE !(!(((void*)0) == inner->inner)) [L1029] EXPR inner->next VAL [end={14:0}, inner={16:0}, inner->next={0:0}, len=1, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1029] COND TRUE !(((void*)0) != inner->next) [L1029] __VERIFIER_error() VAL [end={14:0}, inner={16:0}, len=1, list={14:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 88 locations, 13 error locations. UNSAFE Result, 7.0s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1045 SDtfs, 1024 SDslu, 1290 SDs, 0 SdLazy, 577 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 310 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 46474 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...