java -Xmx8000000000 -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 ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 22:50:26,153 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 22:50:26,156 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 22:50:26,171 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 22:50:26,171 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 22:50:26,173 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 22:50:26,174 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 22:50:26,177 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 22:50:26,179 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 22:50:26,180 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 22:50:26,181 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 22:50:26,181 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 22:50:26,189 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 22:50:26,190 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 22:50:26,195 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 22:50:26,196 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 22:50:26,196 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 22:50:26,199 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 22:50:26,205 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 22:50:26,209 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 22:50:26,210 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 22:50:26,212 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 22:50:26,216 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 22:50:26,216 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 22:50:26,217 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 22:50:26,217 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 22:50:26,218 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 22:50:26,222 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 22:50:26,223 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 22:50:26,225 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 22:50:26,225 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 22:50:26,226 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 22:50:26,226 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 22:50:26,226 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 22:50:26,228 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 22:50:26,228 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 22:50:26,229 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 22:50:26,249 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 22:50:26,249 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 22:50:26,250 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 22:50:26,250 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 22:50:26,251 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 22:50:26,251 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 22:50:26,251 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 22:50:26,251 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 22:50:26,251 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 22:50:26,252 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 22:50:26,252 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 22:50:26,252 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 22:50:26,252 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 22:50:26,252 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 22:50:26,253 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 22:50:26,253 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 22:50:26,253 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 22:50:26,253 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 22:50:26,253 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 22:50:26,254 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:50:26,254 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 22:50:26,254 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 22:50:26,254 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 22:50:26,254 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 22:50:26,254 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 22:50:26,255 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 22:50:26,255 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 22:50:26,255 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 22:50:26,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 22:50:26,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 22:50:26,322 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 22:50:26,324 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 22:50:26,324 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 22:50:26,325 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-06 22:50:26,389 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5bfb41e7/386a6bf464c34a7c823e70545e6bd02c/FLAG3615cd7f6 [2018-11-06 22:50:26,879 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 22:50:26,880 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-06 22:50:26,890 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5bfb41e7/386a6bf464c34a7c823e70545e6bd02c/FLAG3615cd7f6 [2018-11-06 22:50:26,903 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5bfb41e7/386a6bf464c34a7c823e70545e6bd02c [2018-11-06 22:50:26,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 22:50:26,912 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 22:50:26,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 22:50:26,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 22:50:26,917 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 22:50:26,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:50:26" (1/1) ... [2018-11-06 22:50:26,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e76d110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:26, skipping insertion in model container [2018-11-06 22:50:26,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:50:26" (1/1) ... [2018-11-06 22:50:26,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 22:50:26,967 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 22:50:27,239 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:50:27,248 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 22:50:27,318 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:50:27,342 INFO L193 MainTranslator]: Completed translation [2018-11-06 22:50:27,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:27 WrapperNode [2018-11-06 22:50:27,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 22:50:27,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 22:50:27,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 22:50:27,344 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 22:50:27,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:27" (1/1) ... [2018-11-06 22:50:27,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:27" (1/1) ... [2018-11-06 22:50:27,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 22:50:27,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 22:50:27,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 22:50:27,411 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 22:50:27,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:27" (1/1) ... [2018-11-06 22:50:27,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:27" (1/1) ... [2018-11-06 22:50:27,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:27" (1/1) ... [2018-11-06 22:50:27,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:27" (1/1) ... [2018-11-06 22:50:27,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:27" (1/1) ... [2018-11-06 22:50:27,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:27" (1/1) ... [2018-11-06 22:50:27,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:27" (1/1) ... [2018-11-06 22:50:27,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 22:50:27,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 22:50:27,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 22:50:27,447 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 22:50:27,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:50:27,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 22:50:27,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 22:50:28,344 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 22:50:28,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:50:28 BoogieIcfgContainer [2018-11-06 22:50:28,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 22:50:28,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 22:50:28,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 22:50:28,349 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 22:50:28,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:50:26" (1/3) ... [2018-11-06 22:50:28,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b27438d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:50:28, skipping insertion in model container [2018-11-06 22:50:28,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:27" (2/3) ... [2018-11-06 22:50:28,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b27438d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:50:28, skipping insertion in model container [2018-11-06 22:50:28,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:50:28" (3/3) ... [2018-11-06 22:50:28,353 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-06 22:50:28,363 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 22:50:28,371 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-11-06 22:50:28,388 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-11-06 22:50:28,422 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 22:50:28,423 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 22:50:28,424 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 22:50:28,424 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 22:50:28,424 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 22:50:28,424 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 22:50:28,425 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 22:50:28,425 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 22:50:28,425 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 22:50:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-11-06 22:50:28,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-06 22:50:28,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:28,453 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:28,456 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:28,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:28,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2018-11-06 22:50:28,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:28,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:28,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:28,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:28,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:28,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:28,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:28,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:50:28,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:50:28,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:50:28,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:50:28,687 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-11-06 22:50:28,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:28,717 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2018-11-06 22:50:28,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:50:28,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-06 22:50:28,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:28,731 INFO L225 Difference]: With dead ends: 88 [2018-11-06 22:50:28,731 INFO L226 Difference]: Without dead ends: 76 [2018-11-06 22:50:28,735 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:50:28,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-06 22:50:28,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-06 22:50:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-06 22:50:28,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-11-06 22:50:28,773 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2018-11-06 22:50:28,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:28,774 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-11-06 22:50:28,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:50:28,774 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-06 22:50:28,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-06 22:50:28,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:28,775 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:28,775 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:28,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:28,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2018-11-06 22:50:28,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:28,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:28,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:28,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:28,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:28,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:28,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:28,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:50:28,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:50:28,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:50:28,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:50:28,960 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2018-11-06 22:50:29,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:29,178 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-06 22:50:29,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:50:29,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-06 22:50:29,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:29,181 INFO L225 Difference]: With dead ends: 76 [2018-11-06 22:50:29,181 INFO L226 Difference]: Without dead ends: 74 [2018-11-06 22:50:29,182 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:50:29,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-06 22:50:29,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-06 22:50:29,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-06 22:50:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-06 22:50:29,192 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2018-11-06 22:50:29,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:29,192 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-06 22:50:29,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:50:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-06 22:50:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-06 22:50:29,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:29,193 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:29,194 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:29,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:29,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2018-11-06 22:50:29,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:29,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:29,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:29,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:29,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:29,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:29,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:50:29,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:50:29,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:50:29,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:50:29,290 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-11-06 22:50:29,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:29,633 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-11-06 22:50:29,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:50:29,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-06 22:50:29,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:29,635 INFO L225 Difference]: With dead ends: 112 [2018-11-06 22:50:29,635 INFO L226 Difference]: Without dead ends: 110 [2018-11-06 22:50:29,636 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:50:29,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-06 22:50:29,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 72. [2018-11-06 22:50:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-06 22:50:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-11-06 22:50:29,644 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2018-11-06 22:50:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:29,645 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-11-06 22:50:29,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:50:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-11-06 22:50:29,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-06 22:50:29,646 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:29,646 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:29,647 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:29,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:29,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2018-11-06 22:50:29,648 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:29,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:29,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:29,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:29,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:29,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:29,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:50:29,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:50:29,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:50:29,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:50:29,875 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 6 states. [2018-11-06 22:50:30,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:30,250 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-11-06 22:50:30,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:50:30,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-06 22:50:30,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:30,252 INFO L225 Difference]: With dead ends: 72 [2018-11-06 22:50:30,252 INFO L226 Difference]: Without dead ends: 70 [2018-11-06 22:50:30,252 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:50:30,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-06 22:50:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-06 22:50:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-06 22:50:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-11-06 22:50:30,259 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2018-11-06 22:50:30,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:30,260 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-11-06 22:50:30,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:50:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-11-06 22:50:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-06 22:50:30,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:30,261 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:30,261 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:30,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:30,262 INFO L82 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2018-11-06 22:50:30,262 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:30,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:30,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:30,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:30,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:30,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:30,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:50:30,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:50:30,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:50:30,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:50:30,344 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2018-11-06 22:50:30,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:30,659 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2018-11-06 22:50:30,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:50:30,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-06 22:50:30,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:30,662 INFO L225 Difference]: With dead ends: 137 [2018-11-06 22:50:30,663 INFO L226 Difference]: Without dead ends: 135 [2018-11-06 22:50:30,664 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:50:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-06 22:50:30,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2018-11-06 22:50:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-06 22:50:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-11-06 22:50:30,673 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2018-11-06 22:50:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:30,674 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-11-06 22:50:30,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:50:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-11-06 22:50:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-06 22:50:30,675 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:30,675 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:30,676 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:30,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:30,676 INFO L82 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2018-11-06 22:50:30,677 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:30,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:30,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:30,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:30,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:30,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:30,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:50:30,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:50:30,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:50:30,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:50:30,782 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2018-11-06 22:50:31,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:31,516 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-11-06 22:50:31,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:50:31,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-06 22:50:31,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:31,518 INFO L225 Difference]: With dead ends: 104 [2018-11-06 22:50:31,518 INFO L226 Difference]: Without dead ends: 102 [2018-11-06 22:50:31,521 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:50:31,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-06 22:50:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2018-11-06 22:50:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-06 22:50:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-11-06 22:50:31,537 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2018-11-06 22:50:31,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:31,538 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-06 22:50:31,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:50:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-06 22:50:31,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-06 22:50:31,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:31,540 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:31,541 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:31,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:31,541 INFO L82 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2018-11-06 22:50:31,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:31,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:31,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:31,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:31,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:31,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:31,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:50:31,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:50:31,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:50:31,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:50:31,650 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2018-11-06 22:50:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:31,788 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-11-06 22:50:31,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:50:31,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-06 22:50:31,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:31,791 INFO L225 Difference]: With dead ends: 117 [2018-11-06 22:50:31,793 INFO L226 Difference]: Without dead ends: 115 [2018-11-06 22:50:31,793 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:50:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-06 22:50:31,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2018-11-06 22:50:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-06 22:50:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-11-06 22:50:31,801 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2018-11-06 22:50:31,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:31,801 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-11-06 22:50:31,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:50:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-11-06 22:50:31,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-06 22:50:31,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:31,803 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:31,803 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:31,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:31,804 INFO L82 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2018-11-06 22:50:31,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:31,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:31,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:31,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:31,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:32,000 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-06 22:50:32,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:32,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:32,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:50:32,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:50:32,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:50:32,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:50:32,017 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2018-11-06 22:50:32,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:32,143 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-11-06 22:50:32,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 22:50:32,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-06 22:50:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:32,147 INFO L225 Difference]: With dead ends: 73 [2018-11-06 22:50:32,147 INFO L226 Difference]: Without dead ends: 71 [2018-11-06 22:50:32,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:50:32,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-06 22:50:32,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-06 22:50:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-06 22:50:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-11-06 22:50:32,155 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2018-11-06 22:50:32,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:32,155 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-11-06 22:50:32,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:50:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-11-06 22:50:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-06 22:50:32,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:32,157 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:32,157 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:32,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:32,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2018-11-06 22:50:32,158 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:32,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:32,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:32,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:32,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:32,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:32,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:50:32,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:50:32,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:50:32,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:50:32,205 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 3 states. [2018-11-06 22:50:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:32,275 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-11-06 22:50:32,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:50:32,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-06 22:50:32,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:32,277 INFO L225 Difference]: With dead ends: 111 [2018-11-06 22:50:32,277 INFO L226 Difference]: Without dead ends: 71 [2018-11-06 22:50:32,277 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:50:32,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-06 22:50:32,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-06 22:50:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-06 22:50:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-11-06 22:50:32,284 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2018-11-06 22:50:32,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:32,284 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-11-06 22:50:32,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:50:32,284 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-11-06 22:50:32,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-06 22:50:32,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:32,285 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:32,286 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:32,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:32,287 INFO L82 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2018-11-06 22:50:32,287 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:32,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:32,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:32,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:32,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-06 22:50:32,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:50:32,427 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:50:32,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:32,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:50:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-06 22:50:32,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:50:32,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-06 22:50:32,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 22:50:32,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 22:50:32,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:50:32,584 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 9 states. [2018-11-06 22:50:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:32,869 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-11-06 22:50:32,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:50:32,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-06 22:50:32,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:32,871 INFO L225 Difference]: With dead ends: 111 [2018-11-06 22:50:32,871 INFO L226 Difference]: Without dead ends: 109 [2018-11-06 22:50:32,872 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-11-06 22:50:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-06 22:50:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2018-11-06 22:50:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-06 22:50:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-11-06 22:50:32,878 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2018-11-06 22:50:32,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:32,879 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-11-06 22:50:32,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 22:50:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-06 22:50:32,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-06 22:50:32,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:32,880 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:32,881 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:32,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:32,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2018-11-06 22:50:32,881 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:32,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:32,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:32,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:32,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:32,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:32,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:32,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-06 22:50:32,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 22:50:32,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 22:50:32,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:50:32,999 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 7 states. [2018-11-06 22:50:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:33,212 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-06 22:50:33,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:50:33,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-06 22:50:33,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:33,213 INFO L225 Difference]: With dead ends: 69 [2018-11-06 22:50:33,213 INFO L226 Difference]: Without dead ends: 67 [2018-11-06 22:50:33,214 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:50:33,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-06 22:50:33,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-06 22:50:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-06 22:50:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-11-06 22:50:33,221 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2018-11-06 22:50:33,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:33,221 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-11-06 22:50:33,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 22:50:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-11-06 22:50:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-06 22:50:33,222 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:33,224 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:33,224 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:33,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:33,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2018-11-06 22:50:33,225 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:33,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:33,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:33,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:33,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-06 22:50:33,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:50:33,329 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:50:33,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:33,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:50:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-06 22:50:33,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:50:33,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-06 22:50:33,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 22:50:33,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 22:50:33,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:50:33,528 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 9 states. [2018-11-06 22:50:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:33,647 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-06 22:50:33,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:50:33,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-11-06 22:50:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:33,649 INFO L225 Difference]: With dead ends: 67 [2018-11-06 22:50:33,649 INFO L226 Difference]: Without dead ends: 65 [2018-11-06 22:50:33,649 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-11-06 22:50:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-06 22:50:33,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-11-06 22:50:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-06 22:50:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-06 22:50:33,654 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2018-11-06 22:50:33,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:33,655 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-06 22:50:33,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 22:50:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-06 22:50:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-06 22:50:33,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:33,656 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:33,657 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:33,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:33,657 INFO L82 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2018-11-06 22:50:33,657 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:33,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:33,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:33,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:33,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:33,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:33,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:50:33,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:50:33,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:50:33,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:50:33,768 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 6 states. [2018-11-06 22:50:33,883 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-06 22:50:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:33,970 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-06 22:50:33,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:50:33,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-06 22:50:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:33,972 INFO L225 Difference]: With dead ends: 60 [2018-11-06 22:50:33,972 INFO L226 Difference]: Without dead ends: 58 [2018-11-06 22:50:33,973 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:50:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-06 22:50:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-06 22:50:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-06 22:50:33,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-06 22:50:33,978 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2018-11-06 22:50:33,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:33,979 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-06 22:50:33,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:50:33,979 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-06 22:50:33,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-06 22:50:33,980 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:33,980 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:33,981 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:33,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:33,981 INFO L82 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2018-11-06 22:50:33,981 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:33,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:33,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:33,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:33,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:34,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:34,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-06 22:50:34,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 22:50:34,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 22:50:34,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:50:34,079 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 7 states. [2018-11-06 22:50:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:34,332 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-06 22:50:34,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:50:34,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-06 22:50:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:34,333 INFO L225 Difference]: With dead ends: 59 [2018-11-06 22:50:34,333 INFO L226 Difference]: Without dead ends: 57 [2018-11-06 22:50:34,334 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:50:34,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-06 22:50:34,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-06 22:50:34,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-06 22:50:34,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-06 22:50:34,339 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2018-11-06 22:50:34,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:34,340 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-06 22:50:34,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 22:50:34,340 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-06 22:50:34,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-06 22:50:34,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:34,341 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:34,342 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:34,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:34,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2018-11-06 22:50:34,342 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:34,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:34,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:34,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:34,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:34,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:34,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:34,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-06 22:50:34,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 22:50:34,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 22:50:34,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-06 22:50:34,676 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 7 states. [2018-11-06 22:50:35,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:35,002 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-06 22:50:35,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:50:35,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-06 22:50:35,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:35,004 INFO L225 Difference]: With dead ends: 67 [2018-11-06 22:50:35,004 INFO L226 Difference]: Without dead ends: 65 [2018-11-06 22:50:35,005 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-06 22:50:35,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-06 22:50:35,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2018-11-06 22:50:35,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-06 22:50:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-11-06 22:50:35,010 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2018-11-06 22:50:35,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:35,010 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-11-06 22:50:35,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 22:50:35,010 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-06 22:50:35,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-06 22:50:35,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:35,011 INFO L375 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] [2018-11-06 22:50:35,012 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:35,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:35,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2018-11-06 22:50:35,012 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:35,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:35,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:35,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:35,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:35,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:35,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:35,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:50:35,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:50:35,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:50:35,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:50:35,107 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 6 states. [2018-11-06 22:50:35,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:35,286 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-06 22:50:35,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:50:35,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-06 22:50:35,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:35,287 INFO L225 Difference]: With dead ends: 87 [2018-11-06 22:50:35,287 INFO L226 Difference]: Without dead ends: 85 [2018-11-06 22:50:35,288 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-06 22:50:35,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-06 22:50:35,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2018-11-06 22:50:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-06 22:50:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-11-06 22:50:35,293 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2018-11-06 22:50:35,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:35,294 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-11-06 22:50:35,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:50:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-06 22:50:35,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-06 22:50:35,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:35,295 INFO L375 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] [2018-11-06 22:50:35,295 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:35,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:35,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2018-11-06 22:50:35,296 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:35,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:35,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:35,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:35,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:35,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:35,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:50:35,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:50:35,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:50:35,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:50:35,749 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 6 states. [2018-11-06 22:50:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:36,112 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-06 22:50:36,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:50:36,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-11-06 22:50:36,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:36,113 INFO L225 Difference]: With dead ends: 57 [2018-11-06 22:50:36,113 INFO L226 Difference]: Without dead ends: 55 [2018-11-06 22:50:36,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:50:36,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-06 22:50:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-06 22:50:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-06 22:50:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-06 22:50:36,120 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2018-11-06 22:50:36,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:36,120 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-06 22:50:36,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:50:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-06 22:50:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-06 22:50:36,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:36,121 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:36,122 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:36,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:36,122 INFO L82 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2018-11-06 22:50:36,122 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:36,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:36,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:36,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:36,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:36,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:36,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:50:36,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:50:36,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:50:36,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:50:36,443 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2018-11-06 22:50:36,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:36,636 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-11-06 22:50:36,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:50:36,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-06 22:50:36,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:36,637 INFO L225 Difference]: With dead ends: 66 [2018-11-06 22:50:36,637 INFO L226 Difference]: Without dead ends: 64 [2018-11-06 22:50:36,638 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:50:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-06 22:50:36,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2018-11-06 22:50:36,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-06 22:50:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-11-06 22:50:36,643 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2018-11-06 22:50:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:36,643 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-11-06 22:50:36,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:50:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-11-06 22:50:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-06 22:50:36,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:36,644 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:36,645 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:36,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:36,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2018-11-06 22:50:36,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:36,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:36,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:36,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:36,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:36,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:36,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:50:36,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:50:36,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:50:36,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:50:36,798 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 6 states. [2018-11-06 22:50:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:37,055 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-11-06 22:50:37,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:50:37,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-11-06 22:50:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:37,056 INFO L225 Difference]: With dead ends: 62 [2018-11-06 22:50:37,056 INFO L226 Difference]: Without dead ends: 60 [2018-11-06 22:50:37,056 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:50:37,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-06 22:50:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2018-11-06 22:50:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-06 22:50:37,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-11-06 22:50:37,062 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2018-11-06 22:50:37,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:37,063 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-11-06 22:50:37,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:50:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-06 22:50:37,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-06 22:50:37,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:37,064 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:37,064 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:37,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:37,065 INFO L82 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2018-11-06 22:50:37,065 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:37,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:37,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:37,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:37,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:37,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:37,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:50:37,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:50:37,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:50:37,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:50:37,177 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 6 states. [2018-11-06 22:50:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:37,319 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-06 22:50:37,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 22:50:37,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-06 22:50:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:37,320 INFO L225 Difference]: With dead ends: 84 [2018-11-06 22:50:37,320 INFO L226 Difference]: Without dead ends: 82 [2018-11-06 22:50:37,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-06 22:50:37,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-06 22:50:37,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2018-11-06 22:50:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-06 22:50:37,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-06 22:50:37,327 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2018-11-06 22:50:37,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:37,327 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-06 22:50:37,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:50:37,327 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-06 22:50:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-06 22:50:37,328 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:37,328 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:37,329 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:37,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:37,329 INFO L82 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2018-11-06 22:50:37,329 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:37,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:37,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:37,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:37,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:37,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:37,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:37,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 22:50:37,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 22:50:37,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 22:50:37,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-06 22:50:37,415 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 6 states. [2018-11-06 22:50:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:37,599 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-06 22:50:37,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:50:37,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-06 22:50:37,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:37,600 INFO L225 Difference]: With dead ends: 69 [2018-11-06 22:50:37,601 INFO L226 Difference]: Without dead ends: 67 [2018-11-06 22:50:37,601 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:50:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-06 22:50:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2018-11-06 22:50:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-06 22:50:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-11-06 22:50:37,607 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2018-11-06 22:50:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:37,607 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-11-06 22:50:37,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 22:50:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-11-06 22:50:37,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-06 22:50:37,608 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:37,608 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:37,609 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:37,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:37,609 INFO L82 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2018-11-06 22:50:37,610 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:37,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:37,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:37,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:37,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-06 22:50:37,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 22:50:37,779 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 22:50:37,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:37,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 22:50:37,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:50:37,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 22:50:37,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-06 22:50:37,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 22:50:37,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 22:50:37,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-06 22:50:37,950 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 9 states. [2018-11-06 22:50:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:38,121 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-06 22:50:38,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 22:50:38,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-11-06 22:50:38,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:38,124 INFO L225 Difference]: With dead ends: 54 [2018-11-06 22:50:38,125 INFO L226 Difference]: Without dead ends: 52 [2018-11-06 22:50:38,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-11-06 22:50:38,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-06 22:50:38,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-06 22:50:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-06 22:50:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-06 22:50:38,131 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2018-11-06 22:50:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:38,131 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-06 22:50:38,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 22:50:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-06 22:50:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-06 22:50:38,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:50:38,133 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:50:38,133 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:50:38,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:50:38,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2018-11-06 22:50:38,134 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:50:38,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:50:38,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:38,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:50:38,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:50:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:50:38,331 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-06 22:50:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-06 22:50:38,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:50:38,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 22:50:38,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 22:50:38,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 22:50:38,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-06 22:50:38,445 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-11-06 22:50:38,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:50:38,623 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-11-06 22:50:38,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 22:50:38,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-06 22:50:38,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:50:38,624 INFO L225 Difference]: With dead ends: 71 [2018-11-06 22:50:38,624 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 22:50:38,625 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-06 22:50:38,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 22:50:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 22:50:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 22:50:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 22:50:38,627 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-11-06 22:50:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:50:38,627 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 22:50:38,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 22:50:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 22:50:38,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 22:50:38,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 22:50:38,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 22:50:38,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 22:50:39,961 WARN L179 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2018-11-06 22:50:40,337 WARN L179 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2018-11-06 22:50:40,615 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2018-11-06 22:50:41,219 WARN L179 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 72 [2018-11-06 22:50:41,274 INFO L425 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2018-11-06 22:50:41,274 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-06 22:50:41,274 INFO L425 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2018-11-06 22:50:41,274 INFO L425 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2018-11-06 22:50:41,274 INFO L425 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2018-11-06 22:50:41,274 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 22:50:41,274 INFO L425 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-06 22:50:41,275 INFO L425 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2018-11-06 22:50:41,275 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2018-11-06 22:50:41,275 INFO L425 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2018-11-06 22:50:41,275 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2018-11-06 22:50:41,275 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-06 22:50:41,275 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2018-11-06 22:50:41,275 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2018-11-06 22:50:41,275 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2018-11-06 22:50:41,276 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-06 22:50:41,276 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2018-11-06 22:50:41,276 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2018-11-06 22:50:41,276 INFO L425 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2018-11-06 22:50:41,276 INFO L425 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2018-11-06 22:50:41,276 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2018-11-06 22:50:41,276 INFO L425 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2018-11-06 22:50:41,276 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2018-11-06 22:50:41,276 INFO L425 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2018-11-06 22:50:41,277 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-06 22:50:41,277 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2018-11-06 22:50:41,277 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2018-11-06 22:50:41,277 INFO L421 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (let ((.cse0 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 0)) .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~16) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))))) (<= 1 ULTIMATE.start_main_~main__cp~0) (<= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) [2018-11-06 22:50:41,277 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2018-11-06 22:50:41,277 INFO L425 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2018-11-06 22:50:41,278 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2018-11-06 22:50:41,278 INFO L425 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-06 22:50:41,278 INFO L421 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10) (let ((.cse0 (let ((.cse1 (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0)) (<= 2 ULTIMATE.start_main_~main__cp~0) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0)) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) (< 0 ULTIMATE.start_main_~main__scheme~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0)) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0) (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 0)))) (.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse1 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse2) (and .cse1 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse2))))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) .cse0 (<= 1 ULTIMATE.start_main_~main__c~0)) (and .cse0 (= ULTIMATE.start_main_~main__c~0 0))))) [2018-11-06 22:50:41,278 INFO L425 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2018-11-06 22:50:41,278 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 22:50:41,278 INFO L425 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2018-11-06 22:50:41,279 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2018-11-06 22:50:41,279 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2018-11-06 22:50:41,279 INFO L425 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2018-11-06 22:50:41,279 INFO L421 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) [2018-11-06 22:50:41,279 INFO L425 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2018-11-06 22:50:41,279 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-11-06 22:50:41,279 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2018-11-06 22:50:41,279 INFO L425 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2018-11-06 22:50:41,279 INFO L425 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-11-06 22:50:41,280 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2018-11-06 22:50:41,280 INFO L425 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2018-11-06 22:50:41,280 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2018-11-06 22:50:41,280 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-06 22:50:41,280 INFO L425 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-11-06 22:50:41,280 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 22:50:41,280 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2018-11-06 22:50:41,280 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2018-11-06 22:50:41,281 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2018-11-06 22:50:41,281 INFO L421 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse7 (+ ULTIMATE.start_main_~main__cp~0 1))) (let ((.cse2 (<= 2 ULTIMATE.start_main_~main__cp~0)) (.cse5 (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0)) (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0)) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0)) (and (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) (<= 1 ULTIMATE.start_main_~main__cp~0) (< 0 ULTIMATE.start_main_~main__scheme~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3) (<= .cse7 ULTIMATE.start_main_~main__urilen~0)))))) (.cse1 (= ULTIMATE.start_main_~main__c~0 0)) (.cse6 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 0)))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10) (let ((.cse0 (let ((.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 0)))) (or (and (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse2 .cse3 .cse4 .cse5 .cse6))))) (or (and .cse0 .cse1) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) .cse0 (<= 1 ULTIMATE.start_main_~main__c~0))))) (and .cse2 .cse5 .cse1 (< .cse7 ULTIMATE.start_main_~main__urilen~0) .cse6)))) [2018-11-06 22:50:41,281 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2018-11-06 22:50:41,281 INFO L428 ceAbstractionStarter]: At program point L426(lines 8 434) the Hoare annotation is: true [2018-11-06 22:50:41,281 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2018-11-06 22:50:41,281 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2018-11-06 22:50:41,282 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2018-11-06 22:50:41,282 INFO L425 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-06 22:50:41,282 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2018-11-06 22:50:41,282 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2018-11-06 22:50:41,282 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-11-06 22:50:41,282 INFO L425 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2018-11-06 22:50:41,282 INFO L425 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2018-11-06 22:50:41,282 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2018-11-06 22:50:41,282 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2018-11-06 22:50:41,283 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 22:50:41,283 INFO L425 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2018-11-06 22:50:41,283 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2018-11-06 22:50:41,283 INFO L421 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0) (let ((.cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1)) (.cse1 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse2 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse3 (< 0 ULTIMATE.start_main_~main__scheme~0))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))))) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) [2018-11-06 22:50:41,283 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2018-11-06 22:50:41,283 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2018-11-06 22:50:41,283 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2018-11-06 22:50:41,283 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2018-11-06 22:50:41,284 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2018-11-06 22:50:41,284 INFO L425 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2018-11-06 22:50:41,284 INFO L425 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2018-11-06 22:50:41,284 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2018-11-06 22:50:41,284 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2018-11-06 22:50:41,284 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2018-11-06 22:50:41,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:50:41 BoogieIcfgContainer [2018-11-06 22:50:41,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 22:50:41,326 INFO L168 Benchmark]: Toolchain (without parser) took 14414.40 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 866.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -623.7 MB). Peak memory consumption was 242.9 MB. Max. memory is 7.1 GB. [2018-11-06 22:50:41,327 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:50:41,328 INFO L168 Benchmark]: CACSL2BoogieTranslator took 430.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-06 22:50:41,328 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:50:41,330 INFO L168 Benchmark]: Boogie Preprocessor took 36.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-06 22:50:41,330 INFO L168 Benchmark]: RCFGBuilder took 898.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2018-11-06 22:50:41,331 INFO L168 Benchmark]: TraceAbstraction took 12977.06 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 121.6 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 143.5 MB). Peak memory consumption was 265.2 MB. Max. memory is 7.1 GB. [2018-11-06 22:50:41,343 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 430.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 898.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12977.06 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 121.6 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 143.5 MB). Peak memory consumption was 265.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: 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: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: 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: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 == __VERIFIER_assert__cond) || (((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0))) && 1 <= main__cp) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: 1 == __VERIFIER_assert__cond && (((!(__VERIFIER_assert__cond == 0) && ((((((((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 2 <= main__cp) && (!(__VERIFIER_assert__cond == 0) && (!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) || (((((((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 2 <= main__cp) && (!(__VERIFIER_assert__cond == 0) && (!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && 1 <= main__c) || (((((((((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 2 <= main__cp) && (!(__VERIFIER_assert__cond == 0) && (!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) || (((((((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 2 <= main__cp) && (!(__VERIFIER_assert__cond == 0) && (!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0)) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (main__cp < main__urilen && (((((1 == __VERIFIER_assert__cond && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) || (((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && 1 == __VERIFIER_assert__cond - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (1 == __VERIFIER_assert__cond && ((((((((main__c + 2 <= main__tokenlen && 2 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 2 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0))) && main__c == 0) || ((!(__VERIFIER_assert__cond == 0) && ((((((main__c + 2 <= main__tokenlen && 2 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 2 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0)))) && 1 <= main__c))) || ((((2 <= main__cp && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && main__c == 0) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: __VERIFIER_assert__cond == 1 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. SAFE Result, 12.8s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1246 SDtfs, 2836 SDslu, 1555 SDs, 0 SdLazy, 1119 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 151 SyntacticMatches, 4 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred 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, 23 MinimizatonAttempts, 315 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 742 HoareAnnotationTreeSize, 6 FomulaSimplifications, 239048 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 147118 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 725 ConstructedInterpolants, 0 QuantifiedInterpolants, 48258 SizeOfPredicates, 21 NumberOfNonLiveVariables, 293 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 10/21 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...