./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/apache-get-tag_true-unreach-call.i.p+lhb-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 d63a23585cedb87d2d2ae4c59168b108a64280e1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 11:22:22,375 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:22:22,378 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:22:22,394 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:22:22,394 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:22:22,396 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:22:22,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:22:22,408 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:22:22,410 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:22:22,411 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:22:22,413 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:22:22,414 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:22:22,415 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:22:22,416 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:22:22,417 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:22:22,417 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:22:22,426 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:22:22,428 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:22:22,434 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:22:22,437 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:22:22,438 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:22:22,441 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:22:22,445 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:22:22,445 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:22:22,445 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:22:22,446 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:22:22,447 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:22:22,448 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:22:22,450 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:22:22,450 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:22:22,452 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:22:22,453 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:22:22,453 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:22:22,453 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:22:22,456 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:22:22,457 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:22:22,457 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 11:22:22,477 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:22:22,477 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:22:22,479 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:22:22,479 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:22:22,480 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:22:22,480 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:22:22,480 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:22:22,480 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:22:22,480 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:22:22,480 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:22:22,481 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:22:22,485 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:22:22,486 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:22:22,486 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:22:22,486 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:22:22,486 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:22:22,486 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:22:22,486 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:22:22,487 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:22:22,487 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:22:22,487 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:22:22,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:22:22,487 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:22:22,487 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:22:22,488 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:22:22,488 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:22:22,488 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:22:22,488 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:22:22,488 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 -> d63a23585cedb87d2d2ae4c59168b108a64280e1 [2019-01-12 11:22:22,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:22:22,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:22:22,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:22:22,564 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:22:22,565 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:22:22,565 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2019-01-12 11:22:22,625 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39fc03951/2bffac2eb0354c649aa7981d25ce4f19/FLAGbd210886c [2019-01-12 11:22:23,048 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:22:23,049 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2019-01-12 11:22:23,061 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39fc03951/2bffac2eb0354c649aa7981d25ce4f19/FLAGbd210886c [2019-01-12 11:22:23,401 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39fc03951/2bffac2eb0354c649aa7981d25ce4f19 [2019-01-12 11:22:23,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:22:23,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:22:23,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:22:23,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:22:23,412 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:22:23,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:22:23" (1/1) ... [2019-01-12 11:22:23,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a290a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:23, skipping insertion in model container [2019-01-12 11:22:23,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:22:23" (1/1) ... [2019-01-12 11:22:23,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:22:23,496 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:22:23,832 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:22:23,838 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:22:23,933 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:22:23,949 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:22:23,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:23 WrapperNode [2019-01-12 11:22:23,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:22:23,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:22:23,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:22:23,951 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:22:23,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:23" (1/1) ... [2019-01-12 11:22:23,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:23" (1/1) ... [2019-01-12 11:22:24,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:22:24,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:22:24,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:22:24,080 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:22:24,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:23" (1/1) ... [2019-01-12 11:22:24,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:23" (1/1) ... [2019-01-12 11:22:24,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:23" (1/1) ... [2019-01-12 11:22:24,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:23" (1/1) ... [2019-01-12 11:22:24,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:23" (1/1) ... [2019-01-12 11:22:24,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:23" (1/1) ... [2019-01-12 11:22:24,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:23" (1/1) ... [2019-01-12 11:22:24,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:22:24,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:22:24,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:22:24,117 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:22:24,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:23" (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 [2019-01-12 11:22:24,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:22:24,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:22:25,310 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:22:25,310 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 11:22:25,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:22:25 BoogieIcfgContainer [2019-01-12 11:22:25,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:22:25,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:22:25,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:22:25,316 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:22:25,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:22:23" (1/3) ... [2019-01-12 11:22:25,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2ff17a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:22:25, skipping insertion in model container [2019-01-12 11:22:25,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:23" (2/3) ... [2019-01-12 11:22:25,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2ff17a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:22:25, skipping insertion in model container [2019-01-12 11:22:25,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:22:25" (3/3) ... [2019-01-12 11:22:25,320 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2019-01-12 11:22:25,329 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:22:25,335 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-01-12 11:22:25,350 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-01-12 11:22:25,382 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:22:25,382 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:22:25,383 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:22:25,383 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:22:25,383 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:22:25,383 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:22:25,383 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:22:25,384 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:22:25,384 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:22:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2019-01-12 11:22:25,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 11:22:25,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:25,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:25,410 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:25,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:25,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1804934597, now seen corresponding path program 1 times [2019-01-12 11:22:25,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:25,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:25,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:25,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:25,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:25,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:25,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 11:22:25,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 11:22:25,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 11:22:25,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:22:25,668 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 4 states. [2019-01-12 11:22:26,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:26,430 INFO L93 Difference]: Finished difference Result 131 states and 205 transitions. [2019-01-12 11:22:26,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 11:22:26,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-12 11:22:26,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:26,445 INFO L225 Difference]: With dead ends: 131 [2019-01-12 11:22:26,445 INFO L226 Difference]: Without dead ends: 114 [2019-01-12 11:22:26,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:22:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-12 11:22:26,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-12 11:22:26,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-12 11:22:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2019-01-12 11:22:26,494 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 7 [2019-01-12 11:22:26,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:26,495 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2019-01-12 11:22:26,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 11:22:26,495 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2019-01-12 11:22:26,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-12 11:22:26,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:26,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:26,497 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:26,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:26,497 INFO L82 PathProgramCache]: Analyzing trace with hash 118401710, now seen corresponding path program 1 times [2019-01-12 11:22:26,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:26,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:26,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:26,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:26,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:26,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:26,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:26,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:26,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:26,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:26,579 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand 6 states. [2019-01-12 11:22:27,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:27,197 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2019-01-12 11:22:27,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:27,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-01-12 11:22:27,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:27,201 INFO L225 Difference]: With dead ends: 114 [2019-01-12 11:22:27,201 INFO L226 Difference]: Without dead ends: 109 [2019-01-12 11:22:27,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:22:27,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-12 11:22:27,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-12 11:22:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-12 11:22:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2019-01-12 11:22:27,213 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 8 [2019-01-12 11:22:27,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:27,213 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2019-01-12 11:22:27,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:27,213 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2019-01-12 11:22:27,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 11:22:27,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:27,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:27,215 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:27,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:27,215 INFO L82 PathProgramCache]: Analyzing trace with hash -639549266, now seen corresponding path program 1 times [2019-01-12 11:22:27,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:27,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:27,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:27,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:27,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:27,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:27,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:27,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:27,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:27,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:27,325 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand 6 states. [2019-01-12 11:22:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:27,779 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2019-01-12 11:22:27,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:22:27,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-12 11:22:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:27,791 INFO L225 Difference]: With dead ends: 144 [2019-01-12 11:22:27,791 INFO L226 Difference]: Without dead ends: 142 [2019-01-12 11:22:27,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:22:27,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-12 11:22:27,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 107. [2019-01-12 11:22:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-12 11:22:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2019-01-12 11:22:27,812 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 11 [2019-01-12 11:22:27,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:27,812 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2019-01-12 11:22:27,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2019-01-12 11:22:27,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 11:22:27,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:27,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:27,817 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:27,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:27,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1648813321, now seen corresponding path program 1 times [2019-01-12 11:22:27,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:27,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:27,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:27,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:27,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:27,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:27,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:27,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:27,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:27,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:27,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:27,920 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 6 states. [2019-01-12 11:22:28,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:28,835 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2019-01-12 11:22:28,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:22:28,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-01-12 11:22:28,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:28,838 INFO L225 Difference]: With dead ends: 140 [2019-01-12 11:22:28,838 INFO L226 Difference]: Without dead ends: 134 [2019-01-12 11:22:28,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:22:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-12 11:22:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 103. [2019-01-12 11:22:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-12 11:22:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2019-01-12 11:22:28,847 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 12 [2019-01-12 11:22:28,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:28,847 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2019-01-12 11:22:28,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2019-01-12 11:22:28,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 11:22:28,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:28,848 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:28,849 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:28,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:28,849 INFO L82 PathProgramCache]: Analyzing trace with hash -411248735, now seen corresponding path program 1 times [2019-01-12 11:22:28,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:28,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:28,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:28,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:28,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:28,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:28,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:28,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:28,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:28,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:28,938 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 6 states. [2019-01-12 11:22:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:29,352 INFO L93 Difference]: Finished difference Result 168 states and 187 transitions. [2019-01-12 11:22:29,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:22:29,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-01-12 11:22:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:29,355 INFO L225 Difference]: With dead ends: 168 [2019-01-12 11:22:29,355 INFO L226 Difference]: Without dead ends: 166 [2019-01-12 11:22:29,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:22:29,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-12 11:22:29,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 101. [2019-01-12 11:22:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-12 11:22:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-01-12 11:22:29,364 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 13 [2019-01-12 11:22:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:29,365 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-01-12 11:22:29,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-01-12 11:22:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 11:22:29,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:29,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:29,366 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:29,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:29,367 INFO L82 PathProgramCache]: Analyzing trace with hash -409524831, now seen corresponding path program 1 times [2019-01-12 11:22:29,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:29,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:29,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:29,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:29,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:29,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:29,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:29,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:29,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:29,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:29,444 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 6 states. [2019-01-12 11:22:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:29,933 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2019-01-12 11:22:29,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:22:29,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-01-12 11:22:29,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:29,937 INFO L225 Difference]: With dead ends: 128 [2019-01-12 11:22:29,938 INFO L226 Difference]: Without dead ends: 126 [2019-01-12 11:22:29,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:22:29,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-12 11:22:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 99. [2019-01-12 11:22:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-12 11:22:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-01-12 11:22:29,951 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 13 [2019-01-12 11:22:29,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:29,951 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-01-12 11:22:29,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-01-12 11:22:29,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 11:22:29,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:29,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:29,956 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:29,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:29,956 INFO L82 PathProgramCache]: Analyzing trace with hash 136195212, now seen corresponding path program 1 times [2019-01-12 11:22:29,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:29,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:29,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:29,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:29,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:30,252 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2019-01-12 11:22:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:30,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:30,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:22:30,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:22:30,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:22:30,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:22:30,382 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 8 states. [2019-01-12 11:22:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:30,806 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2019-01-12 11:22:30,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:22:30,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-12 11:22:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:30,809 INFO L225 Difference]: With dead ends: 116 [2019-01-12 11:22:30,809 INFO L226 Difference]: Without dead ends: 114 [2019-01-12 11:22:30,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:22:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-12 11:22:30,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2019-01-12 11:22:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-12 11:22:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-01-12 11:22:30,815 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 14 [2019-01-12 11:22:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:30,815 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-01-12 11:22:30,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:22:30,816 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-01-12 11:22:30,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 11:22:30,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:30,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:30,817 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:30,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:30,817 INFO L82 PathProgramCache]: Analyzing trace with hash 137742357, now seen corresponding path program 1 times [2019-01-12 11:22:30,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:30,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:30,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:30,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:30,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:30,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:30,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:30,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:30,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:30,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:30,877 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 6 states. [2019-01-12 11:22:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:31,735 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2019-01-12 11:22:31,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:22:31,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-12 11:22:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:31,737 INFO L225 Difference]: With dead ends: 158 [2019-01-12 11:22:31,738 INFO L226 Difference]: Without dead ends: 156 [2019-01-12 11:22:31,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:22:31,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-12 11:22:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 95. [2019-01-12 11:22:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-12 11:22:31,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-01-12 11:22:31,747 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 14 [2019-01-12 11:22:31,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:31,749 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-01-12 11:22:31,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-01-12 11:22:31,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 11:22:31,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:31,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:31,750 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:31,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:31,751 INFO L82 PathProgramCache]: Analyzing trace with hash 189636292, now seen corresponding path program 1 times [2019-01-12 11:22:31,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:31,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:31,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:31,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:31,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:31,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:31,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:22:31,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:22:31,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:22:31,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:22:31,928 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 8 states. [2019-01-12 11:22:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:32,376 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-01-12 11:22:32,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:32,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-12 11:22:32,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:32,378 INFO L225 Difference]: With dead ends: 95 [2019-01-12 11:22:32,378 INFO L226 Difference]: Without dead ends: 91 [2019-01-12 11:22:32,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-01-12 11:22:32,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-12 11:22:32,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-12 11:22:32,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-12 11:22:32,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-01-12 11:22:32,384 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 14 [2019-01-12 11:22:32,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:32,384 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-01-12 11:22:32,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:22:32,384 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-01-12 11:22:32,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 11:22:32,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:32,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:32,386 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:32,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:32,386 INFO L82 PathProgramCache]: Analyzing trace with hash -24950085, now seen corresponding path program 1 times [2019-01-12 11:22:32,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:32,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:32,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:32,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:32,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:32,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:32,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:32,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:22:32,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:22:32,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:22:32,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:22:32,498 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 8 states. [2019-01-12 11:22:33,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:33,037 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2019-01-12 11:22:33,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:22:33,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-12 11:22:33,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:33,039 INFO L225 Difference]: With dead ends: 107 [2019-01-12 11:22:33,039 INFO L226 Difference]: Without dead ends: 105 [2019-01-12 11:22:33,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:22:33,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-12 11:22:33,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2019-01-12 11:22:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-12 11:22:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2019-01-12 11:22:33,045 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 15 [2019-01-12 11:22:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:33,045 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2019-01-12 11:22:33,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:22:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2019-01-12 11:22:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 11:22:33,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:33,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:33,047 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:33,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:33,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2034707599, now seen corresponding path program 1 times [2019-01-12 11:22:33,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:33,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:33,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:33,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:33,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:33,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:33,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:33,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:22:33,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:22:33,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:22:33,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:22:33,120 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 7 states. [2019-01-12 11:22:33,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:33,418 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2019-01-12 11:22:33,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:22:33,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-12 11:22:33,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:33,420 INFO L225 Difference]: With dead ends: 104 [2019-01-12 11:22:33,420 INFO L226 Difference]: Without dead ends: 102 [2019-01-12 11:22:33,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:22:33,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-12 11:22:33,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2019-01-12 11:22:33,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-12 11:22:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2019-01-12 11:22:33,426 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 16 [2019-01-12 11:22:33,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:33,427 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2019-01-12 11:22:33,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:22:33,427 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2019-01-12 11:22:33,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 11:22:33,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:33,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:33,429 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:33,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:33,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1348569745, now seen corresponding path program 1 times [2019-01-12 11:22:33,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:33,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:33,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:33,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:33,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:33,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:33,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:33,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:33,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:33,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:33,566 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 6 states. [2019-01-12 11:22:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:34,143 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2019-01-12 11:22:34,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:22:34,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-12 11:22:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:34,145 INFO L225 Difference]: With dead ends: 100 [2019-01-12 11:22:34,146 INFO L226 Difference]: Without dead ends: 54 [2019-01-12 11:22:34,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:22:34,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-12 11:22:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-12 11:22:34,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-12 11:22:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-12 11:22:34,150 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 17 [2019-01-12 11:22:34,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:34,150 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-12 11:22:34,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-12 11:22:34,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-12 11:22:34,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:34,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:34,152 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:34,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:34,154 INFO L82 PathProgramCache]: Analyzing trace with hash 892497877, now seen corresponding path program 1 times [2019-01-12 11:22:34,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:34,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:34,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:34,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:34,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:34,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:34,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:22:34,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:22:34,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:22:34,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:22:34,334 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 7 states. [2019-01-12 11:22:34,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:34,480 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-12 11:22:34,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:34,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-01-12 11:22:34,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:34,482 INFO L225 Difference]: With dead ends: 54 [2019-01-12 11:22:34,483 INFO L226 Difference]: Without dead ends: 52 [2019-01-12 11:22:34,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:22:34,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-12 11:22:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-12 11:22:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-12 11:22:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-12 11:22:34,485 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 44 [2019-01-12 11:22:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:34,485 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-12 11:22:34,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:22:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-12 11:22:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-12 11:22:34,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:34,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:34,487 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:34,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:34,488 INFO L82 PathProgramCache]: Analyzing trace with hash 892513765, now seen corresponding path program 1 times [2019-01-12 11:22:34,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:34,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:34,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:34,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:34,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:34,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:34,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:22:34,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:22:34,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:22:34,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:22:34,593 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 7 states. [2019-01-12 11:22:34,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:34,742 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-12 11:22:34,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:34,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-01-12 11:22:34,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:34,744 INFO L225 Difference]: With dead ends: 59 [2019-01-12 11:22:34,744 INFO L226 Difference]: Without dead ends: 57 [2019-01-12 11:22:34,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:22:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-12 11:22:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2019-01-12 11:22:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 11:22:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-12 11:22:34,748 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 44 [2019-01-12 11:22:34,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:34,749 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-12 11:22:34,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:22:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-12 11:22:34,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 11:22:34,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:34,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:34,751 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:34,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:34,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1897634854, now seen corresponding path program 1 times [2019-01-12 11:22:34,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:34,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:34,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:34,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:34,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:34,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:34,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:22:34,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:22:34,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:22:34,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:22:34,886 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 8 states. [2019-01-12 11:22:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:35,073 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-12 11:22:35,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:22:35,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-01-12 11:22:35,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:35,076 INFO L225 Difference]: With dead ends: 50 [2019-01-12 11:22:35,076 INFO L226 Difference]: Without dead ends: 46 [2019-01-12 11:22:35,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:22:35,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-12 11:22:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-12 11:22:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-12 11:22:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-12 11:22:35,078 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 45 [2019-01-12 11:22:35,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:35,079 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-12 11:22:35,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:22:35,079 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-12 11:22:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 11:22:35,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:35,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:35,080 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:35,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:35,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1898127398, now seen corresponding path program 1 times [2019-01-12 11:22:35,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:35,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:35,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:35,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:35,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:35,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:35,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:22:35,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:22:35,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:22:35,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:22:35,205 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 8 states. [2019-01-12 11:22:35,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:35,497 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-12 11:22:35,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:22:35,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-01-12 11:22:35,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:35,498 INFO L225 Difference]: With dead ends: 50 [2019-01-12 11:22:35,498 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:22:35,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:22:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:22:35,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:22:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:22:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:22:35,500 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-01-12 11:22:35,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:35,500 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:22:35,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:22:35,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:22:35,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:22:35,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:22:36,078 WARN L181 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 8 [2019-01-12 11:22:36,419 WARN L181 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 6 [2019-01-12 11:22:36,614 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-12 11:22:36,703 INFO L448 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed. [2019-01-12 11:22:36,703 INFO L451 ceAbstractionStarter]: At program point L927(lines 12 1001) the Hoare annotation is: true [2019-01-12 11:22:36,704 INFO L448 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed. [2019-01-12 11:22:36,704 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed. [2019-01-12 11:22:36,704 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed. [2019-01-12 11:22:36,704 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-01-12 11:22:36,704 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed. [2019-01-12 11:22:36,705 INFO L448 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed. [2019-01-12 11:22:36,705 INFO L448 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed. [2019-01-12 11:22:36,705 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-01-12 11:22:36,705 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed. [2019-01-12 11:22:36,705 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:22:36,705 INFO L448 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed. [2019-01-12 11:22:36,706 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-01-12 11:22:36,706 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-01-12 11:22:36,706 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed. [2019-01-12 11:22:36,706 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed. [2019-01-12 11:22:36,706 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed. [2019-01-12 11:22:36,706 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 11:22:36,706 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-01-12 11:22:36,706 INFO L448 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed. [2019-01-12 11:22:36,706 INFO L444 ceAbstractionStarter]: At program point L863(lines 21 995) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-01-12 11:22:36,706 INFO L448 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-01-12 11:22:36,707 INFO L448 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed. [2019-01-12 11:22:36,707 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed. [2019-01-12 11:22:36,707 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed. [2019-01-12 11:22:36,707 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed. [2019-01-12 11:22:36,707 INFO L448 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed. [2019-01-12 11:22:36,707 INFO L448 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed. [2019-01-12 11:22:36,707 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed. [2019-01-12 11:22:36,707 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed. [2019-01-12 11:22:36,707 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed. [2019-01-12 11:22:36,707 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-01-12 11:22:36,708 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed. [2019-01-12 11:22:36,708 INFO L448 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed. [2019-01-12 11:22:36,708 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed. [2019-01-12 11:22:36,708 INFO L444 ceAbstractionStarter]: At program point L899(lines 60 994) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2019-01-12 11:22:36,708 INFO L448 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed. [2019-01-12 11:22:36,708 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-01-12 11:22:36,708 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed. [2019-01-12 11:22:36,708 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-01-12 11:22:36,708 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed. [2019-01-12 11:22:36,708 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed. [2019-01-12 11:22:36,709 INFO L451 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: true [2019-01-12 11:22:36,709 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed. [2019-01-12 11:22:36,709 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:22:36,709 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed. [2019-01-12 11:22:36,709 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed. [2019-01-12 11:22:36,709 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed. [2019-01-12 11:22:36,709 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-01-12 11:22:36,709 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed. [2019-01-12 11:22:36,709 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-01-12 11:22:36,709 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed. [2019-01-12 11:22:36,710 INFO L448 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed. [2019-01-12 11:22:36,711 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-01-12 11:22:36,711 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 11:22:36,711 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed. [2019-01-12 11:22:36,712 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed. [2019-01-12 11:22:36,712 INFO L444 ceAbstractionStarter]: At program point L935(lines 853 942) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~14 1)) [2019-01-12 11:22:36,712 INFO L448 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed. [2019-01-12 11:22:36,712 INFO L448 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed. [2019-01-12 11:22:36,713 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed. [2019-01-12 11:22:36,714 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed. [2019-01-12 11:22:36,714 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed. [2019-01-12 11:22:36,714 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-01-12 11:22:36,714 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed. [2019-01-12 11:22:36,714 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed. [2019-01-12 11:22:36,714 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:22:36,715 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2019-01-12 11:22:36,715 INFO L448 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed. [2019-01-12 11:22:36,715 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed. [2019-01-12 11:22:36,715 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed. [2019-01-12 11:22:36,715 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed. [2019-01-12 11:22:36,715 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed. [2019-01-12 11:22:36,715 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed. [2019-01-12 11:22:36,715 INFO L448 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed. [2019-01-12 11:22:36,715 INFO L448 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed. [2019-01-12 11:22:36,715 INFO L444 ceAbstractionStarter]: At program point L277(lines 127 279) the Hoare annotation is: (and (not (= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2019-01-12 11:22:36,716 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-01-12 11:22:36,716 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 11:22:36,716 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-01-12 11:22:36,716 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed. [2019-01-12 11:22:36,716 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-01-12 11:22:36,716 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-01-12 11:22:36,716 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed. [2019-01-12 11:22:36,716 INFO L448 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed. [2019-01-12 11:22:36,716 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed. [2019-01-12 11:22:36,716 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed. [2019-01-12 11:22:36,717 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed. [2019-01-12 11:22:36,717 INFO L448 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed. [2019-01-12 11:22:36,717 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 11:22:36,717 INFO L448 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2019-01-12 11:22:36,717 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed. [2019-01-12 11:22:36,717 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-01-12 11:22:36,718 INFO L448 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed. [2019-01-12 11:22:36,719 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed. [2019-01-12 11:22:36,719 INFO L448 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-01-12 11:22:36,719 INFO L448 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed. [2019-01-12 11:22:36,720 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 11:22:36,720 INFO L448 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed. [2019-01-12 11:22:36,720 INFO L448 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-01-12 11:22:36,720 INFO L448 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed. [2019-01-12 11:22:36,720 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed. [2019-01-12 11:22:36,720 INFO L448 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-01-12 11:22:36,720 INFO L448 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed. [2019-01-12 11:22:36,721 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed. [2019-01-12 11:22:36,721 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed. [2019-01-12 11:22:36,721 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed. [2019-01-12 11:22:36,721 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed. [2019-01-12 11:22:36,721 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-01-12 11:22:36,721 INFO L448 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed. [2019-01-12 11:22:36,721 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 11:22:36,722 INFO L448 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed. [2019-01-12 11:22:36,723 INFO L448 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed. [2019-01-12 11:22:36,723 INFO L448 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed. [2019-01-12 11:22:36,723 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed. [2019-01-12 11:22:36,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2019-01-12 11:22:36,723 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed. [2019-01-12 11:22:36,723 INFO L448 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed. [2019-01-12 11:22:36,723 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed. [2019-01-12 11:22:36,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:22:36 BoogieIcfgContainer [2019-01-12 11:22:36,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:22:36,746 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:22:36,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:22:36,748 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:22:36,748 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:22:25" (3/4) ... [2019-01-12 11:22:36,752 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:22:36,788 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 11:22:36,790 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 11:22:37,027 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:22:37,027 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:22:37,031 INFO L168 Benchmark]: Toolchain (without parser) took 13622.82 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 277.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -129.5 MB). Peak memory consumption was 147.8 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:37,033 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:22:37,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 542.30 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 920.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:37,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -219.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:37,034 INFO L168 Benchmark]: Boogie Preprocessor took 36.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:37,036 INFO L168 Benchmark]: RCFGBuilder took 1195.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:37,037 INFO L168 Benchmark]: TraceAbstraction took 11433.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 130.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -6.0 MB). Peak memory consumption was 124.6 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:37,037 INFO L168 Benchmark]: Witness Printer took 281.13 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:37,041 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 542.30 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 920.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 129.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -219.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1195.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11433.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 130.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -6.0 MB). Peak memory consumption was 124.6 MB. Max. memory is 11.5 GB. * Witness Printer took 281.13 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 926]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 878]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 890]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: 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: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: 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: 127]: Loop Invariant Derived loop invariant: (!(main__t == main__tagbuf_len) && main__t <= main__tagbuf_len) && 1 <= main__t - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 853]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && 1 <= main__t) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 16 error locations. SAFE Result, 11.3s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 7.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 461 SDtfs, 3068 SDslu, 855 SDs, 0 SdLazy, 3813 SolverSat, 714 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 274 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 14 NumberOfFragments, 37 HoareAnnotationTreeSize, 6 FomulaSimplifications, 60722 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 175 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 17190 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...