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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:03:20,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:03:20,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:03:20,683 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:03:20,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:03:20,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:03:20,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:03:20,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:03:20,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:03:20,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:03:20,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:03:20,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:03:20,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:03:20,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:03:20,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:03:20,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:03:20,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:03:20,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:03:20,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:03:20,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:03:20,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:03:20,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:03:20,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:03:20,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:03:20,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:03:20,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:03:20,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:03:20,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:03:20,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:03:20,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:03:20,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:03:20,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:03:20,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:03:20,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:03:20,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:03:20,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:03:20,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:03:20,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:03:20,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:03:20,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:03:20,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:03:20,723 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:03:20,747 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:03:20,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:03:20,748 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:03:20,748 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:03:20,749 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:03:20,749 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:03:20,749 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:03:20,749 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:03:20,749 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:03:20,750 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:03:20,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:03:20,750 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:03:20,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:03:20,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:03:20,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:03:20,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:03:20,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:03:20,752 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:03:20,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:03:20,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:03:20,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:03:20,752 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:03:20,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:03:20,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:03:20,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:03:20,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:03:20,753 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:03:20,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:03:20,754 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:03:20,754 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:03:20,792 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:03:20,813 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:03:20,817 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:03:20,818 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:03:20,819 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:03:20,820 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-09-16 17:03:20,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e07ba6f7/0baace9b836c443fb1b72e3e41ab3521/FLAGdf13751cc [2019-09-16 17:03:21,377 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:03:21,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-09-16 17:03:21,386 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e07ba6f7/0baace9b836c443fb1b72e3e41ab3521/FLAGdf13751cc [2019-09-16 17:03:21,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e07ba6f7/0baace9b836c443fb1b72e3e41ab3521 [2019-09-16 17:03:21,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:03:21,799 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:03:21,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:03:21,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:03:21,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:03:21,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:03:21" (1/1) ... [2019-09-16 17:03:21,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c94b126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:21, skipping insertion in model container [2019-09-16 17:03:21,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:03:21" (1/1) ... [2019-09-16 17:03:21,816 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:03:21,850 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:03:22,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:03:22,051 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:03:22,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:03:22,187 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:03:22,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22 WrapperNode [2019-09-16 17:03:22,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:03:22,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:03:22,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:03:22,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:03:22,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (1/1) ... [2019-09-16 17:03:22,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (1/1) ... [2019-09-16 17:03:22,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (1/1) ... [2019-09-16 17:03:22,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (1/1) ... [2019-09-16 17:03:22,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (1/1) ... [2019-09-16 17:03:22,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (1/1) ... [2019-09-16 17:03:22,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (1/1) ... [2019-09-16 17:03:22,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:03:22,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:03:22,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:03:22,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:03:22,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (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-16 17:03:22,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:03:22,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:03:22,296 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:03:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:03:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-16 17:03:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-16 17:03:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:03:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:03:22,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:03:22,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:03:22,701 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:03:22,701 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-16 17:03:22,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:03:22 BoogieIcfgContainer [2019-09-16 17:03:22,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:03:22,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:03:22,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:03:22,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:03:22,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:03:21" (1/3) ... [2019-09-16 17:03:22,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370870e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:03:22, skipping insertion in model container [2019-09-16 17:03:22,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:22" (2/3) ... [2019-09-16 17:03:22,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370870e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:03:22, skipping insertion in model container [2019-09-16 17:03:22,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:03:22" (3/3) ... [2019-09-16 17:03:22,711 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-09-16 17:03:22,720 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:03:22,727 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-09-16 17:03:22,743 INFO L252 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-09-16 17:03:22,769 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:03:22,770 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:03:22,770 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:03:22,770 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:03:22,770 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:03:22,770 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:03:22,770 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:03:22,771 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:03:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-09-16 17:03:22,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-16 17:03:22,797 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:22,798 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:22,800 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:22,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:22,805 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2019-09-16 17:03:22,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:22,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:22,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:22,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:22,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:22,982 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-16 17:03:22,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:22,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:22,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:22,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:22,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:23,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:23,001 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-09-16 17:03:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:23,196 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2019-09-16 17:03:23,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:23,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-16 17:03:23,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:23,209 INFO L225 Difference]: With dead ends: 127 [2019-09-16 17:03:23,209 INFO L226 Difference]: Without dead ends: 113 [2019-09-16 17:03:23,211 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-16 17:03:23,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-16 17:03:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2019-09-16 17:03:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-16 17:03:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-09-16 17:03:23,269 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2019-09-16 17:03:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:23,270 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-09-16 17:03:23,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-09-16 17:03:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-16 17:03:23,272 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:23,272 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:23,275 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:23,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:23,277 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2019-09-16 17:03:23,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:23,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:23,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:23,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:23,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:23,356 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-16 17:03:23,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:23,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:23,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:23,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:23,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:23,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:23,363 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2019-09-16 17:03:23,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:23,457 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-09-16 17:03:23,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:23,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-16 17:03:23,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:23,462 INFO L225 Difference]: With dead ends: 67 [2019-09-16 17:03:23,462 INFO L226 Difference]: Without dead ends: 67 [2019-09-16 17:03:23,463 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-16 17:03:23,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-16 17:03:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-16 17:03:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-16 17:03:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-16 17:03:23,478 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2019-09-16 17:03:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:23,479 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-16 17:03:23,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-16 17:03:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-16 17:03:23,480 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:23,481 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:23,482 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:23,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:23,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2019-09-16 17:03:23,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:23,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:23,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:23,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:23,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:23,573 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-16 17:03:23,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:23,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:23,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:23,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:23,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:23,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:23,576 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 4 states. [2019-09-16 17:03:23,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:23,651 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-09-16 17:03:23,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:23,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-16 17:03:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:23,653 INFO L225 Difference]: With dead ends: 71 [2019-09-16 17:03:23,653 INFO L226 Difference]: Without dead ends: 71 [2019-09-16 17:03:23,654 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-16 17:03:23,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-16 17:03:23,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-16 17:03:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-16 17:03:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-09-16 17:03:23,661 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2019-09-16 17:03:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:23,661 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-09-16 17:03:23,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:23,662 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-09-16 17:03:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-16 17:03:23,663 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:23,663 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:23,664 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:23,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:23,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2019-09-16 17:03:23,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:23,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:23,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:23,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:23,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:23,744 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-16 17:03:23,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:23,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:03:23,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:23,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:03:23,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:03:23,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:23,747 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2019-09-16 17:03:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:23,835 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-16 17:03:23,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:23,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-16 17:03:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:23,836 INFO L225 Difference]: With dead ends: 69 [2019-09-16 17:03:23,836 INFO L226 Difference]: Without dead ends: 69 [2019-09-16 17:03:23,837 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:03:23,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-16 17:03:23,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-09-16 17:03:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-16 17:03:23,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-09-16 17:03:23,844 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2019-09-16 17:03:23,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:23,845 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-09-16 17:03:23,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:03:23,845 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-09-16 17:03:23,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-16 17:03:23,846 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:23,846 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:23,847 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:23,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:23,847 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2019-09-16 17:03:23,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:23,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:23,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:23,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:23,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:23,911 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-16 17:03:23,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:23,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:03:23,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:23,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:03:23,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:03:23,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:23,913 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2019-09-16 17:03:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:24,010 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-09-16 17:03:24,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:24,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-16 17:03:24,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:24,013 INFO L225 Difference]: With dead ends: 67 [2019-09-16 17:03:24,013 INFO L226 Difference]: Without dead ends: 67 [2019-09-16 17:03:24,014 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:03:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-16 17:03:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-09-16 17:03:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-16 17:03:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-09-16 17:03:24,026 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2019-09-16 17:03:24,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:24,027 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-09-16 17:03:24,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:03:24,027 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-09-16 17:03:24,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 17:03:24,028 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:24,028 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:24,029 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:24,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:24,030 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2019-09-16 17:03:24,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:24,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:24,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:24,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:24,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:24,109 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-16 17:03:24,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:24,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:03:24,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:24,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:03:24,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:03:24,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:24,111 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-09-16 17:03:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:24,217 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2019-09-16 17:03:24,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:24,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-16 17:03:24,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:24,218 INFO L225 Difference]: With dead ends: 110 [2019-09-16 17:03:24,219 INFO L226 Difference]: Without dead ends: 110 [2019-09-16 17:03:24,219 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:03:24,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-16 17:03:24,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 64. [2019-09-16 17:03:24,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-16 17:03:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-09-16 17:03:24,230 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2019-09-16 17:03:24,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:24,230 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-09-16 17:03:24,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:03:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-09-16 17:03:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 17:03:24,237 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:24,237 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:24,238 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:24,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:24,239 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2019-09-16 17:03:24,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:24,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:24,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:24,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:24,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:24,290 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-16 17:03:24,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:24,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:24,290 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:24,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:24,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:24,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:24,294 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 4 states. [2019-09-16 17:03:24,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:24,361 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-09-16 17:03:24,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:24,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-16 17:03:24,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:24,362 INFO L225 Difference]: With dead ends: 63 [2019-09-16 17:03:24,362 INFO L226 Difference]: Without dead ends: 61 [2019-09-16 17:03:24,363 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-16 17:03:24,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-16 17:03:24,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-09-16 17:03:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-16 17:03:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-09-16 17:03:24,374 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2019-09-16 17:03:24,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:24,374 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-09-16 17:03:24,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-09-16 17:03:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 17:03:24,376 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:24,376 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:24,377 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:24,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:24,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2019-09-16 17:03:24,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:24,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:24,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:24,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:24,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:24,424 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-16 17:03:24,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:24,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:24,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:24,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:24,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:24,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:24,426 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 4 states. [2019-09-16 17:03:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:24,481 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-09-16 17:03:24,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:24,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-16 17:03:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:24,482 INFO L225 Difference]: With dead ends: 59 [2019-09-16 17:03:24,483 INFO L226 Difference]: Without dead ends: 57 [2019-09-16 17:03:24,483 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-16 17:03:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-16 17:03:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-09-16 17:03:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-16 17:03:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-09-16 17:03:24,487 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2019-09-16 17:03:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:24,487 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-09-16 17:03:24,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-09-16 17:03:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 17:03:24,488 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:24,488 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:24,489 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:24,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:24,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2019-09-16 17:03:24,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:24,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:24,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:24,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:24,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:24,573 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: NonCoreBooleanSubTermTransformer does not support AnnotatedTerm at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.NonCoreBooleanSubTermTransformer$NonCoreBooleanSubtermTransformerHelper.convert(NonCoreBooleanSubTermTransformer.java:107) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.NonCoreBooleanSubTermTransformer.transform(NonCoreBooleanSubTermTransformer.java:51) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:87) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:585) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-16 17:03:24,582 INFO L168 Benchmark]: Toolchain (without parser) took 2781.75 ms. Allocated memory was 131.1 MB in the beginning and 219.2 MB in the end (delta: 88.1 MB). Free memory was 86.6 MB in the beginning and 121.4 MB in the end (delta: -34.7 MB). Peak memory consumption was 53.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:24,584 INFO L168 Benchmark]: CDTParser took 1.13 ms. Allocated memory is still 131.1 MB. Free memory was 105.3 MB in the beginning and 105.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:03:24,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.01 ms. Allocated memory was 131.1 MB in the beginning and 198.7 MB in the end (delta: 67.6 MB). Free memory was 86.2 MB in the beginning and 175.4 MB in the end (delta: -89.2 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:24,586 INFO L168 Benchmark]: Boogie Preprocessor took 34.84 ms. Allocated memory is still 198.7 MB. Free memory was 175.4 MB in the beginning and 173.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:24,587 INFO L168 Benchmark]: RCFGBuilder took 479.12 ms. Allocated memory is still 198.7 MB. Free memory was 173.0 MB in the beginning and 149.1 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:24,588 INFO L168 Benchmark]: TraceAbstraction took 1875.53 ms. Allocated memory was 198.7 MB in the beginning and 219.2 MB in the end (delta: 20.4 MB). Free memory was 149.1 MB in the beginning and 121.4 MB in the end (delta: 27.7 MB). Peak memory consumption was 48.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:24,599 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.13 ms. Allocated memory is still 131.1 MB. Free memory was 105.3 MB in the beginning and 105.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 388.01 ms. Allocated memory was 131.1 MB in the beginning and 198.7 MB in the end (delta: 67.6 MB). Free memory was 86.2 MB in the beginning and 175.4 MB in the end (delta: -89.2 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.84 ms. Allocated memory is still 198.7 MB. Free memory was 175.4 MB in the beginning and 173.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 479.12 ms. Allocated memory is still 198.7 MB. Free memory was 173.0 MB in the beginning and 149.1 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1875.53 ms. Allocated memory was 198.7 MB in the beginning and 219.2 MB in the end (delta: 20.4 MB). Free memory was 149.1 MB in the beginning and 121.4 MB in the end (delta: 27.7 MB). Peak memory consumption was 48.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: NonCoreBooleanSubTermTransformer does not support AnnotatedTerm de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: NonCoreBooleanSubTermTransformer does not support AnnotatedTerm: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.NonCoreBooleanSubTermTransformer$NonCoreBooleanSubtermTransformerHelper.convert(NonCoreBooleanSubTermTransformer.java:107) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...