java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:57:59,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:57:59,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:58:00,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:58:00,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:58:00,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:58:00,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:58:00,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:58:00,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:58:00,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:58:00,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:58:00,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:58:00,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:58:00,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:58:00,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:58:00,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:58:00,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:58:00,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:58:00,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:58:00,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:58:00,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:58:00,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:58:00,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:58:00,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:58:00,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:58:00,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:58:00,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:58:00,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:58:00,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:58:00,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:58:00,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:58:00,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:58:00,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:58:00,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:58:00,059 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:58:00,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:58:00,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:58:00,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:58:00,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:58:00,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:58:00,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:58:00,062 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 12:58:00,083 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:58:00,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:58:00,086 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:58:00,086 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:58:00,087 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:58:00,087 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:58:00,088 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:58:00,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:58:00,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:58:00,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:58:00,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:58:00,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:58:00,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:58:00,089 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:58:00,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:58:00,090 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:58:00,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:58:00,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:58:00,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:58:00,092 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:58:00,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:58:00,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:58:00,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:58:00,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:58:00,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:58:00,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:58:00,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:58:00,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:58:00,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:58:00,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:58:00,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:58:00,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:58:00,151 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:58:00,151 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:58:00,152 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-09-20 12:58:00,225 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/132257162/99e6e4de7172442fa14931e90e2b3f34/FLAG685b678b4 [2019-09-20 12:58:00,703 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:58:00,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-09-20 12:58:00,723 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/132257162/99e6e4de7172442fa14931e90e2b3f34/FLAG685b678b4 [2019-09-20 12:58:01,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/132257162/99e6e4de7172442fa14931e90e2b3f34 [2019-09-20 12:58:01,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:58:01,076 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:58:01,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:58:01,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:58:01,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:58:01,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:58:01" (1/1) ... [2019-09-20 12:58:01,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d4ba398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:01, skipping insertion in model container [2019-09-20 12:58:01,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:58:01" (1/1) ... [2019-09-20 12:58:01,091 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:58:01,132 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:58:01,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:58:01,365 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:58:01,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:58:01,531 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:58:01,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:01 WrapperNode [2019-09-20 12:58:01,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:58:01,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:58:01,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:58:01,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:58:01,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:01" (1/1) ... [2019-09-20 12:58:01,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:01" (1/1) ... [2019-09-20 12:58:01,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:01" (1/1) ... [2019-09-20 12:58:01,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:01" (1/1) ... [2019-09-20 12:58:01,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:01" (1/1) ... [2019-09-20 12:58:01,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:01" (1/1) ... [2019-09-20 12:58:01,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:01" (1/1) ... [2019-09-20 12:58:01,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:58:01,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:58:01,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:58:01,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:58:01,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:58:01,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:58:01,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:58:01,619 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:58:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:58:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 12:58:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 12:58:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 12:58:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:58:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:58:01,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:58:02,048 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:58:02,049 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-20 12:58:02,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:58:02 BoogieIcfgContainer [2019-09-20 12:58:02,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:58:02,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:58:02,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:58:02,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:58:02,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:58:01" (1/3) ... [2019-09-20 12:58:02,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260968d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:58:02, skipping insertion in model container [2019-09-20 12:58:02,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:01" (2/3) ... [2019-09-20 12:58:02,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260968d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:58:02, skipping insertion in model container [2019-09-20 12:58:02,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:58:02" (3/3) ... [2019-09-20 12:58:02,058 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-09-20 12:58:02,068 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:58:02,077 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-09-20 12:58:02,095 INFO L252 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-09-20 12:58:02,124 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:58:02,125 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:58:02,125 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:58:02,125 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:58:02,125 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:58:02,125 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:58:02,126 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:58:02,126 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:58:02,126 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:58:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-09-20 12:58:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 12:58:02,151 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:02,152 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:02,154 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:02,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:02,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2019-09-20 12:58:02,161 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:02,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:02,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:02,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:02,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:02,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:02,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:58:02,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:58:02,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:58:02,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:58:02,360 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2019-09-20 12:58:02,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:02,424 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2019-09-20 12:58:02,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:58:02,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 12:58:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:02,441 INFO L225 Difference]: With dead ends: 93 [2019-09-20 12:58:02,441 INFO L226 Difference]: Without dead ends: 80 [2019-09-20 12:58:02,448 INFO L636 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 [2019-09-20 12:58:02,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-20 12:58:02,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-20 12:58:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-20 12:58:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-09-20 12:58:02,525 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2019-09-20 12:58:02,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:02,526 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-09-20 12:58:02,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:58:02,527 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-09-20 12:58:02,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:58:02,528 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:02,529 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:02,530 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:02,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:02,532 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2019-09-20 12:58:02,533 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:02,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:02,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:02,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:02,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:02,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:02,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:58:02,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:58:02,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:58:02,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:02,707 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2019-09-20 12:58:02,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:02,804 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2019-09-20 12:58:02,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:02,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-20 12:58:02,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:02,806 INFO L225 Difference]: With dead ends: 80 [2019-09-20 12:58:02,807 INFO L226 Difference]: Without dead ends: 78 [2019-09-20 12:58:02,808 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:02,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-20 12:58:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-20 12:58:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-20 12:58:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-09-20 12:58:02,817 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2019-09-20 12:58:02,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:02,818 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-09-20 12:58:02,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:58:02,818 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-09-20 12:58:02,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 12:58:02,819 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:02,819 INFO L407 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] [2019-09-20 12:58:02,820 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:02,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:02,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2019-09-20 12:58:02,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:02,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:02,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:02,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:02,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:02,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:02,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:58:02,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:58:02,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:58:02,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:58:02,884 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 4 states. [2019-09-20 12:58:02,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:02,972 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2019-09-20 12:58:02,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:58:02,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-20 12:58:02,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:02,974 INFO L225 Difference]: With dead ends: 101 [2019-09-20 12:58:02,974 INFO L226 Difference]: Without dead ends: 99 [2019-09-20 12:58:02,975 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-20 12:58:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2019-09-20 12:58:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-20 12:58:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-09-20 12:58:02,990 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2019-09-20 12:58:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:02,991 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-09-20 12:58:02,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:58:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-09-20 12:58:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 12:58:02,994 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:02,994 INFO L407 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] [2019-09-20 12:58:02,995 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:02,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:02,996 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2019-09-20 12:58:02,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:02,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:03,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:03,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:03,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:03,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:03,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:03,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:03,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:03,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:03,103 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 5 states. [2019-09-20 12:58:03,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:03,201 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-09-20 12:58:03,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:58:03,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-09-20 12:58:03,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:03,203 INFO L225 Difference]: With dead ends: 76 [2019-09-20 12:58:03,203 INFO L226 Difference]: Without dead ends: 74 [2019-09-20 12:58:03,204 INFO L636 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 [2019-09-20 12:58:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-20 12:58:03,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-09-20 12:58:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-20 12:58:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-09-20 12:58:03,226 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2019-09-20 12:58:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:03,226 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-09-20 12:58:03,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-09-20 12:58:03,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 12:58:03,228 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:03,228 INFO L407 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] [2019-09-20 12:58:03,228 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:03,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:03,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2019-09-20 12:58:03,229 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:03,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:03,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:03,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:03,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:03,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:03,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:03,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:03,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:03,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:03,301 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2019-09-20 12:58:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:03,493 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2019-09-20 12:58:03,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 12:58:03,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-09-20 12:58:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:03,496 INFO L225 Difference]: With dead ends: 141 [2019-09-20 12:58:03,496 INFO L226 Difference]: Without dead ends: 139 [2019-09-20 12:58:03,497 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:03,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-20 12:58:03,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2019-09-20 12:58:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-20 12:58:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-09-20 12:58:03,517 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2019-09-20 12:58:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:03,518 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-09-20 12:58:03,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:03,518 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-09-20 12:58:03,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 12:58:03,520 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:03,520 INFO L407 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] [2019-09-20 12:58:03,521 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:03,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:03,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2019-09-20 12:58:03,521 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:03,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:03,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:03,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:03,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:03,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:03,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:03,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:03,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:03,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:03,609 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-09-20 12:58:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:03,739 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-09-20 12:58:03,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 12:58:03,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-09-20 12:58:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:03,741 INFO L225 Difference]: With dead ends: 108 [2019-09-20 12:58:03,741 INFO L226 Difference]: Without dead ends: 106 [2019-09-20 12:58:03,742 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:03,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-20 12:58:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2019-09-20 12:58:03,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-20 12:58:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-09-20 12:58:03,750 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2019-09-20 12:58:03,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:03,750 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-09-20 12:58:03,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-09-20 12:58:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 12:58:03,751 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:03,752 INFO L407 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] [2019-09-20 12:58:03,752 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:03,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:03,753 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2019-09-20 12:58:03,753 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:03,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:03,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:03,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:03,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:03,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:03,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:03,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:03,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:03,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:03,825 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2019-09-20 12:58:03,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:03,958 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-09-20 12:58:03,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:58:03,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-20 12:58:03,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:03,961 INFO L225 Difference]: With dead ends: 121 [2019-09-20 12:58:03,961 INFO L226 Difference]: Without dead ends: 119 [2019-09-20 12:58:03,964 INFO L636 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 [2019-09-20 12:58:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-20 12:58:03,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2019-09-20 12:58:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-20 12:58:03,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-09-20 12:58:03,978 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2019-09-20 12:58:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:03,978 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-09-20 12:58:03,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:03,978 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-09-20 12:58:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 12:58:03,979 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:03,979 INFO L407 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] [2019-09-20 12:58:03,980 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:03,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:03,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2019-09-20 12:58:03,982 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:03,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:03,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:03,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:03,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:04,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:04,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:04,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:04,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:04,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:04,070 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-09-20 12:58:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:04,168 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-09-20 12:58:04,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:58:04,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-20 12:58:04,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:04,170 INFO L225 Difference]: With dead ends: 77 [2019-09-20 12:58:04,170 INFO L226 Difference]: Without dead ends: 75 [2019-09-20 12:58:04,171 INFO L636 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 [2019-09-20 12:58:04,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-20 12:58:04,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-20 12:58:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-20 12:58:04,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-09-20 12:58:04,185 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2019-09-20 12:58:04,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:04,185 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-09-20 12:58:04,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:04,186 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-09-20 12:58:04,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 12:58:04,187 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:04,187 INFO L407 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] [2019-09-20 12:58:04,188 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:04,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:04,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2019-09-20 12:58:04,189 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:04,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:04,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:04,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:04,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:04,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:04,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:58:04,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:58:04,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:58:04,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:58:04,245 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 3 states. [2019-09-20 12:58:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:04,288 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2019-09-20 12:58:04,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:58:04,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 12:58:04,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:04,290 INFO L225 Difference]: With dead ends: 115 [2019-09-20 12:58:04,290 INFO L226 Difference]: Without dead ends: 75 [2019-09-20 12:58:04,291 INFO L636 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 [2019-09-20 12:58:04,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-20 12:58:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-20 12:58:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-20 12:58:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-09-20 12:58:04,297 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2019-09-20 12:58:04,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:04,297 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-09-20 12:58:04,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:58:04,298 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-09-20 12:58:04,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 12:58:04,299 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:04,299 INFO L407 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] [2019-09-20 12:58:04,300 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:04,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:04,300 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2019-09-20 12:58:04,300 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:04,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:04,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:04,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:04,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:04,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:04,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:04,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:04,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:04,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:04,360 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 5 states. [2019-09-20 12:58:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:04,434 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-09-20 12:58:04,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:04,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-09-20 12:58:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:04,435 INFO L225 Difference]: With dead ends: 76 [2019-09-20 12:58:04,435 INFO L226 Difference]: Without dead ends: 74 [2019-09-20 12:58:04,436 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:58:04,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-20 12:58:04,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-20 12:58:04,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-20 12:58:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-09-20 12:58:04,441 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2019-09-20 12:58:04,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:04,442 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-09-20 12:58:04,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-09-20 12:58:04,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 12:58:04,443 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:04,443 INFO L407 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] [2019-09-20 12:58:04,444 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:04,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:04,444 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2019-09-20 12:58:04,444 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:04,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:04,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:04,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:04,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:58:04,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:04,539 INFO L224 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) [2019-09-20 12:58:04,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:04,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-20 12:58:04,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:04,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:58:04,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:04,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-09-20 12:58:04,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 12:58:04,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 12:58:04,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:04,704 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 8 states. [2019-09-20 12:58:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:04,862 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-09-20 12:58:04,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:04,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-09-20 12:58:04,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:04,863 INFO L225 Difference]: With dead ends: 111 [2019-09-20 12:58:04,864 INFO L226 Difference]: Without dead ends: 109 [2019-09-20 12:58:04,865 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:58:04,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-20 12:58:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2019-09-20 12:58:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-20 12:58:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-09-20 12:58:04,875 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2019-09-20 12:58:04,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:04,875 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-09-20 12:58:04,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 12:58:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-09-20 12:58:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 12:58:04,880 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:04,880 INFO L407 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] [2019-09-20 12:58:04,880 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:04,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2019-09-20 12:58:04,881 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:04,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:04,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:04,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:04,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:04,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:04,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:04,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:04,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:04,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:04,937 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2019-09-20 12:58:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:05,015 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-09-20 12:58:05,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:58:05,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-09-20 12:58:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:05,017 INFO L225 Difference]: With dead ends: 70 [2019-09-20 12:58:05,017 INFO L226 Difference]: Without dead ends: 68 [2019-09-20 12:58:05,018 INFO L636 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 [2019-09-20 12:58:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-20 12:58:05,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-09-20 12:58:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-20 12:58:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-09-20 12:58:05,027 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2019-09-20 12:58:05,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:05,029 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-09-20 12:58:05,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-09-20 12:58:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 12:58:05,035 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:05,035 INFO L407 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, 1, 1, 1, 1] [2019-09-20 12:58:05,038 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:05,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:05,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2019-09-20 12:58:05,038 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:05,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:05,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:05,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:05,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:58:05,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:05,127 INFO L224 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) [2019-09-20 12:58:05,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:05,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-20 12:58:05,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:05,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:58:05,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:05,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-09-20 12:58:05,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 12:58:05,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 12:58:05,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:05,224 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 8 states. [2019-09-20 12:58:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:05,320 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-09-20 12:58:05,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:05,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-09-20 12:58:05,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:05,322 INFO L225 Difference]: With dead ends: 69 [2019-09-20 12:58:05,322 INFO L226 Difference]: Without dead ends: 67 [2019-09-20 12:58:05,322 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:58:05,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-20 12:58:05,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-09-20 12:58:05,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-20 12:58:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-09-20 12:58:05,326 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2019-09-20 12:58:05,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:05,327 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-09-20 12:58:05,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 12:58:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-09-20 12:58:05,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 12:58:05,328 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:05,328 INFO L407 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] [2019-09-20 12:58:05,329 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:05,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:05,329 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2019-09-20 12:58:05,329 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:05,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:05,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:05,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:05,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:05,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:05,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:05,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:05,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:05,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:05,388 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 5 states. [2019-09-20 12:58:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:05,458 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-09-20 12:58:05,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:05,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-09-20 12:58:05,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:05,459 INFO L225 Difference]: With dead ends: 63 [2019-09-20 12:58:05,460 INFO L226 Difference]: Without dead ends: 61 [2019-09-20 12:58:05,460 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:58:05,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-20 12:58:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-09-20 12:58:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-20 12:58:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-09-20 12:58:05,465 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2019-09-20 12:58:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:05,465 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-09-20 12:58:05,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-09-20 12:58:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 12:58:05,466 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:05,466 INFO L407 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] [2019-09-20 12:58:05,467 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:05,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:05,467 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2019-09-20 12:58:05,468 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:05,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:05,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:05,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:05,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:05,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:05,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 12:58:05,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:58:05,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:58:05,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:58:05,537 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2019-09-20 12:58:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:05,627 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2019-09-20 12:58:05,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 12:58:05,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-09-20 12:58:05,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:05,628 INFO L225 Difference]: With dead ends: 71 [2019-09-20 12:58:05,629 INFO L226 Difference]: Without dead ends: 69 [2019-09-20 12:58:05,629 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:58:05,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-20 12:58:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-09-20 12:58:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-20 12:58:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-09-20 12:58:05,636 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2019-09-20 12:58:05,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:05,636 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-09-20 12:58:05,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:58:05,637 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-09-20 12:58:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-20 12:58:05,638 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:05,638 INFO L407 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] [2019-09-20 12:58:05,639 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:05,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:05,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2019-09-20 12:58:05,639 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:05,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:05,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:05,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:05,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:05,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:05,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:05,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:05,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:05,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:05,688 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2019-09-20 12:58:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:05,822 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2019-09-20 12:58:05,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 12:58:05,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-09-20 12:58:05,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:05,824 INFO L225 Difference]: With dead ends: 91 [2019-09-20 12:58:05,824 INFO L226 Difference]: Without dead ends: 89 [2019-09-20 12:58:05,824 INFO L636 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 [2019-09-20 12:58:05,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-20 12:58:05,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-09-20 12:58:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-20 12:58:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-09-20 12:58:05,829 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2019-09-20 12:58:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:05,830 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-09-20 12:58:05,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-09-20 12:58:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-20 12:58:05,831 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:05,831 INFO L407 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] [2019-09-20 12:58:05,831 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:05,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:05,832 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2019-09-20 12:58:05,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:05,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:05,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:05,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:05,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:05,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:05,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:05,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:05,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:05,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:05,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:05,874 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2019-09-20 12:58:05,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:05,956 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-09-20 12:58:05,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:58:05,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-09-20 12:58:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:05,958 INFO L225 Difference]: With dead ends: 61 [2019-09-20 12:58:05,958 INFO L226 Difference]: Without dead ends: 59 [2019-09-20 12:58:05,958 INFO L636 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 [2019-09-20 12:58:05,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-20 12:58:05,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-20 12:58:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-20 12:58:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-09-20 12:58:05,963 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2019-09-20 12:58:05,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:05,963 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-09-20 12:58:05,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-09-20 12:58:05,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-20 12:58:05,964 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:05,964 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:05,965 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:05,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:05,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2019-09-20 12:58:05,965 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:05,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:05,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:05,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:05,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:06,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:06,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:06,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:06,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:06,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:06,013 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2019-09-20 12:58:06,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:06,032 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-09-20 12:58:06,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:58:06,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-09-20 12:58:06,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:06,033 INFO L225 Difference]: With dead ends: 70 [2019-09-20 12:58:06,033 INFO L226 Difference]: Without dead ends: 68 [2019-09-20 12:58:06,034 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-20 12:58:06,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-09-20 12:58:06,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-20 12:58:06,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-09-20 12:58:06,040 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 41 [2019-09-20 12:58:06,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:06,040 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-09-20 12:58:06,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-09-20 12:58:06,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-20 12:58:06,041 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:06,041 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:06,042 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:06,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:06,042 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2019-09-20 12:58:06,042 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:06,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:06,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:06,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:06,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:06,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:06,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:06,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:06,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:06,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:06,098 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-09-20 12:58:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:06,126 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-09-20 12:58:06,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:58:06,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-09-20 12:58:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:06,127 INFO L225 Difference]: With dead ends: 68 [2019-09-20 12:58:06,127 INFO L226 Difference]: Without dead ends: 66 [2019-09-20 12:58:06,127 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:06,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-20 12:58:06,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-09-20 12:58:06,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-20 12:58:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-09-20 12:58:06,133 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 42 [2019-09-20 12:58:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:06,133 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-09-20 12:58:06,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-09-20 12:58:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-20 12:58:06,134 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:06,134 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:06,134 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:06,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:06,135 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2019-09-20 12:58:06,135 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:06,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:06,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:06,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:06,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:06,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:06,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:06,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:06,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:06,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:06,182 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-09-20 12:58:06,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:06,317 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2019-09-20 12:58:06,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 12:58:06,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-09-20 12:58:06,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:06,318 INFO L225 Difference]: With dead ends: 90 [2019-09-20 12:58:06,318 INFO L226 Difference]: Without dead ends: 88 [2019-09-20 12:58:06,319 INFO L636 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 [2019-09-20 12:58:06,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-20 12:58:06,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2019-09-20 12:58:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-20 12:58:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-09-20 12:58:06,324 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 43 [2019-09-20 12:58:06,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:06,324 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-09-20 12:58:06,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:06,325 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-09-20 12:58:06,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-20 12:58:06,325 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:06,325 INFO L407 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, 1, 1, 1, 1] [2019-09-20 12:58:06,326 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:06,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:06,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2019-09-20 12:58:06,326 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:06,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:06,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:06,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:06,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:06,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:06,493 INFO L224 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 [2019-09-20 12:58:06,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:06,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-20 12:58:06,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:06,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:06,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:06,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:06,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-09-20 12:58:06,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 12:58:06,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 12:58:06,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:06,635 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 8 states. [2019-09-20 12:58:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:06,815 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2019-09-20 12:58:06,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:58:06,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-09-20 12:58:06,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:06,816 INFO L225 Difference]: With dead ends: 70 [2019-09-20 12:58:06,816 INFO L226 Difference]: Without dead ends: 68 [2019-09-20 12:58:06,817 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-09-20 12:58:06,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-20 12:58:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-20 12:58:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-20 12:58:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-20 12:58:06,822 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 44 [2019-09-20 12:58:06,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:06,823 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-20 12:58:06,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 12:58:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-20 12:58:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-20 12:58:06,823 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:06,824 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:06,824 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:06,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:06,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2019-09-20 12:58:06,825 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:06,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:06,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:06,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:06,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:06,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:06,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:06,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:06,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:06,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:06,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:06,872 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-09-20 12:58:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:06,965 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-09-20 12:58:06,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:58:06,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-09-20 12:58:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:06,966 INFO L225 Difference]: With dead ends: 71 [2019-09-20 12:58:06,966 INFO L226 Difference]: Without dead ends: 69 [2019-09-20 12:58:06,967 INFO L636 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 [2019-09-20 12:58:06,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-20 12:58:06,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-09-20 12:58:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-20 12:58:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-20 12:58:06,972 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 44 [2019-09-20 12:58:06,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:06,972 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-20 12:58:06,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:06,973 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-20 12:58:06,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 12:58:06,973 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:06,973 INFO L407 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, 1, 1, 1, 1] [2019-09-20 12:58:06,974 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:06,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:06,974 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2019-09-20 12:58:06,974 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:06,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:06,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:06,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:06,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 12:58:07,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:07,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:07,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:07,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:07,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:07,020 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-09-20 12:58:07,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:07,152 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-09-20 12:58:07,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:58:07,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-20 12:58:07,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:07,154 INFO L225 Difference]: With dead ends: 77 [2019-09-20 12:58:07,154 INFO L226 Difference]: Without dead ends: 75 [2019-09-20 12:58:07,154 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-20 12:58:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2019-09-20 12:58:07,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-20 12:58:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-09-20 12:58:07,159 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2019-09-20 12:58:07,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:07,160 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-09-20 12:58:07,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:07,160 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-09-20 12:58:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 12:58:07,160 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:07,161 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:07,161 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:07,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1664106253, now seen corresponding path program 1 times [2019-09-20 12:58:07,162 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:07,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:07,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:07,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:07,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:07,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:07,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:07,210 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:07,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:07,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 12:58:07,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:07,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 12:58:07,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:58:07,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2019-09-20 12:58:07,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:58:07,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:58:07,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:07,329 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 6 states. [2019-09-20 12:58:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:07,377 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-09-20 12:58:07,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:07,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-09-20 12:58:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:07,378 INFO L225 Difference]: With dead ends: 60 [2019-09-20 12:58:07,379 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 12:58:07,380 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:07,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 12:58:07,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 12:58:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 12:58:07,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 12:58:07,382 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2019-09-20 12:58:07,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:07,382 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 12:58:07,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:58:07,383 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 12:58:07,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 12:58:07,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 12:58:08,096 WARN L191 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 73 [2019-09-20 12:58:08,275 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2019-09-20 12:58:08,640 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2019-09-20 12:58:08,776 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2019-09-20 12:58:08,784 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-20 12:58:08,784 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-20 12:58:08,784 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-20 12:58:08,784 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-20 12:58:08,784 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-20 12:58:08,784 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-20 12:58:08,784 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-20 12:58:08,784 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2019-09-20 12:58:08,785 INFO L443 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-09-20 12:58:08,785 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 434) no Hoare annotation was computed. [2019-09-20 12:58:08,785 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-09-20 12:58:08,785 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2019-09-20 12:58:08,785 INFO L443 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2019-09-20 12:58:08,785 INFO L443 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2019-09-20 12:58:08,785 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2019-09-20 12:58:08,785 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-09-20 12:58:08,785 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2019-09-20 12:58:08,785 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2019-09-20 12:58:08,785 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2019-09-20 12:58:08,785 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2019-09-20 12:58:08,786 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2019-09-20 12:58:08,786 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-09-20 12:58:08,786 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2019-09-20 12:58:08,786 INFO L439 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse0 (<= 2 main_~main__cp~0)) (.cse3 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse2 (= main_~__VERIFIER_assert__cond~10 1)) (.cse4 (and (not (= main_~__VERIFIER_assert__cond~8 0)) (and (= main_~__VERIFIER_assert__cond~4 1) (and (= main_~__VERIFIER_assert__cond~0 1) (and (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (and (= main_~__VERIFIER_assert__cond~3 1) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~1 0))))) (not (= main_~__VERIFIER_assert__cond~7 0)))))) (or (and .cse0 (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~15 0)) .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) .cse3 (= main_~__VERIFIER_assert__cond~12 1) .cse4) (and (= 0 main_~main__c~0) (or (and .cse0 (<= (+ main_~main__cp~0 2) main_~main__urilen~0) .cse3 (= main_~__VERIFIER_assert__cond~8 1) .cse4) (and .cse0 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse3 .cse1 .cse2 .cse4))))) [2019-09-20 12:58:08,786 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2019-09-20 12:58:08,786 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 434) no Hoare annotation was computed. [2019-09-20 12:58:08,786 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2019-09-20 12:58:08,786 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2019-09-20 12:58:08,786 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2019-09-20 12:58:08,787 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2019-09-20 12:58:08,787 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-09-20 12:58:08,787 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2019-09-20 12:58:08,788 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 8 434) the Hoare annotation is: true [2019-09-20 12:58:08,789 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-09-20 12:58:08,789 INFO L443 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2019-09-20 12:58:08,789 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-09-20 12:58:08,789 INFO L443 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2019-09-20 12:58:08,789 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2019-09-20 12:58:08,789 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2019-09-20 12:58:08,789 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-09-20 12:58:08,790 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2019-09-20 12:58:08,790 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2019-09-20 12:58:08,790 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2019-09-20 12:58:08,790 INFO L443 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2019-09-20 12:58:08,790 INFO L443 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2019-09-20 12:58:08,790 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2019-09-20 12:58:08,790 INFO L443 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2019-09-20 12:58:08,790 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2019-09-20 12:58:08,791 INFO L443 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-09-20 12:58:08,791 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-09-20 12:58:08,791 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2019-09-20 12:58:08,791 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2019-09-20 12:58:08,791 INFO L439 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (let ((.cse0 (= main_~__VERIFIER_assert__cond~3 1)) (.cse1 (< 0 main_~main__scheme~0)) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse3 (= main_~__VERIFIER_assert__cond~16 1)) (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3))) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1)) [2019-09-20 12:58:08,791 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2019-09-20 12:58:08,792 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-09-20 12:58:08,792 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2019-09-20 12:58:08,792 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2019-09-20 12:58:08,792 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2019-09-20 12:58:08,792 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2019-09-20 12:58:08,793 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2019-09-20 12:58:08,793 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-09-20 12:58:08,793 INFO L439 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (let ((.cse0 (and (= main_~__VERIFIER_assert__cond~3 1) (and (< main_~main__cp~0 main_~main__urilen~0) (let ((.cse1 (< 0 main_~main__scheme~0)) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0)))) (or (and .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3 .cse4) (and (not (= main_~__VERIFIER_assert__cond~16 0)) .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse3 .cse4))))))) (or (and .cse0 (= main_~__VERIFIER_assert__cond~0 1)) (and .cse0 (= (+ main_~main__cp~0 1) main_~main__urilen~0)))) [2019-09-20 12:58:08,793 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-09-20 12:58:08,793 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2019-09-20 12:58:08,793 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2019-09-20 12:58:08,793 INFO L439 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (let ((.cse1 (= main_~__VERIFIER_assert__cond~9 1)) (.cse0 (and (<= 2 main_~main__cp~0) (and (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1) (and (= main_~__VERIFIER_assert__cond~3 1) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~1 0)))) (not (= main_~__VERIFIER_assert__cond~8 0)) (= main_~__VERIFIER_assert__cond~4 1) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~9 0)))) (.cse2 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse3 (= main_~__VERIFIER_assert__cond~10 1))) (or (and (and (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse0 .cse1 .cse2) .cse3 (= 0 main_~main__c~0)) (and (not (= main_~__VERIFIER_assert__cond~15 0)) .cse1 (and (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__c~0) .cse0 .cse2 (not (= main_~__VERIFIER_assert__cond~13 0))) (= main_~__VERIFIER_assert__cond~12 1) .cse3))) [2019-09-20 12:58:08,794 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2019-09-20 12:58:08,794 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2019-09-20 12:58:08,794 INFO L443 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2019-09-20 12:58:08,794 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2019-09-20 12:58:08,794 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2019-09-20 12:58:08,794 INFO L439 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (not (= main_~__VERIFIER_assert__cond~0 0)) [2019-09-20 12:58:08,794 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2019-09-20 12:58:08,794 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-09-20 12:58:08,794 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2019-09-20 12:58:08,795 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2019-09-20 12:58:08,795 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2019-09-20 12:58:08,795 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2019-09-20 12:58:08,795 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2019-09-20 12:58:08,795 INFO L443 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2019-09-20 12:58:08,795 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-09-20 12:58:08,795 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-09-20 12:58:08,795 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2019-09-20 12:58:08,795 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2019-09-20 12:58:08,796 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2019-09-20 12:58:08,796 INFO L443 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2019-09-20 12:58:08,796 INFO L443 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2019-09-20 12:58:08,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 12:58:08 BoogieIcfgContainer [2019-09-20 12:58:08,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 12:58:08,841 INFO L168 Benchmark]: Toolchain (without parser) took 7764.28 ms. Allocated memory was 138.9 MB in the beginning and 325.6 MB in the end (delta: 186.6 MB). Free memory was 86.1 MB in the beginning and 136.9 MB in the end (delta: -50.8 MB). Peak memory consumption was 193.6 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:08,841 INFO L168 Benchmark]: CDTParser took 1.42 ms. Allocated memory is still 138.9 MB. Free memory was 104.9 MB in the beginning and 104.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-20 12:58:08,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 455.44 ms. Allocated memory was 138.9 MB in the beginning and 198.2 MB in the end (delta: 59.2 MB). Free memory was 85.6 MB in the beginning and 174.4 MB in the end (delta: -88.7 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:08,843 INFO L168 Benchmark]: Boogie Preprocessor took 35.91 ms. Allocated memory is still 198.2 MB. Free memory was 174.4 MB in the beginning and 172.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:08,845 INFO L168 Benchmark]: RCFGBuilder took 481.24 ms. Allocated memory is still 198.2 MB. Free memory was 172.5 MB in the beginning and 145.2 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:08,848 INFO L168 Benchmark]: TraceAbstraction took 6786.80 ms. Allocated memory was 198.2 MB in the beginning and 325.6 MB in the end (delta: 127.4 MB). Free memory was 145.2 MB in the beginning and 136.9 MB in the end (delta: 8.4 MB). Peak memory consumption was 193.5 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:08,853 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.42 ms. Allocated memory is still 138.9 MB. Free memory was 104.9 MB in the beginning and 104.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 455.44 ms. Allocated memory was 138.9 MB in the beginning and 198.2 MB in the end (delta: 59.2 MB). Free memory was 85.6 MB in the beginning and 174.4 MB in the end (delta: -88.7 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.91 ms. Allocated memory is still 198.2 MB. Free memory was 174.4 MB in the beginning and 172.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 481.24 ms. Allocated memory is still 198.2 MB. Free memory was 172.5 MB in the beginning and 145.2 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6786.80 ms. Allocated memory was 198.2 MB in the beginning and 325.6 MB in the end (delta: 127.4 MB). Free memory was 145.2 MB in the beginning and 136.9 MB in the end (delta: 8.4 MB). Peak memory consumption was 193.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 238]: 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: 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: 140]: 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: 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: 108]: 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: 209]: 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: 291]: 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: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: 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: 152]: 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: 225]: Loop Invariant Derived loop invariant: (((((((((2 <= main__cp && 1 <= main__c) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0) && (__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1 && ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && (((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (0 == main__c && (((((2 <= main__cp && main__cp + 2 <= main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0) && (__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1 && ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && (((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((2 <= main__cp && main__c + 2 <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0) && (__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1 && ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && (((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((__VERIFIER_assert__cond == 1 && main__cp < main__urilen && (((((0 < main__scheme && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && __VERIFIER_assert__cond == 1) || ((__VERIFIER_assert__cond == 1 && main__cp < main__urilen && (((((0 < main__scheme && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && main__cp + 1 == main__urilen) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((main__c + 2 <= main__tokenlen && ((((2 <= main__cp && (((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && ((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 0 == main__c) || ((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && (((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((2 <= main__cp && (((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && ((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || ((((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 18 error locations. SAFE Result, 6.6s OverallTime, 24 OverallIterations, 2 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1399 SDtfs, 2515 SDslu, 1868 SDs, 0 SdLazy, 1172 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 194 SyntacticMatches, 18 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred 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.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 287 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 543 HoareAnnotationTreeSize, 9 FomulaSimplifications, 27037 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 23893 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 929 ConstructedInterpolants, 0 QuantifiedInterpolants, 77293 SizeOfPredicates, 25 NumberOfNonLiveVariables, 547 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 16/33 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...