./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5daa60820c0033439eb2fc136c4a16d466a909bc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 06:12:14,338 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 06:12:14,340 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 06:12:14,352 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 06:12:14,352 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 06:12:14,353 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 06:12:14,355 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 06:12:14,357 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 06:12:14,359 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 06:12:14,360 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 06:12:14,361 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 06:12:14,361 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 06:12:14,362 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 06:12:14,364 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 06:12:14,365 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 06:12:14,366 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 06:12:14,367 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 06:12:14,369 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 06:12:14,371 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 06:12:14,373 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 06:12:14,374 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 06:12:14,376 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 06:12:14,379 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 06:12:14,379 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 06:12:14,379 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 06:12:14,380 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 06:12:14,382 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 06:12:14,383 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 06:12:14,384 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 06:12:14,385 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 06:12:14,385 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 06:12:14,387 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 06:12:14,387 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 06:12:14,387 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 06:12:14,388 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 06:12:14,390 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 06:12:14,390 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 06:12:14,406 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 06:12:14,406 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 06:12:14,407 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 06:12:14,407 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 06:12:14,408 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 06:12:14,408 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 06:12:14,408 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 06:12:14,409 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 06:12:14,409 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 06:12:14,409 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 06:12:14,409 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 06:12:14,409 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 06:12:14,410 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 06:12:14,410 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 06:12:14,410 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 06:12:14,410 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 06:12:14,410 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 06:12:14,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 06:12:14,412 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 06:12:14,412 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 06:12:14,412 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 06:12:14,413 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 06:12:14,413 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 06:12:14,413 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 06:12:14,413 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 06:12:14,414 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 06:12:14,414 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 06:12:14,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 06:12:14,414 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 -> 5daa60820c0033439eb2fc136c4a16d466a909bc [2018-12-31 06:12:14,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 06:12:14,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 06:12:14,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 06:12:14,471 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 06:12:14,472 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 06:12:14,472 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-12-31 06:12:14,541 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4f1f96b/4a7b00188e6241979f86a19c14e75211/FLAG676fb16a2 [2018-12-31 06:12:15,022 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 06:12:15,027 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-12-31 06:12:15,046 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4f1f96b/4a7b00188e6241979f86a19c14e75211/FLAG676fb16a2 [2018-12-31 06:12:15,367 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4f1f96b/4a7b00188e6241979f86a19c14e75211 [2018-12-31 06:12:15,371 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 06:12:15,373 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 06:12:15,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 06:12:15,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 06:12:15,380 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 06:12:15,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:12:15" (1/1) ... [2018-12-31 06:12:15,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75b457bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:15, skipping insertion in model container [2018-12-31 06:12:15,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:12:15" (1/1) ... [2018-12-31 06:12:15,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 06:12:15,431 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 06:12:15,689 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 06:12:15,701 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 06:12:15,762 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 06:12:15,788 INFO L195 MainTranslator]: Completed translation [2018-12-31 06:12:15,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:15 WrapperNode [2018-12-31 06:12:15,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 06:12:15,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 06:12:15,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 06:12:15,792 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 06:12:15,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:15" (1/1) ... [2018-12-31 06:12:15,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:15" (1/1) ... [2018-12-31 06:12:15,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 06:12:15,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 06:12:15,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 06:12:15,845 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 06:12:15,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:15" (1/1) ... [2018-12-31 06:12:15,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:15" (1/1) ... [2018-12-31 06:12:15,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:15" (1/1) ... [2018-12-31 06:12:15,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:15" (1/1) ... [2018-12-31 06:12:15,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:15" (1/1) ... [2018-12-31 06:12:15,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:15" (1/1) ... [2018-12-31 06:12:15,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:15" (1/1) ... [2018-12-31 06:12:15,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 06:12:15,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 06:12:15,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 06:12:15,935 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 06:12:15,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 06:12:16,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 06:12:16,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 06:12:16,559 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 06:12:16,559 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 06:12:16,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:12:16 BoogieIcfgContainer [2018-12-31 06:12:16,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 06:12:16,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 06:12:16,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 06:12:16,564 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 06:12:16,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 06:12:15" (1/3) ... [2018-12-31 06:12:16,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5299fa18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:12:16, skipping insertion in model container [2018-12-31 06:12:16,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:12:15" (2/3) ... [2018-12-31 06:12:16,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5299fa18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:12:16, skipping insertion in model container [2018-12-31 06:12:16,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:12:16" (3/3) ... [2018-12-31 06:12:16,568 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop_true-unreach-call.i.v+cfa-reducer.c [2018-12-31 06:12:16,578 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 06:12:16,586 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-12-31 06:12:16,604 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-12-31 06:12:16,637 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 06:12:16,638 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 06:12:16,638 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 06:12:16,638 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 06:12:16,638 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 06:12:16,638 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 06:12:16,639 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 06:12:16,639 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 06:12:16,639 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 06:12:16,656 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-12-31 06:12:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 06:12:16,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:16,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:16,666 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:16,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:16,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1241029004, now seen corresponding path program 1 times [2018-12-31 06:12:16,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:16,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:16,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:16,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:16,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:16,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:16,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 06:12:16,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 06:12:16,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 06:12:16,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 06:12:16,865 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-12-31 06:12:16,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:16,913 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2018-12-31 06:12:16,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 06:12:16,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-31 06:12:16,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:16,927 INFO L225 Difference]: With dead ends: 83 [2018-12-31 06:12:16,927 INFO L226 Difference]: Without dead ends: 72 [2018-12-31 06:12:16,930 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-12-31 06:12:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-31 06:12:16,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2018-12-31 06:12:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-31 06:12:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-12-31 06:12:16,969 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 9 [2018-12-31 06:12:16,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:16,969 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-12-31 06:12:16,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 06:12:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-12-31 06:12:16,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 06:12:16,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:16,970 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:16,971 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:16,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:16,972 INFO L82 PathProgramCache]: Analyzing trace with hash -182802478, now seen corresponding path program 1 times [2018-12-31 06:12:16,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:16,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:16,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:16,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:16,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:17,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:17,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 06:12:17,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 06:12:17,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 06:12:17,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 06:12:17,104 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2018-12-31 06:12:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:17,511 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-12-31 06:12:17,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 06:12:17,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-31 06:12:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:17,514 INFO L225 Difference]: With dead ends: 73 [2018-12-31 06:12:17,514 INFO L226 Difference]: Without dead ends: 71 [2018-12-31 06:12:17,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 06:12:17,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-31 06:12:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2018-12-31 06:12:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-31 06:12:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-12-31 06:12:17,524 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 10 [2018-12-31 06:12:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:17,525 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-12-31 06:12:17,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 06:12:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-12-31 06:12:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 06:12:17,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:17,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:17,527 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:17,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:17,527 INFO L82 PathProgramCache]: Analyzing trace with hash -179156060, now seen corresponding path program 1 times [2018-12-31 06:12:17,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:17,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:17,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:17,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:17,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:17,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:17,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 06:12:17,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 06:12:17,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 06:12:17,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 06:12:17,588 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 4 states. [2018-12-31 06:12:17,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:17,732 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2018-12-31 06:12:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 06:12:17,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-31 06:12:17,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:17,736 INFO L225 Difference]: With dead ends: 143 [2018-12-31 06:12:17,736 INFO L226 Difference]: Without dead ends: 93 [2018-12-31 06:12:17,737 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-12-31 06:12:17,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-31 06:12:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2018-12-31 06:12:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-31 06:12:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-12-31 06:12:17,746 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2018-12-31 06:12:17,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:17,747 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-12-31 06:12:17,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 06:12:17,747 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-12-31 06:12:17,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 06:12:17,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:17,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:17,749 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:17,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:17,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1258866483, now seen corresponding path program 1 times [2018-12-31 06:12:17,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:17,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:17,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:17,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:17,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:17,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:17,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 06:12:17,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 06:12:17,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 06:12:17,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 06:12:17,902 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-12-31 06:12:18,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:18,209 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2018-12-31 06:12:18,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 06:12:18,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-12-31 06:12:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:18,212 INFO L225 Difference]: With dead ends: 94 [2018-12-31 06:12:18,212 INFO L226 Difference]: Without dead ends: 92 [2018-12-31 06:12:18,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-31 06:12:18,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-31 06:12:18,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 50. [2018-12-31 06:12:18,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-31 06:12:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-12-31 06:12:18,224 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2018-12-31 06:12:18,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:18,224 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-12-31 06:12:18,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 06:12:18,224 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-12-31 06:12:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 06:12:18,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:18,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:18,226 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:18,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:18,226 INFO L82 PathProgramCache]: Analyzing trace with hash 420636790, now seen corresponding path program 1 times [2018-12-31 06:12:18,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:18,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:18,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:18,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:18,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:18,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:18,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 06:12:18,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 06:12:18,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 06:12:18,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 06:12:18,499 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-12-31 06:12:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:18,789 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2018-12-31 06:12:18,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 06:12:18,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-12-31 06:12:18,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:18,791 INFO L225 Difference]: With dead ends: 87 [2018-12-31 06:12:18,791 INFO L226 Difference]: Without dead ends: 85 [2018-12-31 06:12:18,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 06:12:18,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-31 06:12:18,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 48. [2018-12-31 06:12:18,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-31 06:12:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-12-31 06:12:18,805 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2018-12-31 06:12:18,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:18,805 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-12-31 06:12:18,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 06:12:18,805 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-12-31 06:12:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 06:12:18,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:18,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:18,809 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:18,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:18,809 INFO L82 PathProgramCache]: Analyzing trace with hash -370151221, now seen corresponding path program 1 times [2018-12-31 06:12:18,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:18,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:18,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:18,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:18,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:18,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:18,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 06:12:18,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 06:12:18,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 06:12:18,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 06:12:18,949 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 8 states. [2018-12-31 06:12:19,269 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-31 06:12:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:19,919 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-12-31 06:12:19,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 06:12:19,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-31 06:12:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:19,921 INFO L225 Difference]: With dead ends: 89 [2018-12-31 06:12:19,921 INFO L226 Difference]: Without dead ends: 87 [2018-12-31 06:12:19,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-12-31 06:12:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-31 06:12:19,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 46. [2018-12-31 06:12:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-31 06:12:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-12-31 06:12:19,933 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 12 [2018-12-31 06:12:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:19,934 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-12-31 06:12:19,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 06:12:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-12-31 06:12:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 06:12:19,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:19,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:19,936 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:19,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:19,936 INFO L82 PathProgramCache]: Analyzing trace with hash 154842714, now seen corresponding path program 1 times [2018-12-31 06:12:19,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:19,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:19,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:19,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:19,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:20,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:20,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 06:12:20,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 06:12:20,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 06:12:20,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 06:12:20,010 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2018-12-31 06:12:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:20,231 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-12-31 06:12:20,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 06:12:20,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-31 06:12:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:20,235 INFO L225 Difference]: With dead ends: 75 [2018-12-31 06:12:20,235 INFO L226 Difference]: Without dead ends: 73 [2018-12-31 06:12:20,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 06:12:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-31 06:12:20,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2018-12-31 06:12:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-31 06:12:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-31 06:12:20,244 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 13 [2018-12-31 06:12:20,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:20,244 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-31 06:12:20,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 06:12:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-31 06:12:20,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 06:12:20,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:20,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:20,246 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:20,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:20,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1410218132, now seen corresponding path program 1 times [2018-12-31 06:12:20,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:20,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:20,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:20,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:20,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:20,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:20,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 06:12:20,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 06:12:20,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 06:12:20,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 06:12:20,451 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-12-31 06:12:20,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:20,655 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-12-31 06:12:20,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 06:12:20,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-12-31 06:12:20,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:20,657 INFO L225 Difference]: With dead ends: 85 [2018-12-31 06:12:20,657 INFO L226 Difference]: Without dead ends: 83 [2018-12-31 06:12:20,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-31 06:12:20,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-31 06:12:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 42. [2018-12-31 06:12:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-31 06:12:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-12-31 06:12:20,665 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2018-12-31 06:12:20,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:20,666 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-12-31 06:12:20,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 06:12:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-12-31 06:12:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 06:12:20,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:20,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:20,668 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:20,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:20,668 INFO L82 PathProgramCache]: Analyzing trace with hash 505160957, now seen corresponding path program 1 times [2018-12-31 06:12:20,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:20,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:20,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:20,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:20,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:20,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:20,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 06:12:20,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 06:12:20,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 06:12:20,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 06:12:20,749 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 6 states. [2018-12-31 06:12:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:20,967 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-12-31 06:12:20,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 06:12:20,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-31 06:12:20,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:20,969 INFO L225 Difference]: With dead ends: 67 [2018-12-31 06:12:20,969 INFO L226 Difference]: Without dead ends: 65 [2018-12-31 06:12:20,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-31 06:12:20,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-31 06:12:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2018-12-31 06:12:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-31 06:12:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-31 06:12:20,976 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2018-12-31 06:12:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:20,977 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-31 06:12:20,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 06:12:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-12-31 06:12:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 06:12:20,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:20,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:20,978 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:20,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:20,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1519875391, now seen corresponding path program 1 times [2018-12-31 06:12:20,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:20,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:20,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:20,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:20,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:21,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:21,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 06:12:21,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 06:12:21,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 06:12:21,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 06:12:21,101 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2018-12-31 06:12:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:21,232 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-12-31 06:12:21,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 06:12:21,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-12-31 06:12:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:21,234 INFO L225 Difference]: With dead ends: 67 [2018-12-31 06:12:21,236 INFO L226 Difference]: Without dead ends: 65 [2018-12-31 06:12:21,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 06:12:21,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-31 06:12:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2018-12-31 06:12:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-31 06:12:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-12-31 06:12:21,243 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2018-12-31 06:12:21,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:21,243 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-12-31 06:12:21,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 06:12:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-12-31 06:12:21,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 06:12:21,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:21,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:21,245 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:21,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:21,246 INFO L82 PathProgramCache]: Analyzing trace with hash 128507268, now seen corresponding path program 1 times [2018-12-31 06:12:21,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:21,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:21,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:21,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:21,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:21,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:21,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 06:12:21,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 06:12:21,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 06:12:21,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 06:12:21,349 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2018-12-31 06:12:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:21,580 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-12-31 06:12:21,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 06:12:21,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-31 06:12:21,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:21,582 INFO L225 Difference]: With dead ends: 65 [2018-12-31 06:12:21,582 INFO L226 Difference]: Without dead ends: 63 [2018-12-31 06:12:21,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-31 06:12:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-31 06:12:21,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2018-12-31 06:12:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 06:12:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-12-31 06:12:21,589 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2018-12-31 06:12:21,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:21,589 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-31 06:12:21,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 06:12:21,590 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-12-31 06:12:21,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 06:12:21,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:21,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:21,591 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:21,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:21,592 INFO L82 PathProgramCache]: Analyzing trace with hash -311237848, now seen corresponding path program 1 times [2018-12-31 06:12:21,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:21,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:21,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:21,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:21,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:21,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:21,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 06:12:21,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 06:12:21,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 06:12:21,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 06:12:21,670 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2018-12-31 06:12:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:21,844 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-12-31 06:12:21,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 06:12:21,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-31 06:12:21,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:21,846 INFO L225 Difference]: With dead ends: 86 [2018-12-31 06:12:21,846 INFO L226 Difference]: Without dead ends: 84 [2018-12-31 06:12:21,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-31 06:12:21,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-31 06:12:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 34. [2018-12-31 06:12:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-31 06:12:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-12-31 06:12:21,855 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 17 [2018-12-31 06:12:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:21,856 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-31 06:12:21,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 06:12:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-12-31 06:12:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 06:12:21,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:21,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:21,857 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:21,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:21,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1058434549, now seen corresponding path program 1 times [2018-12-31 06:12:21,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:21,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:21,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:21,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:21,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:22,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:22,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:22,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 06:12:22,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 06:12:22,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 06:12:22,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-31 06:12:22,451 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 8 states. [2018-12-31 06:12:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:22,914 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2018-12-31 06:12:22,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 06:12:22,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-31 06:12:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:22,917 INFO L225 Difference]: With dead ends: 68 [2018-12-31 06:12:22,917 INFO L226 Difference]: Without dead ends: 66 [2018-12-31 06:12:22,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-12-31 06:12:22,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-31 06:12:22,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 32. [2018-12-31 06:12:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-31 06:12:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-12-31 06:12:22,927 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2018-12-31 06:12:22,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:22,927 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-31 06:12:22,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 06:12:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-31 06:12:22,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 06:12:22,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:22,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:22,930 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:22,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:22,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1548271503, now seen corresponding path program 1 times [2018-12-31 06:12:22,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:22,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:22,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:22,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:22,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:23,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:23,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 06:12:23,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 06:12:23,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 06:12:23,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 06:12:23,049 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2018-12-31 06:12:23,928 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 06:12:24,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:24,448 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-12-31 06:12:24,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 06:12:24,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-12-31 06:12:24,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:24,450 INFO L225 Difference]: With dead ends: 103 [2018-12-31 06:12:24,450 INFO L226 Difference]: Without dead ends: 101 [2018-12-31 06:12:24,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-31 06:12:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-31 06:12:24,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 30. [2018-12-31 06:12:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 06:12:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-31 06:12:24,458 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2018-12-31 06:12:24,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:24,459 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-31 06:12:24,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 06:12:24,459 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-31 06:12:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 06:12:24,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:24,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:24,460 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:24,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:24,461 INFO L82 PathProgramCache]: Analyzing trace with hash 751780498, now seen corresponding path program 1 times [2018-12-31 06:12:24,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:24,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:24,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:24,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:24,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:24,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:24,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 06:12:24,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 06:12:24,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 06:12:24,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-31 06:12:24,668 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2018-12-31 06:12:25,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:25,116 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-12-31 06:12:25,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 06:12:25,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-12-31 06:12:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:25,118 INFO L225 Difference]: With dead ends: 66 [2018-12-31 06:12:25,119 INFO L226 Difference]: Without dead ends: 64 [2018-12-31 06:12:25,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-12-31 06:12:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-31 06:12:25,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 28. [2018-12-31 06:12:25,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 06:12:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-12-31 06:12:25,125 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2018-12-31 06:12:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:25,126 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-31 06:12:25,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 06:12:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-31 06:12:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 06:12:25,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 06:12:25,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 06:12:25,127 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 06:12:25,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 06:12:25,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1830363126, now seen corresponding path program 1 times [2018-12-31 06:12:25,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 06:12:25,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 06:12:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:25,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 06:12:25,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 06:12:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 06:12:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 06:12:25,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 06:12:25,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 06:12:25,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 06:12:25,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 06:12:25,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 06:12:25,363 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2018-12-31 06:12:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 06:12:25,786 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2018-12-31 06:12:25,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 06:12:25,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-31 06:12:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 06:12:25,788 INFO L225 Difference]: With dead ends: 82 [2018-12-31 06:12:25,788 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 06:12:25,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-31 06:12:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 06:12:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 06:12:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 06:12:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 06:12:25,790 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-12-31 06:12:25,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 06:12:25,790 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 06:12:25,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 06:12:25,791 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 06:12:25,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 06:12:25,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 06:12:25,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 06:12:25,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 06:12:25,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 06:12:25,978 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 86 [2018-12-31 06:12:26,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 06:12:26,203 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 72 [2018-12-31 06:12:27,778 WARN L181 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 86 DAG size of output: 21 [2018-12-31 06:12:28,312 WARN L181 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 35 [2018-12-31 06:12:28,316 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2018-12-31 06:12:28,316 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2018-12-31 06:12:28,316 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2018-12-31 06:12:28,317 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2018-12-31 06:12:28,317 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2018-12-31 06:12:28,317 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2018-12-31 06:12:28,317 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2018-12-31 06:12:28,318 INFO L444 ceAbstractionStarter]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse0 (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0))) (or (and (and (and (<= 0 ULTIMATE.start_main_~main__j~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__len~0)) .cse0) (<= 0 ULTIMATE.start_main_~main__i~0)) (let ((.cse2 (<= (+ ULTIMATE.start_main_~main__j~0 4) ULTIMATE.start_main_~main__bufsize~0))) (let ((.cse1 (and (let ((.cse3 (<= 1 ULTIMATE.start_main_~main__i~0))) (or (and .cse3 .cse2) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse3))) (<= 1 ULTIMATE.start_main_~main__j~0)))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~14 0)) .cse1 .cse0) (and .cse1 .cse0 .cse2)))))) [2018-12-31 06:12:28,318 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2018-12-31 06:12:28,318 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-31 06:12:28,318 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 06:12:28,318 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2018-12-31 06:12:28,318 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 06:12:28,318 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2018-12-31 06:12:28,319 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2018-12-31 06:12:28,319 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2018-12-31 06:12:28,319 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2018-12-31 06:12:28,319 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-31 06:12:28,319 INFO L448 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2018-12-31 06:12:28,319 INFO L448 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2018-12-31 06:12:28,319 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2018-12-31 06:12:28,319 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-12-31 06:12:28,320 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2018-12-31 06:12:28,320 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2018-12-31 06:12:28,320 INFO L448 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2018-12-31 06:12:28,320 INFO L448 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2018-12-31 06:12:28,320 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2018-12-31 06:12:28,320 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2018-12-31 06:12:28,320 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2018-12-31 06:12:28,320 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2018-12-31 06:12:28,321 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2018-12-31 06:12:28,321 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2018-12-31 06:12:28,321 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2018-12-31 06:12:28,321 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2018-12-31 06:12:28,321 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2018-12-31 06:12:28,321 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-31 06:12:28,321 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2018-12-31 06:12:28,322 INFO L444 ceAbstractionStarter]: At program point L288(lines 33 289) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__j~0 5) ULTIMATE.start_main_~main__bufsize~0) (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__len~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0) (<= 0 ULTIMATE.start_main_~main__j~0)) [2018-12-31 06:12:28,322 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 06:12:28,322 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2018-12-31 06:12:28,322 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-31 06:12:28,322 INFO L451 ceAbstractionStarter]: At program point L305(lines 8 308) the Hoare annotation is: true [2018-12-31 06:12:28,322 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2018-12-31 06:12:28,323 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-12-31 06:12:28,323 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2018-12-31 06:12:28,323 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2018-12-31 06:12:28,323 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2018-12-31 06:12:28,323 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 06:12:28,323 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2018-12-31 06:12:28,323 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-12-31 06:12:28,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2018-12-31 06:12:28,324 INFO L448 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2018-12-31 06:12:28,324 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-12-31 06:12:28,324 INFO L448 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-12-31 06:12:28,324 INFO L448 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2018-12-31 06:12:28,324 INFO L444 ceAbstractionStarter]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0)) [2018-12-31 06:12:28,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2018-12-31 06:12:28,325 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-12-31 06:12:28,325 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2018-12-31 06:12:28,325 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-12-31 06:12:28,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 06:12:28 BoogieIcfgContainer [2018-12-31 06:12:28,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 06:12:28,345 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 06:12:28,345 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 06:12:28,345 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 06:12:28,345 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:12:16" (3/4) ... [2018-12-31 06:12:28,349 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 06:12:28,372 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-31 06:12:28,373 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 06:12:28,467 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 06:12:28,467 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 06:12:28,469 INFO L168 Benchmark]: Toolchain (without parser) took 13096.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 951.4 MB in the beginning and 789.8 MB in the end (delta: 161.6 MB). Peak memory consumption was 347.7 MB. Max. memory is 11.5 GB. [2018-12-31 06:12:28,470 INFO L168 Benchmark]: CDTParser took 1.40 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 06:12:28,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.56 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 06:12:28,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.28 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 06:12:28,476 INFO L168 Benchmark]: Boogie Preprocessor took 89.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-31 06:12:28,477 INFO L168 Benchmark]: RCFGBuilder took 624.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-12-31 06:12:28,477 INFO L168 Benchmark]: TraceAbstraction took 11783.30 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 797.7 MB in the end (delta: 287.0 MB). Peak memory consumption was 356.2 MB. Max. memory is 11.5 GB. [2018-12-31 06:12:28,477 INFO L168 Benchmark]: Witness Printer took 123.49 ms. Allocated memory is still 1.2 GB. Free memory was 797.7 MB in the beginning and 789.8 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2018-12-31 06:12:28,487 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.40 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 415.56 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.28 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 624.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11783.30 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 797.7 MB in the end (delta: 287.0 MB). Peak memory consumption was 356.2 MB. Max. memory is 11.5 GB. * Witness Printer took 123.49 ms. Allocated memory is still 1.2 GB. Free memory was 797.7 MB in the beginning and 789.8 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((main__j + 5 <= main__bufsize && 0 <= main__i) && main__i + 1 <= main__len) && main__limit + 4 <= main__bufsize) && 0 <= main__j - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((0 <= main__j && main__i + 1 <= main__len) && main__limit + 4 <= main__bufsize) && 0 <= main__i) || ((!(__VERIFIER_assert__cond == 0) && ((1 <= main__i && main__j + 4 <= main__bufsize) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__i)) && 1 <= main__j) && main__limit + 4 <= main__bufsize) || (((((1 <= main__i && main__j + 4 <= main__bufsize) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__i)) && 1 <= main__j) && main__limit + 4 <= main__bufsize) && main__j + 4 <= main__bufsize) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 16 error locations. SAFE Result, 11.6s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 2.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 703 SDtfs, 1740 SDslu, 714 SDs, 0 SdLazy, 1623 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 536 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 22 NumberOfFragments, 121 HoareAnnotationTreeSize, 4 FomulaSimplifications, 3751018988 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1111887 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 12103 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...