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/eca-rers2012/Problem11_label48.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 18:29:54,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 18:29:54,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 18:29:54,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 18:29:54,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 18:29:54,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 18:29:54,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 18:29:54,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 18:29:54,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 18:29:54,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 18:29:54,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 18:29:54,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 18:29:54,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 18:29:54,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 18:29:54,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 18:29:54,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 18:29:54,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 18:29:54,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 18:29:54,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 18:29:54,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 18:29:54,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 18:29:54,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 18:29:54,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 18:29:54,789 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 18:29:54,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 18:29:54,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 18:29:54,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 18:29:54,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 18:29:54,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 18:29:54,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 18:29:54,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 18:29:54,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 18:29:54,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 18:29:54,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 18:29:54,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 18:29:54,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 18:29:54,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 18:29:54,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 18:29:54,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 18:29:54,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 18:29:54,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 18:29:54,801 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-07 18:29:54,814 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 18:29:54,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 18:29:54,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 18:29:54,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 18:29:54,816 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 18:29:54,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 18:29:54,817 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 18:29:54,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 18:29:54,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 18:29:54,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 18:29:54,817 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 18:29:54,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 18:29:54,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 18:29:54,818 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 18:29:54,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 18:29:54,818 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 18:29:54,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 18:29:54,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 18:29:54,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 18:29:54,819 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 18:29:54,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 18:29:54,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 18:29:54,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 18:29:54,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 18:29:54,820 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 18:29:54,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 18:29:54,821 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 18:29:54,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 18:29:54,821 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 18:29:54,848 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 18:29:54,861 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 18:29:54,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 18:29:54,866 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 18:29:54,866 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 18:29:54,867 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label48.c [2019-09-07 18:29:54,927 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa06baaa/13510fad85714a5fb6ded427ba42a122/FLAG28269b2fb [2019-09-07 18:29:55,526 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 18:29:55,530 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label48.c [2019-09-07 18:29:55,555 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa06baaa/13510fad85714a5fb6ded427ba42a122/FLAG28269b2fb [2019-09-07 18:29:55,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa06baaa/13510fad85714a5fb6ded427ba42a122 [2019-09-07 18:29:55,723 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 18:29:55,724 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 18:29:55,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 18:29:55,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 18:29:55,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 18:29:55,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:29:55" (1/1) ... [2019-09-07 18:29:55,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76c484b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:29:55, skipping insertion in model container [2019-09-07 18:29:55,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:29:55" (1/1) ... [2019-09-07 18:29:55,743 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 18:29:55,813 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 18:29:56,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:29:56,519 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 18:29:56,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:29:56,815 INFO L192 MainTranslator]: Completed translation [2019-09-07 18:29:56,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:29:56 WrapperNode [2019-09-07 18:29:56,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 18:29:56,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 18:29:56,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 18:29:56,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 18:29:56,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:29:56" (1/1) ... [2019-09-07 18:29:56,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:29:56" (1/1) ... [2019-09-07 18:29:56,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:29:56" (1/1) ... [2019-09-07 18:29:56,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:29:56" (1/1) ... [2019-09-07 18:29:56,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:29:56" (1/1) ... [2019-09-07 18:29:56,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:29:56" (1/1) ... [2019-09-07 18:29:56,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:29:56" (1/1) ... [2019-09-07 18:29:56,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 18:29:56,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 18:29:56,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 18:29:56,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 18:29:56,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:29:56" (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-07 18:29:57,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 18:29:57,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 18:29:57,047 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 18:29:57,048 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 18:29:57,049 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 18:29:57,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 18:29:57,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 18:29:57,049 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 18:29:57,049 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 18:29:57,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 18:29:57,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 18:29:58,890 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 18:29:58,891 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 18:29:58,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:29:58 BoogieIcfgContainer [2019-09-07 18:29:58,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 18:29:58,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 18:29:58,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 18:29:58,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 18:29:58,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 06:29:55" (1/3) ... [2019-09-07 18:29:58,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4493981e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:29:58, skipping insertion in model container [2019-09-07 18:29:58,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:29:56" (2/3) ... [2019-09-07 18:29:58,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4493981e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:29:58, skipping insertion in model container [2019-09-07 18:29:58,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:29:58" (3/3) ... [2019-09-07 18:29:58,911 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label48.c [2019-09-07 18:29:58,927 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 18:29:58,936 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 18:29:58,952 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 18:29:58,999 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 18:29:59,000 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 18:29:59,001 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 18:29:59,001 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 18:29:59,001 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 18:29:59,001 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 18:29:59,001 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 18:29:59,002 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 18:29:59,002 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 18:29:59,040 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-09-07 18:29:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 18:29:59,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:29:59,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:29:59,053 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:29:59,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:29:59,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1357011669, now seen corresponding path program 1 times [2019-09-07 18:29:59,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:29:59,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:29:59,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:29:59,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:29:59,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:29:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:29:59,466 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-07 18:29:59,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:29:59,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:29:59,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:29:59,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:29:59,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:29:59,491 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 4 states. [2019-09-07 18:30:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:30:01,684 INFO L93 Difference]: Finished difference Result 975 states and 1750 transitions. [2019-09-07 18:30:01,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:30:01,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-09-07 18:30:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:30:01,711 INFO L225 Difference]: With dead ends: 975 [2019-09-07 18:30:01,711 INFO L226 Difference]: Without dead ends: 616 [2019-09-07 18:30:01,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:30:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-07 18:30:01,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 422. [2019-09-07 18:30:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-07 18:30:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 607 transitions. [2019-09-07 18:30:01,809 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 607 transitions. Word has length 56 [2019-09-07 18:30:01,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:30:01,809 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 607 transitions. [2019-09-07 18:30:01,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:30:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 607 transitions. [2019-09-07 18:30:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-07 18:30:01,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:30:01,819 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:30:01,819 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:30:01,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:30:01,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1346541034, now seen corresponding path program 1 times [2019-09-07 18:30:01,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:30:01,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:30:01,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:01,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:01,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:02,053 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:30:02,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:30:02,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 18:30:02,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:30:02,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:30:02,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:30:02,059 INFO L87 Difference]: Start difference. First operand 422 states and 607 transitions. Second operand 6 states. [2019-09-07 18:30:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:30:03,585 INFO L93 Difference]: Finished difference Result 1241 states and 1811 transitions. [2019-09-07 18:30:03,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:30:03,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-09-07 18:30:03,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:30:03,599 INFO L225 Difference]: With dead ends: 1241 [2019-09-07 18:30:03,599 INFO L226 Difference]: Without dead ends: 825 [2019-09-07 18:30:03,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:30:03,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2019-09-07 18:30:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 814. [2019-09-07 18:30:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2019-09-07 18:30:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1162 transitions. [2019-09-07 18:30:03,657 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1162 transitions. Word has length 128 [2019-09-07 18:30:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:30:03,658 INFO L475 AbstractCegarLoop]: Abstraction has 814 states and 1162 transitions. [2019-09-07 18:30:03,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:30:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1162 transitions. [2019-09-07 18:30:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-07 18:30:03,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:30:03,663 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:30:03,663 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:30:03,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:30:03,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1287366310, now seen corresponding path program 1 times [2019-09-07 18:30:03,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:30:03,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:30:03,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:03,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:03,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:30:03,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:30:03,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 18:30:03,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:30:03,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:30:03,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:30:03,855 INFO L87 Difference]: Start difference. First operand 814 states and 1162 transitions. Second operand 6 states. [2019-09-07 18:30:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:30:05,481 INFO L93 Difference]: Finished difference Result 2426 states and 3548 transitions. [2019-09-07 18:30:05,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:30:05,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-09-07 18:30:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:30:05,495 INFO L225 Difference]: With dead ends: 2426 [2019-09-07 18:30:05,495 INFO L226 Difference]: Without dead ends: 1618 [2019-09-07 18:30:05,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-07 18:30:05,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2019-09-07 18:30:05,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1602. [2019-09-07 18:30:05,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1602 states. [2019-09-07 18:30:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2126 transitions. [2019-09-07 18:30:05,582 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2126 transitions. Word has length 136 [2019-09-07 18:30:05,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:30:05,587 INFO L475 AbstractCegarLoop]: Abstraction has 1602 states and 2126 transitions. [2019-09-07 18:30:05,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:30:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2126 transitions. [2019-09-07 18:30:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-07 18:30:05,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:30:05,608 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:30:05,608 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:30:05,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:30:05,609 INFO L82 PathProgramCache]: Analyzing trace with hash -670087252, now seen corresponding path program 1 times [2019-09-07 18:30:05,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:30:05,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:30:05,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:05,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:05,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:05,873 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 169 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:30:05,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:30:05,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:30:05,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:05,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 18:30:06,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:30:06,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:30:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-07 18:30:06,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:30:06,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 18:30:06,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:30:06,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:30:06,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:30:06,173 INFO L87 Difference]: Start difference. First operand 1602 states and 2126 transitions. Second operand 9 states. [2019-09-07 18:30:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:30:10,222 INFO L93 Difference]: Finished difference Result 4690 states and 6622 transitions. [2019-09-07 18:30:10,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 18:30:10,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 209 [2019-09-07 18:30:10,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:30:10,241 INFO L225 Difference]: With dead ends: 4690 [2019-09-07 18:30:10,242 INFO L226 Difference]: Without dead ends: 3094 [2019-09-07 18:30:10,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-09-07 18:30:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2019-09-07 18:30:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3049. [2019-09-07 18:30:10,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3049 states. [2019-09-07 18:30:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3049 states to 3049 states and 4227 transitions. [2019-09-07 18:30:10,344 INFO L78 Accepts]: Start accepts. Automaton has 3049 states and 4227 transitions. Word has length 209 [2019-09-07 18:30:10,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:30:10,344 INFO L475 AbstractCegarLoop]: Abstraction has 3049 states and 4227 transitions. [2019-09-07 18:30:10,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:30:10,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3049 states and 4227 transitions. [2019-09-07 18:30:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-07 18:30:10,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:30:10,351 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:30:10,351 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:30:10,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:30:10,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1581542188, now seen corresponding path program 1 times [2019-09-07 18:30:10,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:30:10,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:30:10,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:10,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:10,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:30:10,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:30:10,557 INFO L223 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-07 18:30:10,570 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-07 18:30:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:10,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 18:30:10,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:30:10,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:10,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:30:13,086 WARN L188 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 96 DAG size of output: 21 [2019-09-07 18:30:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-07 18:30:13,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:30:13,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-07 18:30:13,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:30:13,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:30:13,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:30:13,294 INFO L87 Difference]: Start difference. First operand 3049 states and 4227 transitions. Second operand 6 states. [2019-09-07 18:30:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:30:16,720 INFO L93 Difference]: Finished difference Result 9045 states and 13219 transitions. [2019-09-07 18:30:16,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 18:30:16,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 273 [2019-09-07 18:30:16,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:30:16,756 INFO L225 Difference]: With dead ends: 9045 [2019-09-07 18:30:16,756 INFO L226 Difference]: Without dead ends: 6010 [2019-09-07 18:30:16,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-09-07 18:30:16,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2019-09-07 18:30:16,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 5787. [2019-09-07 18:30:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5787 states. [2019-09-07 18:30:16,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5787 states to 5787 states and 7948 transitions. [2019-09-07 18:30:16,929 INFO L78 Accepts]: Start accepts. Automaton has 5787 states and 7948 transitions. Word has length 273 [2019-09-07 18:30:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:30:16,930 INFO L475 AbstractCegarLoop]: Abstraction has 5787 states and 7948 transitions. [2019-09-07 18:30:16,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:30:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 5787 states and 7948 transitions. [2019-09-07 18:30:16,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-07 18:30:16,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:30:16,940 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:30:16,943 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:30:16,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:30:16,944 INFO L82 PathProgramCache]: Analyzing trace with hash -865039372, now seen corresponding path program 1 times [2019-09-07 18:30:16,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:30:16,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:30:16,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:16,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:16,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 201 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:30:17,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:30:17,205 INFO L223 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-07 18:30:17,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:17,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:30:17,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:30:17,456 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 201 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:30:17,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:30:17,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 18:30:17,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:30:17,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:30:17,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:30:17,474 INFO L87 Difference]: Start difference. First operand 5787 states and 7948 transitions. Second operand 9 states. [2019-09-07 18:30:20,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:30:20,612 INFO L93 Difference]: Finished difference Result 14341 states and 23844 transitions. [2019-09-07 18:30:20,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 18:30:20,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 292 [2019-09-07 18:30:20,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:30:20,687 INFO L225 Difference]: With dead ends: 14341 [2019-09-07 18:30:20,687 INFO L226 Difference]: Without dead ends: 8568 [2019-09-07 18:30:20,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-09-07 18:30:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8568 states. [2019-09-07 18:30:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8568 to 8162. [2019-09-07 18:30:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8162 states. [2019-09-07 18:30:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8162 states to 8162 states and 10980 transitions. [2019-09-07 18:30:21,072 INFO L78 Accepts]: Start accepts. Automaton has 8162 states and 10980 transitions. Word has length 292 [2019-09-07 18:30:21,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:30:21,074 INFO L475 AbstractCegarLoop]: Abstraction has 8162 states and 10980 transitions. [2019-09-07 18:30:21,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:30:21,074 INFO L276 IsEmpty]: Start isEmpty. Operand 8162 states and 10980 transitions. [2019-09-07 18:30:21,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-07 18:30:21,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:30:21,087 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:30:21,087 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:30:21,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:30:21,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1206013440, now seen corresponding path program 1 times [2019-09-07 18:30:21,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:30:21,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:30:21,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:21,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:21,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 7 proven. 97 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-07 18:30:21,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:30:21,422 INFO L223 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-07 18:30:21,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:21,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 18:30:21,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:30:21,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:30:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 206 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:30:21,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:30:21,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-09-07 18:30:21,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 18:30:21,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 18:30:21,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-07 18:30:21,752 INFO L87 Difference]: Start difference. First operand 8162 states and 10980 transitions. Second operand 15 states. [2019-09-07 18:30:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:30:33,839 INFO L93 Difference]: Finished difference Result 30540 states and 46899 transitions. [2019-09-07 18:30:33,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-07 18:30:33,841 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 297 [2019-09-07 18:30:33,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:30:33,957 INFO L225 Difference]: With dead ends: 30540 [2019-09-07 18:30:33,958 INFO L226 Difference]: Without dead ends: 22576 [2019-09-07 18:30:33,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3401 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1265, Invalid=7665, Unknown=0, NotChecked=0, Total=8930 [2019-09-07 18:30:34,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22576 states. [2019-09-07 18:30:34,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22576 to 21878. [2019-09-07 18:30:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21878 states. [2019-09-07 18:30:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21878 states to 21878 states and 29360 transitions. [2019-09-07 18:30:34,802 INFO L78 Accepts]: Start accepts. Automaton has 21878 states and 29360 transitions. Word has length 297 [2019-09-07 18:30:34,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:30:34,803 INFO L475 AbstractCegarLoop]: Abstraction has 21878 states and 29360 transitions. [2019-09-07 18:30:34,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 18:30:34,803 INFO L276 IsEmpty]: Start isEmpty. Operand 21878 states and 29360 transitions. [2019-09-07 18:30:34,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-07 18:30:34,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:30:34,852 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:30:34,852 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:30:34,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:30:34,853 INFO L82 PathProgramCache]: Analyzing trace with hash -235913082, now seen corresponding path program 1 times [2019-09-07 18:30:34,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:30:34,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:30:34,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:34,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:34,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:35,333 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 337 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 18:30:35,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:30:35,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:30:35,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:30:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:35,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:30:35,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:30:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 337 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:30:35,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:30:35,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-09-07 18:30:35,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:30:35,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:30:35,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:30:35,556 INFO L87 Difference]: Start difference. First operand 21878 states and 29360 transitions. Second operand 6 states. [2019-09-07 18:30:36,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:30:36,944 INFO L93 Difference]: Finished difference Result 46827 states and 65724 transitions. [2019-09-07 18:30:36,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:30:36,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 374 [2019-09-07 18:30:36,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:30:37,015 INFO L225 Difference]: With dead ends: 46827 [2019-09-07 18:30:37,015 INFO L226 Difference]: Without dead ends: 24953 [2019-09-07 18:30:37,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:30:37,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24953 states. [2019-09-07 18:30:38,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24953 to 22993. [2019-09-07 18:30:38,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22993 states. [2019-09-07 18:30:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22993 states to 22993 states and 29119 transitions. [2019-09-07 18:30:38,483 INFO L78 Accepts]: Start accepts. Automaton has 22993 states and 29119 transitions. Word has length 374 [2019-09-07 18:30:38,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:30:38,484 INFO L475 AbstractCegarLoop]: Abstraction has 22993 states and 29119 transitions. [2019-09-07 18:30:38,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:30:38,485 INFO L276 IsEmpty]: Start isEmpty. Operand 22993 states and 29119 transitions. [2019-09-07 18:30:38,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-07 18:30:38,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:30:38,524 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2019-09-07 18:30:38,524 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:30:38,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:30:38,525 INFO L82 PathProgramCache]: Analyzing trace with hash 951837952, now seen corresponding path program 1 times [2019-09-07 18:30:38,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:30:38,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:30:38,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:38,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:38,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:38,926 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 11 proven. 151 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2019-09-07 18:30:38,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:30:38,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:30:38,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:30:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:39,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 18:30:39,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:30:39,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:30:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 366 proven. 4 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-07 18:30:39,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:30:39,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-09-07 18:30:39,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 18:30:39,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 18:30:39,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-07 18:30:39,506 INFO L87 Difference]: Start difference. First operand 22993 states and 29119 transitions. Second operand 15 states. [2019-09-07 18:30:50,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:30:50,784 INFO L93 Difference]: Finished difference Result 63253 states and 84818 transitions. [2019-09-07 18:30:50,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-07 18:30:50,785 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 413 [2019-09-07 18:30:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:30:50,910 INFO L225 Difference]: With dead ends: 63253 [2019-09-07 18:30:50,910 INFO L226 Difference]: Without dead ends: 42786 [2019-09-07 18:30:50,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2801 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1154, Invalid=6328, Unknown=0, NotChecked=0, Total=7482 [2019-09-07 18:30:50,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42786 states. [2019-09-07 18:30:52,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42786 to 40362. [2019-09-07 18:30:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40362 states. [2019-09-07 18:30:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40362 states to 40362 states and 51061 transitions. [2019-09-07 18:30:52,667 INFO L78 Accepts]: Start accepts. Automaton has 40362 states and 51061 transitions. Word has length 413 [2019-09-07 18:30:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:30:52,668 INFO L475 AbstractCegarLoop]: Abstraction has 40362 states and 51061 transitions. [2019-09-07 18:30:52,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 18:30:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 40362 states and 51061 transitions. [2019-09-07 18:30:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-09-07 18:30:52,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:30:52,709 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:30:52,709 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:30:52,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:30:52,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1822686214, now seen corresponding path program 1 times [2019-09-07 18:30:52,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:30:52,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:30:52,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:52,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:52,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 377 proven. 2 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-07 18:30:53,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:30:53,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:30:53,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:30:53,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 18:30:53,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:30:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 155 proven. 6 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2019-09-07 18:30:53,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:30:53,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-07 18:30:53,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 18:30:53,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 18:30:53,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-07 18:30:53,693 INFO L87 Difference]: Start difference. First operand 40362 states and 51061 transitions. Second operand 11 states. [2019-09-07 18:30:58,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:30:58,077 INFO L93 Difference]: Finished difference Result 84928 states and 108804 transitions. [2019-09-07 18:30:58,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 18:30:58,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 418 [2019-09-07 18:30:58,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:30:58,202 INFO L225 Difference]: With dead ends: 84928 [2019-09-07 18:30:58,202 INFO L226 Difference]: Without dead ends: 49424 [2019-09-07 18:30:58,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2019-09-07 18:30:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49424 states. [2019-09-07 18:30:58,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49424 to 43852. [2019-09-07 18:30:58,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43852 states. [2019-09-07 18:30:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43852 states to 43852 states and 54047 transitions. [2019-09-07 18:30:59,035 INFO L78 Accepts]: Start accepts. Automaton has 43852 states and 54047 transitions. Word has length 418 [2019-09-07 18:30:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:30:59,035 INFO L475 AbstractCegarLoop]: Abstraction has 43852 states and 54047 transitions. [2019-09-07 18:30:59,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 18:30:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 43852 states and 54047 transitions. [2019-09-07 18:30:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-09-07 18:30:59,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:30:59,072 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:30:59,072 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:30:59,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:30:59,073 INFO L82 PathProgramCache]: Analyzing trace with hash -88511718, now seen corresponding path program 1 times [2019-09-07 18:30:59,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:30:59,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:30:59,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:59,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:59,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:31:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 256 proven. 107 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-09-07 18:31:00,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:31:00,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:31:00,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:31:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:31:00,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:31:00,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:31:00,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:31:00,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:31:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 332 proven. 106 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-07 18:31:02,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:31:02,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 9 [2019-09-07 18:31:02,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:31:02,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:31:02,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=53, Unknown=1, NotChecked=0, Total=72 [2019-09-07 18:31:02,638 INFO L87 Difference]: Start difference. First operand 43852 states and 54047 transitions. Second operand 9 states. [2019-09-07 18:31:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:31:59,002 INFO L93 Difference]: Finished difference Result 98668 states and 129494 transitions. [2019-09-07 18:31:59,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 18:31:59,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 423 [2019-09-07 18:31:59,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:31:59,123 INFO L225 Difference]: With dead ends: 98668 [2019-09-07 18:31:59,124 INFO L226 Difference]: Without dead ends: 55200 [2019-09-07 18:31:59,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 433 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=130, Invalid=370, Unknown=6, NotChecked=0, Total=506 [2019-09-07 18:31:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55200 states. [2019-09-07 18:32:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55200 to 53977. [2019-09-07 18:32:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53977 states. [2019-09-07 18:32:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53977 states to 53977 states and 67823 transitions. [2019-09-07 18:32:00,305 INFO L78 Accepts]: Start accepts. Automaton has 53977 states and 67823 transitions. Word has length 423 [2019-09-07 18:32:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:32:00,307 INFO L475 AbstractCegarLoop]: Abstraction has 53977 states and 67823 transitions. [2019-09-07 18:32:00,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:32:00,307 INFO L276 IsEmpty]: Start isEmpty. Operand 53977 states and 67823 transitions. [2019-09-07 18:32:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2019-09-07 18:32:00,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:32:00,349 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:32:00,350 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:32:00,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:32:00,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1397117085, now seen corresponding path program 1 times [2019-09-07 18:32:00,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:32:00,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:32:00,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:00,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:00,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 453 proven. 174 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-07 18:32:01,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:32:01,702 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:32:01,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:01,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:32:01,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:32:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 469 proven. 2 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:32:02,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:32:02,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 21 [2019-09-07 18:32:02,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 18:32:02,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 18:32:02,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-09-07 18:32:02,173 INFO L87 Difference]: Start difference. First operand 53977 states and 67823 transitions. Second operand 21 states. [2019-09-07 18:32:08,788 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2019-09-07 18:32:18,719 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2019-09-07 18:32:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:32:26,027 INFO L93 Difference]: Finished difference Result 113951 states and 148827 transitions. [2019-09-07 18:32:26,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-07 18:32:26,027 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 456 [2019-09-07 18:32:26,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:32:26,236 INFO L225 Difference]: With dead ends: 113951 [2019-09-07 18:32:26,236 INFO L226 Difference]: Without dead ends: 59364 [2019-09-07 18:32:26,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8296 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=2753, Invalid=19003, Unknown=0, NotChecked=0, Total=21756 [2019-09-07 18:32:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59364 states. [2019-09-07 18:32:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59364 to 53186. [2019-09-07 18:32:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53186 states. [2019-09-07 18:32:27,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53186 states to 53186 states and 65191 transitions. [2019-09-07 18:32:27,785 INFO L78 Accepts]: Start accepts. Automaton has 53186 states and 65191 transitions. Word has length 456 [2019-09-07 18:32:27,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:32:27,786 INFO L475 AbstractCegarLoop]: Abstraction has 53186 states and 65191 transitions. [2019-09-07 18:32:27,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 18:32:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 53186 states and 65191 transitions. [2019-09-07 18:32:27,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-09-07 18:32:27,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:32:27,854 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:32:27,855 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:32:27,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:32:27,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1275200198, now seen corresponding path program 1 times [2019-09-07 18:32:27,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:32:27,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:32:27,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:27,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:27,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 413 proven. 127 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-07 18:32:28,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:32:28,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:32:28,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:28,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:32:28,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:32:28,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 688 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-07 18:32:28,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:32:28,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 18:32:28,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:32:28,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:32:28,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:32:28,715 INFO L87 Difference]: Start difference. First operand 53186 states and 65191 transitions. Second operand 9 states. [2019-09-07 18:32:31,771 WARN L188 SmtUtils]: Spent 818.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-09-07 18:32:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:32:34,938 INFO L93 Difference]: Finished difference Result 103799 states and 135086 transitions. [2019-09-07 18:32:34,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 18:32:34,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 526 [2019-09-07 18:32:34,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:32:35,049 INFO L225 Difference]: With dead ends: 103799 [2019-09-07 18:32:35,050 INFO L226 Difference]: Without dead ends: 49175 [2019-09-07 18:32:35,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=354, Invalid=1452, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 18:32:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49175 states. [2019-09-07 18:32:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49175 to 43532. [2019-09-07 18:32:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43532 states. [2019-09-07 18:32:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43532 states to 43532 states and 49353 transitions. [2019-09-07 18:32:35,770 INFO L78 Accepts]: Start accepts. Automaton has 43532 states and 49353 transitions. Word has length 526 [2019-09-07 18:32:35,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:32:35,771 INFO L475 AbstractCegarLoop]: Abstraction has 43532 states and 49353 transitions. [2019-09-07 18:32:35,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:32:35,771 INFO L276 IsEmpty]: Start isEmpty. Operand 43532 states and 49353 transitions. [2019-09-07 18:32:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2019-09-07 18:32:35,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:32:35,799 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:32:35,799 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:32:35,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:32:35,799 INFO L82 PathProgramCache]: Analyzing trace with hash 171936932, now seen corresponding path program 1 times [2019-09-07 18:32:35,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:32:35,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:32:35,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:35,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:35,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 211 proven. 21 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2019-09-07 18:32:36,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:32:36,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:32:36,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:32:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:36,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:32:36,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:32:36,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 788 proven. 2 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-07 18:32:37,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:32:37,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-07 18:32:37,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 18:32:37,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 18:32:37,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-09-07 18:32:37,092 INFO L87 Difference]: Start difference. First operand 43532 states and 49353 transitions. Second operand 15 states. [2019-09-07 18:32:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:32:47,952 INFO L93 Difference]: Finished difference Result 100341 states and 114398 transitions. [2019-09-07 18:32:47,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-07 18:32:47,953 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 622 [2019-09-07 18:32:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:32:48,046 INFO L225 Difference]: With dead ends: 100341 [2019-09-07 18:32:48,046 INFO L226 Difference]: Without dead ends: 58367 [2019-09-07 18:32:48,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 696 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3817 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1485, Invalid=8415, Unknown=0, NotChecked=0, Total=9900 [2019-09-07 18:32:48,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58367 states. [2019-09-07 18:32:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58367 to 53938. [2019-09-07 18:32:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53938 states. [2019-09-07 18:32:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53938 states to 53938 states and 60602 transitions. [2019-09-07 18:32:48,733 INFO L78 Accepts]: Start accepts. Automaton has 53938 states and 60602 transitions. Word has length 622 [2019-09-07 18:32:48,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:32:48,734 INFO L475 AbstractCegarLoop]: Abstraction has 53938 states and 60602 transitions. [2019-09-07 18:32:48,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 18:32:48,734 INFO L276 IsEmpty]: Start isEmpty. Operand 53938 states and 60602 transitions. [2019-09-07 18:32:48,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2019-09-07 18:32:48,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:32:48,775 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 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, 1, 1, 1] [2019-09-07 18:32:48,775 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:32:48,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:32:48,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1486545977, now seen corresponding path program 1 times [2019-09-07 18:32:48,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:32:48,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:32:48,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:48,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:48,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 694 proven. 213 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-09-07 18:32:50,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:32:50,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:32:50,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:50,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 18:32:50,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:32:50,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:32:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 718 proven. 2 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-09-07 18:32:50,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:32:50,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 18:32:50,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 18:32:50,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 18:32:50,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-07 18:32:50,999 INFO L87 Difference]: Start difference. First operand 53938 states and 60602 transitions. Second operand 10 states. [2019-09-07 18:32:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:32:57,282 INFO L93 Difference]: Finished difference Result 114749 states and 129046 transitions. [2019-09-07 18:32:57,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 18:32:57,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 698 [2019-09-07 18:32:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:32:57,444 INFO L225 Difference]: With dead ends: 114749 [2019-09-07 18:32:57,445 INFO L226 Difference]: Without dead ends: 64909 [2019-09-07 18:32:57,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 722 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=1150, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 18:32:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2019-09-07 18:32:58,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 61880. [2019-09-07 18:32:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61880 states. [2019-09-07 18:32:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61880 states to 61880 states and 68819 transitions. [2019-09-07 18:32:58,412 INFO L78 Accepts]: Start accepts. Automaton has 61880 states and 68819 transitions. Word has length 698 [2019-09-07 18:32:58,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:32:58,413 INFO L475 AbstractCegarLoop]: Abstraction has 61880 states and 68819 transitions. [2019-09-07 18:32:58,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 18:32:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 61880 states and 68819 transitions. [2019-09-07 18:32:58,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2019-09-07 18:32:58,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:32:58,442 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:32:58,442 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:32:58,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:32:58,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1265657003, now seen corresponding path program 1 times [2019-09-07 18:32:58,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:32:58,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:32:58,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:58,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:58,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 582 proven. 107 refuted. 0 times theorem prover too weak. 796 trivial. 0 not checked. [2019-09-07 18:32:59,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:32:59,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:32:59,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:59,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 1115 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:32:59,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:32:59,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:59,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:33:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 1008 proven. 2 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2019-09-07 18:33:00,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:33:00,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 18:33:00,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:33:00,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:33:00,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:33:00,261 INFO L87 Difference]: Start difference. First operand 61880 states and 68819 transitions. Second operand 6 states. [2019-09-07 18:33:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:33:01,690 INFO L93 Difference]: Finished difference Result 93772 states and 103847 transitions. [2019-09-07 18:33:01,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 18:33:01,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 774 [2019-09-07 18:33:01,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:33:01,740 INFO L225 Difference]: With dead ends: 93772 [2019-09-07 18:33:01,740 INFO L226 Difference]: Without dead ends: 36758 [2019-09-07 18:33:01,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 786 GetRequests, 777 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-07 18:33:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36758 states. [2019-09-07 18:33:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36758 to 35954. [2019-09-07 18:33:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35954 states. [2019-09-07 18:33:02,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35954 states to 35954 states and 39471 transitions. [2019-09-07 18:33:02,181 INFO L78 Accepts]: Start accepts. Automaton has 35954 states and 39471 transitions. Word has length 774 [2019-09-07 18:33:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:33:02,182 INFO L475 AbstractCegarLoop]: Abstraction has 35954 states and 39471 transitions. [2019-09-07 18:33:02,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:33:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 35954 states and 39471 transitions. [2019-09-07 18:33:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2019-09-07 18:33:02,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:33:02,212 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:33:02,212 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:33:02,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:33:02,213 INFO L82 PathProgramCache]: Analyzing trace with hash 660333764, now seen corresponding path program 1 times [2019-09-07 18:33:02,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:33:02,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:33:02,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:33:02,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:33:02,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:33:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:33:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1644 backedges. 11 proven. 290 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-09-07 18:33:03,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:33:03,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:33:03,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:33:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:33:03,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 18:33:03,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:33:04,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 18:33:04,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:33:04,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:33:04,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:33:05,280 WARN L188 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-07 18:33:05,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 18:33:05,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:33:05,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:33:05,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:33:05,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:33:05,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:33:05,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:33:05,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:33:05,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:33:05,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:33:05,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:33:05,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:33:05,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 18:33:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1644 backedges. 1162 proven. 57 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2019-09-07 18:33:06,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:33:06,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-09-07 18:33:06,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 18:33:06,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 18:33:06,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-07 18:33:06,999 INFO L87 Difference]: Start difference. First operand 35954 states and 39471 transitions. Second operand 22 states. [2019-09-07 18:33:11,158 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-07 18:33:17,655 WARN L188 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-07 18:33:21,020 WARN L188 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2019-09-07 18:33:22,393 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-09-07 18:33:27,157 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-09-07 18:33:31,843 WARN L188 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2019-09-07 18:33:36,012 WARN L188 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-07 18:33:38,324 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-07 18:33:40,963 WARN L188 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-07 18:33:44,720 WARN L188 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2019-09-07 18:33:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:33:47,492 INFO L93 Difference]: Finished difference Result 72230 states and 80053 transitions. [2019-09-07 18:33:47,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2019-09-07 18:33:47,492 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 824 [2019-09-07 18:33:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:33:47,563 INFO L225 Difference]: With dead ends: 72230 [2019-09-07 18:33:47,564 INFO L226 Difference]: Without dead ends: 45918 [2019-09-07 18:33:47,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1013 GetRequests, 822 SyntacticMatches, 1 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15128 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=3625, Invalid=33047, Unknown=0, NotChecked=0, Total=36672 [2019-09-07 18:33:47,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45918 states. [2019-09-07 18:33:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45918 to 40966. [2019-09-07 18:33:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40966 states. [2019-09-07 18:33:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40966 states to 40966 states and 44687 transitions. [2019-09-07 18:33:48,143 INFO L78 Accepts]: Start accepts. Automaton has 40966 states and 44687 transitions. Word has length 824 [2019-09-07 18:33:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:33:48,144 INFO L475 AbstractCegarLoop]: Abstraction has 40966 states and 44687 transitions. [2019-09-07 18:33:48,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 18:33:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 40966 states and 44687 transitions. [2019-09-07 18:33:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1129 [2019-09-07 18:33:48,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:33:48,181 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:33:48,181 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:33:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:33:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1122374233, now seen corresponding path program 1 times [2019-09-07 18:33:48,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:33:48,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:33:48,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:33:48,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:33:48,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:33:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:33:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3604 backedges. 1153 proven. 2 refuted. 0 times theorem prover too weak. 2449 trivial. 0 not checked. [2019-09-07 18:33:50,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:33:50,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:33:50,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:33:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:33:50,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 1590 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:33:50,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:33:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3604 backedges. 1153 proven. 2 refuted. 0 times theorem prover too weak. 2449 trivial. 0 not checked. [2019-09-07 18:33:51,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:33:51,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 18:33:51,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 18:33:51,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 18:33:51,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-07 18:33:51,187 INFO L87 Difference]: Start difference. First operand 40966 states and 44687 transitions. Second operand 10 states. [2019-09-07 18:33:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:33:54,162 INFO L93 Difference]: Finished difference Result 73632 states and 80501 transitions. [2019-09-07 18:33:54,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 18:33:54,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1128 [2019-09-07 18:33:54,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:33:54,164 INFO L225 Difference]: With dead ends: 73632 [2019-09-07 18:33:54,164 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 18:33:54,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1165 GetRequests, 1139 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2019-09-07 18:33:54,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 18:33:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 18:33:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 18:33:54,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 18:33:54,218 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1128 [2019-09-07 18:33:54,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:33:54,219 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 18:33:54,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 18:33:54,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 18:33:54,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 18:33:54,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 18:34:15,747 WARN L188 SmtUtils]: Spent 18.86 s on a formula simplification. DAG size of input: 3389 DAG size of output: 3023 [2019-09-07 18:34:33,952 WARN L188 SmtUtils]: Spent 18.20 s on a formula simplification. DAG size of input: 3389 DAG size of output: 3023 [2019-09-07 18:34:34,091 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 38 [2019-09-07 18:34:50,858 WARN L188 SmtUtils]: Spent 16.64 s on a formula simplification. DAG size of input: 1348 DAG size of output: 216 [2019-09-07 18:37:34,020 WARN L188 SmtUtils]: Spent 2.72 m on a formula simplification. DAG size of input: 2952 DAG size of output: 198 [2019-09-07 18:40:18,126 WARN L188 SmtUtils]: Spent 2.73 m on a formula simplification. DAG size of input: 2952 DAG size of output: 198 [2019-09-07 18:40:18,128 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 18:40:18,128 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a29~0 |old(~a29~0)|) (= ~a23~0 |old(~a23~0)|) (= ~a4~0 |old(~a4~0)|) (= ~a25~0 |old(~a25~0)|)) [2019-09-07 18:40:18,129 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 18:40:18,129 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-09-07 18:40:18,129 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-09-07 18:40:18,129 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-09-07 18:40:18,129 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,129 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,129 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,129 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,129 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,129 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,129 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,129 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-09-07 18:40:18,129 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-09-07 18:40:18,130 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-09-07 18:40:18,130 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,130 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,130 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,130 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,130 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,130 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,130 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,130 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,130 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,130 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-09-07 18:40:18,130 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-09-07 18:40:18,130 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-09-07 18:40:18,130 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,130 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,131 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,131 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,131 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,131 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,131 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,131 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,131 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,131 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-09-07 18:40:18,131 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-09-07 18:40:18,131 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-09-07 18:40:18,131 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-09-07 18:40:18,131 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-09-07 18:40:18,131 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-09-07 18:40:18,131 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-09-07 18:40:18,132 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,132 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,132 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,132 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,132 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,132 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,132 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,132 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,132 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,132 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,132 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-09-07 18:40:18,133 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-09-07 18:40:18,133 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-09-07 18:40:18,133 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,133 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,133 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,133 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,133 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,133 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-09-07 18:40:18,133 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-09-07 18:40:18,134 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-09-07 18:40:18,134 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,134 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,134 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,134 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,134 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,134 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-09-07 18:40:18,134 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-09-07 18:40:18,134 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,134 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,134 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,134 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,134 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,134 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,135 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-09-07 18:40:18,135 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-09-07 18:40:18,135 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,135 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,135 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-09-07 18:40:18,135 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-09-07 18:40:18,135 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-09-07 18:40:18,135 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,135 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,135 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,135 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,135 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,135 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,135 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,135 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-09-07 18:40:18,136 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-09-07 18:40:18,136 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-09-07 18:40:18,136 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-09-07 18:40:18,136 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-09-07 18:40:18,136 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-09-07 18:40:18,136 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-09-07 18:40:18,136 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,136 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,136 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-09-07 18:40:18,136 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-09-07 18:40:18,136 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,136 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,136 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,136 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,137 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 22 1026) the Hoare annotation is: (let ((.cse38 (+ |old(~a23~0)| 599772))) (let ((.cse35 (= 1 |old(~a4~0)|)) (.cse40 (not (<= |old(~a23~0)| 137))) (.cse41 (not (<= 0 .cse38)))) (let ((.cse31 (<= |old(~a29~0)| ~a29~0)) (.cse28 (<= ~a29~0 |old(~a29~0)|)) (.cse4 (not (= 15 ~a8~0))) (.cse5 (not (= 1 ~a3~0))) (.cse22 (or .cse40 .cse41)) (.cse37 (= ~a29~0 |old(~a29~0)|)) (.cse27 (= ~a23~0 |old(~a23~0)|)) (.cse29 (= ~a4~0 |old(~a4~0)|)) (.cse30 (= ~a25~0 |old(~a25~0)|)) (.cse21 (forall ((v_~a29~0_506 Int)) (let ((.cse42 (* 12 v_~a29~0_506))) (let ((.cse43 (div .cse42 10))) (or (not (<= 0 .cse42)) (not (<= 0 .cse43)) (not (< 245 v_~a29~0_506)) (not (<= (+ (div .cse43 5) 99853) |old(~a29~0)|)) (not (<= 0 (+ .cse43 1)))))))) (.cse39 (= 13 |old(~a25~0)|)) (.cse2 (not .cse35))) (let ((.cse13 (or (or .cse40 .cse21 .cse39 .cse41) .cse2)) (.cse3 (not .cse39)) (.cse17 (and (and .cse37 .cse27) .cse29 .cse30)) (.cse25 (and .cse37 .cse27 .cse29 .cse30)) (.cse0 (not (<= |old(~a29~0)| 245))) (.cse1 (not (< 140 |old(~a29~0)|))) (.cse23 (and (and (and (<= 0 (+ ~a23~0 599772)) (<= ~a23~0 137)) .cse27) .cse37 .cse29 .cse30)) (.cse7 (not (<= |old(~a23~0)| 312))) (.cse33 (not (= 11 |old(~a25~0)|))) (.cse20 (not (<= 12 |old(~a25~0)|))) (.cse19 (not (= 10 |old(~a25~0)|))) (.cse34 (not (<= |old(~a29~0)| 140))) (.cse24 (or .cse4 .cse5 .cse22 .cse2)) (.cse15 (not (<= |old(~a29~0)| 130))) (.cse9 (not (<= 0 (+ |old(~a23~0)| 386870)))) (.cse8 (not (= 12 |old(~a25~0)|))) (.cse12 (not (<= (+ |old(~a23~0)| 55) 0))) (.cse36 (not (<= |old(~a29~0)| 275))) (.cse14 (not (<= |old(~a25~0)| 9))) (.cse11 (not (<= 246 |old(~a29~0)|))) (.cse16 (not (<= 0 (+ |old(~a23~0)| 599992)))) (.cse26 (not (<= .cse38 0))) (.cse6 (and .cse27 .cse31 .cse28 .cse29 .cse30)) (.cse10 (not (< 306 |old(~a23~0)|))) (.cse18 (not (<= |old(~a23~0)| 600000))) (.cse32 (not (<= |old(~a25~0)| 10)))) (and (or (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~a23~0)| 138))) .cse4 .cse5 .cse6) (or .cse6 (or .cse7 .cse4 .cse5 .cse2) .cse8 .cse9) (or .cse4 .cse5 (or .cse7 .cse10) .cse6 .cse2 .cse11) (or .cse12 .cse13 .cse4 .cse5 .cse6) (or (or .cse12 (or .cse4 .cse5 .cse14 .cse15 .cse16)) .cse17) (or .cse11 .cse9 .cse7 .cse4 .cse5 .cse14 .cse2 .cse6) (or .cse11 .cse4 .cse5 (not (<= 312 |old(~a23~0)|)) .cse2 .cse18 .cse6) (or .cse12 .cse19 .cse4 .cse5 .cse6 .cse15) (or .cse6 (or .cse12 .cse4 .cse5 .cse0 .cse1 .cse8 .cse16)) (or (forall ((v_~a29~0_514 Int)) (or (not (< 140 v_~a29~0_514)) (not (<= (+ (mod v_~a29~0_514 299861) 10250) |old(~a29~0)|)) (not (<= 0 v_~a29~0_514)))) (not (= 9 |old(~a25~0)|)) .cse6 .cse12 .cse4 .cse5) (or .cse9 .cse7 .cse20 .cse4 .cse5 .cse21 .cse2 .cse6) (or .cse4 .cse5 .cse14 .cse22 .cse2 .cse11 .cse23) (or (or .cse24 .cse14) .cse6 .cse9) (or .cse20 .cse2 .cse25 .cse26 (not (<= |old(~a29~0)| 220))) (or (and (and .cse27 .cse28 .cse29 .cse30) .cse31) (or .cse12 .cse4 .cse5 .cse2 .cse32) .cse9) (or .cse12 (or .cse4 .cse5 (forall ((v_~a29~0_509 Int)) (or (not (<= |old(~a29~0)| (+ (mod v_~a29~0_509 15) 260))) (not (<= |old(~a29~0)| v_~a29~0_509)) (not (<= 0 v_~a29~0_509))))) .cse11 .cse8 .cse28) (or .cse13 .cse6 .cse4 .cse5 .cse33) (or (or .cse7 .cse2 .cse3 .cse15) .cse4 .cse5 .cse17 .cse9) (or .cse12 (or .cse21 .cse2 .cse32) .cse6 .cse4 .cse5) (or .cse12 .cse19 .cse25 .cse4 .cse5 .cse34 .cse2) (or .cse6 (or (or .cse4 .cse5 .cse0 .cse1 .cse2) .cse18 .cse32)) (or .cse33 .cse35 .cse12 .cse4 .cse5 .cse6 .cse15) (or .cse4 .cse5 .cse0 .cse1 .cse22 .cse2 .cse23) (or .cse9 .cse7 .cse4 .cse5 .cse14 .cse2 .cse6 .cse15) (or .cse33 .cse6 .cse11 .cse9 .cse4 .cse5 .cse2 .cse18 .cse36) (or .cse20 .cse4 .cse5 .cse10 .cse6 .cse2 .cse18) (or .cse19 (and .cse27 (and .cse37 .cse29) .cse30) .cse34 .cse24) (or .cse6 (or (or .cse12 .cse4 .cse5 .cse15) .cse8 .cse9)) (or (and .cse27 .cse31 (<= ~a29~0 275) .cse29 .cse30) .cse11 .cse8 .cse12 .cse4 .cse5 .cse36) (or (or .cse4 .cse5 .cse14 .cse2 .cse11 .cse16) (and .cse27 (and .cse37 .cse29 .cse30)) .cse26) (or .cse6 .cse4 .cse5 .cse10 .cse2 .cse18 .cse32)))))) [2019-09-07 18:40:18,137 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,137 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-09-07 18:40:18,137 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-09-07 18:40:18,137 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-09-07 18:40:18,137 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,137 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,137 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,137 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,138 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,138 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,138 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-09-07 18:40:18,138 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-09-07 18:40:18,138 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-09-07 18:40:18,138 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,138 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,138 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,138 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,138 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,138 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,139 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,139 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,139 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-09-07 18:40:18,139 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-09-07 18:40:18,139 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-09-07 18:40:18,139 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,139 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,139 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,139 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,140 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,140 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,140 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,140 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,140 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,140 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,140 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,140 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-09-07 18:40:18,141 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-09-07 18:40:18,141 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-09-07 18:40:18,141 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-09-07 18:40:18,141 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-09-07 18:40:18,141 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,141 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,141 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,141 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,141 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,142 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,142 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,142 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-09-07 18:40:18,142 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-09-07 18:40:18,142 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-09-07 18:40:18,142 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,142 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,142 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,142 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-09-07 18:40:18,143 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-09-07 18:40:18,143 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 156) no Hoare annotation was computed. [2019-09-07 18:40:18,143 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,143 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,143 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,143 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,143 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,143 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-09-07 18:40:18,143 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-09-07 18:40:18,144 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,144 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,144 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-09-07 18:40:18,144 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-09-07 18:40:18,144 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,144 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,144 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,144 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,144 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,145 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,145 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-09-07 18:40:18,145 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-09-07 18:40:18,145 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-09-07 18:40:18,145 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-09-07 18:40:18,145 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,145 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,145 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,145 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,145 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,146 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,146 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,146 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,146 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-09-07 18:40:18,146 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-09-07 18:40:18,146 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-09-07 18:40:18,146 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-09-07 18:40:18,146 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-09-07 18:40:18,146 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-09-07 18:40:18,146 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,147 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,147 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,147 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,147 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,147 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,147 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,147 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-09-07 18:40:18,147 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-09-07 18:40:18,147 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,147 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,148 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,148 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,148 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,148 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,148 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,148 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-09-07 18:40:18,148 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-09-07 18:40:18,148 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,148 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,149 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,149 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,149 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,149 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,149 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,149 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-09-07 18:40:18,149 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,149 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,149 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,149 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-09-07 18:40:18,150 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-09-07 18:40:18,150 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-09-07 18:40:18,150 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,150 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-09-07 18:40:18,150 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,150 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-09-07 18:40:18,150 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,150 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,150 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,150 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,151 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,151 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,151 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-09-07 18:40:18,151 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-09-07 18:40:18,151 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-09-07 18:40:18,151 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,151 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,151 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,151 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,152 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,152 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,152 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,152 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,152 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,152 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,152 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-09-07 18:40:18,152 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-09-07 18:40:18,153 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-09-07 18:40:18,153 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,153 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-09-07 18:40:18,153 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-09-07 18:40:18,153 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,153 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,153 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,153 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,153 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,154 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,154 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-09-07 18:40:18,154 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-09-07 18:40:18,154 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-09-07 18:40:18,154 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,154 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,154 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,154 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,154 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-09-07 18:40:18,155 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-09-07 18:40:18,155 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,155 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,155 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-09-07 18:40:18,155 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,155 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,155 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:40:18,155 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 18:40:18,155 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~a23~0 312) (= 1 ~a3~0) (<= ~a29~0 130) (= 15 ~a8~0) (= 1 ~a4~0) (<= 130 ~a29~0) (= ~a25~0 10) (<= 312 ~a23~0)) [2019-09-07 18:40:18,156 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 18:40:18,156 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 18:40:18,156 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1028 1044) the Hoare annotation is: (or (not (= 10 |old(~a25~0)|)) (not (<= 130 |old(~a29~0)|)) (and (= ~a23~0 |old(~a23~0)|) (<= 130 ~a29~0) (<= ~a29~0 130) (= ~a4~0 |old(~a4~0)|) (= ~a25~0 |old(~a25~0)|)) (not (<= |old(~a23~0)| 312)) (not (= 15 ~a8~0)) (not (= 1 ~a3~0)) (not (<= 312 |old(~a23~0)|)) (not (= 1 |old(~a4~0)|)) (not (<= |old(~a29~0)| 130))) [2019-09-07 18:40:18,156 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1028 1044) no Hoare annotation was computed. [2019-09-07 18:40:18,157 INFO L439 ceAbstractionStarter]: At program point L1042(line 1042) the Hoare annotation is: (let ((.cse27 (<= 307 |old(~a23~0)|)) (.cse22 (= ~a25~0 13))) (let ((.cse21 (<= ~a23~0 312)) (.cse6 (<= ~a29~0 130)) (.cse23 (<= 0 (+ ~a23~0 599772))) (.cse13 (exists ((v_~a29~0_506 Int)) (let ((.cse32 (* 12 v_~a29~0_506))) (let ((.cse31 (div .cse32 10))) (and (<= 0 .cse31) (<= (+ (div .cse31 5) 99853) ~a29~0) (<= 0 (+ .cse31 1)) (< 245 v_~a29~0_506) (<= 0 .cse32)))))) (.cse28 (not .cse22)) (.cse30 (<= ~a23~0 137)) (.cse29 (or (and (<= |old(~a25~0)| 13) .cse27) (<= |old(~a25~0)| 9))) (.cse8 (= 1 ~a4~0))) (let ((.cse10 (<= ~a29~0 275)) (.cse1 (and (<= |old(~a29~0)| 140) (and (and .cse27 .cse23 .cse13 .cse28 .cse30) .cse29) .cse8)) (.cse12 (= ~a25~0 12)) (.cse20 (<= 312 ~a23~0)) (.cse18 (<= 0 (+ ~a23~0 599992))) (.cse3 (and .cse29 (and (and .cse27 .cse23 .cse30) .cse8))) (.cse0 (<= (+ ~a23~0 55) 0)) (.cse16 (= ~a25~0 11)) (.cse24 (and .cse27 .cse28 .cse6 .cse30 .cse29)) (.cse2 (< 140 ~a29~0)) (.cse4 (<= ~a29~0 245)) (.cse7 (<= ~a23~0 600000)) (.cse25 (< 306 ~a23~0)) (.cse9 (<= ~a25~0 10)) (.cse5 (= ~a25~0 10)) (.cse26 (<= ~a29~0 140)) (.cse11 (<= 246 ~a29~0)) (.cse14 (<= ~a25~0 9)) (.cse17 (and (and .cse21 (and .cse27 .cse23 .cse28) .cse29) (<= 130 ~a29~0))) (.cse15 (<= 0 (+ ~a23~0 386870))) (.cse19 (<= 12 ~a25~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (not (<= 130 |old(~a29~0)|)) (not (<= 312 |old(~a23~0)|)) (not (= 10 |old(~a25~0)|)) (and .cse0 .cse5 .cse6) (and .cse7 (and (and .cse2 .cse8 .cse4) .cse9)) (and .cse10 .cse0 (and .cse11 .cse12)) (and .cse0 (and (and .cse13 .cse8) .cse9)) (and (and .cse14 .cse3) .cse15) (not (<= |old(~a29~0)| 130)) (and .cse16 (and .cse10 (and (and .cse17 (= ~a4~0 |old(~a4~0)|)) .cse11) .cse15)) (and (and .cse0 (and .cse12 .cse6)) .cse15) (not (= 1 |old(~a4~0)|)) (and (and (and .cse12 .cse18) .cse2 .cse4) .cse0) (and .cse1 .cse16) (and (and (and .cse19 (<= ~a29~0 220)) (<= (+ ~a23~0 600084) |old(~a23~0)|)) .cse8) (and .cse7 (and .cse11 (and .cse8 .cse20))) (and (and (and .cse6 .cse21) .cse22 .cse8) .cse15) (and (and .cse8 .cse0 .cse9) .cse15) (and (and .cse23 .cse21 .cse6 .cse8) .cse14) (and (and (and .cse12 .cse21) .cse8) .cse15) (and (= ~a25~0 9) .cse0 (exists ((v_~a29~0_514 Int)) (and (<= 0 v_~a29~0_514) (<= (+ (mod v_~a29~0_514 299861) 10250) ~a29~0) (< 140 v_~a29~0_514)))) (and (and (and .cse24 .cse18) .cse14) .cse0) (and .cse7 (and (and .cse19 .cse20) .cse8)) (and .cse11 (and .cse21 (and .cse25 .cse8))) (and (and .cse19 .cse21 .cse25) .cse8) (not (<= |old(~a23~0)| 312)) (not (= 1 ~a3~0)) (and .cse0 (and (and .cse18 .cse8) .cse11 .cse14)) (and .cse3 .cse5 .cse26) (and .cse0 .cse16 (not .cse8) .cse24) (and .cse22 .cse2 (<= ~a23~0 138) .cse4 .cse8) (and .cse7 .cse8 .cse25 .cse9) (and .cse5 (and .cse8 (<= (+ ~a23~0 43) 0)) .cse26) (not (= 15 ~a8~0)) (and .cse11 .cse14 (and .cse17 .cse8)) (and .cse21 .cse15 (and (and .cse19 .cse13) .cse8)))))) [2019-09-07 18:40:18,157 INFO L443 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2019-09-07 18:40:18,157 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-09-07 18:40:18,158 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse27 (<= 307 |old(~a23~0)|)) (.cse22 (= ~a25~0 13))) (let ((.cse21 (<= ~a23~0 312)) (.cse6 (<= ~a29~0 130)) (.cse23 (<= 0 (+ ~a23~0 599772))) (.cse13 (exists ((v_~a29~0_506 Int)) (let ((.cse32 (* 12 v_~a29~0_506))) (let ((.cse31 (div .cse32 10))) (and (<= 0 .cse31) (<= (+ (div .cse31 5) 99853) ~a29~0) (<= 0 (+ .cse31 1)) (< 245 v_~a29~0_506) (<= 0 .cse32)))))) (.cse28 (not .cse22)) (.cse30 (<= ~a23~0 137)) (.cse29 (or (and (<= |old(~a25~0)| 13) .cse27) (<= |old(~a25~0)| 9))) (.cse8 (= 1 ~a4~0))) (let ((.cse10 (<= ~a29~0 275)) (.cse1 (and (<= |old(~a29~0)| 140) (and (and .cse27 .cse23 .cse13 .cse28 .cse30) .cse29) .cse8)) (.cse12 (= ~a25~0 12)) (.cse20 (<= 312 ~a23~0)) (.cse18 (<= 0 (+ ~a23~0 599992))) (.cse3 (and .cse29 (and (and .cse27 .cse23 .cse30) .cse8))) (.cse0 (<= (+ ~a23~0 55) 0)) (.cse16 (= ~a25~0 11)) (.cse24 (and .cse27 .cse28 .cse6 .cse30 .cse29)) (.cse2 (< 140 ~a29~0)) (.cse4 (<= ~a29~0 245)) (.cse7 (<= ~a23~0 600000)) (.cse25 (< 306 ~a23~0)) (.cse9 (<= ~a25~0 10)) (.cse5 (= ~a25~0 10)) (.cse26 (<= ~a29~0 140)) (.cse11 (<= 246 ~a29~0)) (.cse14 (<= ~a25~0 9)) (.cse17 (and (and .cse21 (and .cse27 .cse23 .cse28) .cse29) (<= 130 ~a29~0))) (.cse15 (<= 0 (+ ~a23~0 386870))) (.cse19 (<= 12 ~a25~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (not (<= 130 |old(~a29~0)|)) (not (<= 312 |old(~a23~0)|)) (not (= 10 |old(~a25~0)|)) (and .cse0 .cse5 .cse6) (and .cse7 (and (and .cse2 .cse8 .cse4) .cse9)) (and .cse10 .cse0 (and .cse11 .cse12)) (and .cse0 (and (and .cse13 .cse8) .cse9)) (and (and .cse14 .cse3) .cse15) (not (<= |old(~a29~0)| 130)) (and .cse16 (and .cse10 (and (and .cse17 (= ~a4~0 |old(~a4~0)|)) .cse11) .cse15)) (and (and .cse0 (and .cse12 .cse6)) .cse15) (not (= 1 |old(~a4~0)|)) (and (and (and .cse12 .cse18) .cse2 .cse4) .cse0) (and .cse1 .cse16) (and (and (and .cse19 (<= ~a29~0 220)) (<= (+ ~a23~0 600084) |old(~a23~0)|)) .cse8) (and .cse7 (and .cse11 (and .cse8 .cse20))) (and (and (and .cse6 .cse21) .cse22 .cse8) .cse15) (and (and .cse8 .cse0 .cse9) .cse15) (and (and .cse23 .cse21 .cse6 .cse8) .cse14) (and (and (and .cse12 .cse21) .cse8) .cse15) (and (= ~a25~0 9) .cse0 (exists ((v_~a29~0_514 Int)) (and (<= 0 v_~a29~0_514) (<= (+ (mod v_~a29~0_514 299861) 10250) ~a29~0) (< 140 v_~a29~0_514)))) (and (and (and .cse24 .cse18) .cse14) .cse0) (and .cse7 (and (and .cse19 .cse20) .cse8)) (and .cse11 (and .cse21 (and .cse25 .cse8))) (and (and .cse19 .cse21 .cse25) .cse8) (not (<= |old(~a23~0)| 312)) (not (= 1 ~a3~0)) (and .cse0 (and (and .cse18 .cse8) .cse11 .cse14)) (and .cse3 .cse5 .cse26) (and .cse0 .cse16 (not .cse8) .cse24) (and .cse22 .cse2 (<= ~a23~0 138) .cse4 .cse8) (and .cse7 .cse8 .cse25 .cse9) (and .cse5 (and .cse8 (<= (+ ~a23~0 43) 0)) .cse26) (not (= 15 ~a8~0)) (and .cse11 .cse14 (and .cse17 .cse8)) (and .cse21 .cse15 (and (and .cse19 .cse13) .cse8)))))) [2019-09-07 18:40:18,158 INFO L443 ceAbstractionStarter]: For program point L1034-3(lines 1028 1044) no Hoare annotation was computed. [2019-09-07 18:40:18,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:40:18,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:40:18,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:40:18,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,192 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,198 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,198 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,198 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,199 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:40:18,199 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:40:18,199 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:40:18,200 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,200 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 06:40:18 BoogieIcfgContainer [2019-09-07 18:40:18,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 18:40:18,207 INFO L168 Benchmark]: Toolchain (without parser) took 622482.77 ms. Allocated memory was 134.2 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 87.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-09-07 18:40:18,208 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 18:40:18,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1090.47 ms. Allocated memory was 134.2 MB in the beginning and 217.1 MB in the end (delta: 82.8 MB). Free memory was 87.3 MB in the beginning and 176.0 MB in the end (delta: -88.7 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2019-09-07 18:40:18,209 INFO L168 Benchmark]: Boogie Preprocessor took 165.10 ms. Allocated memory is still 217.1 MB. Free memory was 176.0 MB in the beginning and 168.1 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. [2019-09-07 18:40:18,210 INFO L168 Benchmark]: RCFGBuilder took 1909.71 ms. Allocated memory was 217.1 MB in the beginning and 278.4 MB in the end (delta: 61.3 MB). Free memory was 168.1 MB in the beginning and 179.0 MB in the end (delta: -10.9 MB). Peak memory consumption was 104.7 MB. Max. memory is 7.1 GB. [2019-09-07 18:40:18,211 INFO L168 Benchmark]: TraceAbstraction took 619310.45 ms. Allocated memory was 278.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 179.0 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-09-07 18:40:18,214 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1090.47 ms. Allocated memory was 134.2 MB in the beginning and 217.1 MB in the end (delta: 82.8 MB). Free memory was 87.3 MB in the beginning and 176.0 MB in the end (delta: -88.7 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 165.10 ms. Allocated memory is still 217.1 MB. Free memory was 176.0 MB in the beginning and 168.1 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1909.71 ms. Allocated memory was 217.1 MB in the beginning and 278.4 MB in the end (delta: 61.3 MB). Free memory was 168.1 MB in the beginning and 179.0 MB in the end (delta: -10.9 MB). Peak memory consumption was 104.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 619310.45 ms. Allocated memory was 278.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 179.0 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 156]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1034]: Loop Invariant [2019-09-07 18:40:18,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:40:18,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:40:18,231 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:40:18,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,240 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:40:18,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:40:18,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_514,QUANTIFIED] [2019-09-07 18:40:18,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-09-07 18:40:18,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((a23 + 55 <= 0 && (\old(a29) <= 140 && ((((307 <= \old(a23) && 0 <= a23 + 599772) && (\exists v_~a29~0_506 : int :: (((0 <= 12 * v_~a29~0_506 / 10 && 12 * v_~a29~0_506 / 10 / 5 + 99853 <= a29) && 0 <= 12 * v_~a29~0_506 / 10 + 1) && 245 < v_~a29~0_506) && 0 <= 12 * v_~a29~0_506)) && !(a25 == 13)) && a23 <= 137) && ((\old(a25) <= 13 && 307 <= \old(a23)) || \old(a25) <= 9)) && 1 == a4) || ((140 < a29 && ((\old(a25) <= 13 && 307 <= \old(a23)) || \old(a25) <= 9) && ((307 <= \old(a23) && 0 <= a23 + 599772) && a23 <= 137) && 1 == a4) && a29 <= 245)) || !(130 <= \old(a29))) || !(312 <= \old(a23))) || !(10 == \old(a25))) || ((a23 + 55 <= 0 && a25 == 10) && a29 <= 130)) || (a23 <= 600000 && ((140 < a29 && 1 == a4) && a29 <= 245) && a25 <= 10)) || ((a29 <= 275 && a23 + 55 <= 0) && 246 <= a29 && a25 == 12)) || (a23 + 55 <= 0 && ((\exists v_~a29~0_506 : int :: (((0 <= 12 * v_~a29~0_506 / 10 && 12 * v_~a29~0_506 / 10 / 5 + 99853 <= a29) && 0 <= 12 * v_~a29~0_506 / 10 + 1) && 245 < v_~a29~0_506) && 0 <= 12 * v_~a29~0_506) && 1 == a4) && a25 <= 10)) || ((a25 <= 9 && ((\old(a25) <= 13 && 307 <= \old(a23)) || \old(a25) <= 9) && ((307 <= \old(a23) && 0 <= a23 + 599772) && a23 <= 137) && 1 == a4) && 0 <= a23 + 386870)) || !(\old(a29) <= 130)) || (a25 == 11 && (a29 <= 275 && ((((a23 <= 312 && (307 <= \old(a23) && 0 <= a23 + 599772) && !(a25 == 13)) && ((\old(a25) <= 13 && 307 <= \old(a23)) || \old(a25) <= 9)) && 130 <= a29) && a4 == \old(a4)) && 246 <= a29) && 0 <= a23 + 386870)) || ((a23 + 55 <= 0 && a25 == 12 && a29 <= 130) && 0 <= a23 + 386870)) || !(1 == \old(a4))) || ((((a25 == 12 && 0 <= a23 + 599992) && 140 < a29) && a29 <= 245) && a23 + 55 <= 0)) || (((\old(a29) <= 140 && ((((307 <= \old(a23) && 0 <= a23 + 599772) && (\exists v_~a29~0_506 : int :: (((0 <= 12 * v_~a29~0_506 / 10 && 12 * v_~a29~0_506 / 10 / 5 + 99853 <= a29) && 0 <= 12 * v_~a29~0_506 / 10 + 1) && 245 < v_~a29~0_506) && 0 <= 12 * v_~a29~0_506)) && !(a25 == 13)) && a23 <= 137) && ((\old(a25) <= 13 && 307 <= \old(a23)) || \old(a25) <= 9)) && 1 == a4) && a25 == 11)) || (((12 <= a25 && a29 <= 220) && a23 + 600084 <= \old(a23)) && 1 == a4)) || (a23 <= 600000 && 246 <= a29 && 1 == a4 && 312 <= a23)) || ((((a29 <= 130 && a23 <= 312) && a25 == 13) && 1 == a4) && 0 <= a23 + 386870)) || (((1 == a4 && a23 + 55 <= 0) && a25 <= 10) && 0 <= a23 + 386870)) || ((((0 <= a23 + 599772 && a23 <= 312) && a29 <= 130) && 1 == a4) && a25 <= 9)) || (((a25 == 12 && a23 <= 312) && 1 == a4) && 0 <= a23 + 386870)) || ((a25 == 9 && a23 + 55 <= 0) && (\exists v_~a29~0_514 : int :: (0 <= v_~a29~0_514 && v_~a29~0_514 % 299861 + 10250 <= a29) && 140 < v_~a29~0_514))) || (((((((307 <= \old(a23) && !(a25 == 13)) && a29 <= 130) && a23 <= 137) && ((\old(a25) <= 13 && 307 <= \old(a23)) || \old(a25) <= 9)) && 0 <= a23 + 599992) && a25 <= 9) && a23 + 55 <= 0)) || (a23 <= 600000 && (12 <= a25 && 312 <= a23) && 1 == a4)) || (246 <= a29 && a23 <= 312 && 306 < a23 && 1 == a4)) || (((12 <= a25 && a23 <= 312) && 306 < a23) && 1 == a4)) || !(\old(a23) <= 312)) || !(1 == a3)) || (a23 + 55 <= 0 && ((0 <= a23 + 599992 && 1 == a4) && 246 <= a29) && a25 <= 9)) || (((((\old(a25) <= 13 && 307 <= \old(a23)) || \old(a25) <= 9) && ((307 <= \old(a23) && 0 <= a23 + 599772) && a23 <= 137) && 1 == a4) && a25 == 10) && a29 <= 140)) || (((a23 + 55 <= 0 && a25 == 11) && !(1 == a4)) && (((307 <= \old(a23) && !(a25 == 13)) && a29 <= 130) && a23 <= 137) && ((\old(a25) <= 13 && 307 <= \old(a23)) || \old(a25) <= 9))) || ((((a25 == 13 && 140 < a29) && a23 <= 138) && a29 <= 245) && 1 == a4)) || (((a23 <= 600000 && 1 == a4) && 306 < a23) && a25 <= 10)) || ((a25 == 10 && 1 == a4 && a23 + 43 <= 0) && a29 <= 140)) || !(15 == a8)) || ((246 <= a29 && a25 <= 9) && (((a23 <= 312 && (307 <= \old(a23) && 0 <= a23 + 599772) && !(a25 == 13)) && ((\old(a25) <= 13 && 307 <= \old(a23)) || \old(a25) <= 9)) && 130 <= a29) && 1 == a4)) || ((a23 <= 312 && 0 <= a23 + 386870) && (12 <= a25 && (\exists v_~a29~0_506 : int :: (((0 <= 12 * v_~a29~0_506 / 10 && 12 * v_~a29~0_506 / 10 / 5 + 99853 <= a29) && 0 <= 12 * v_~a29~0_506 / 10 + 1) && 245 < v_~a29~0_506) && 0 <= 12 * v_~a29~0_506)) && 1 == a4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 292 locations, 1 error locations. SAFE Result, 619.1s OverallTime, 18 OverallIterations, 9 TraceHistogramMax, 195.7s AutomataDifference, 0.0s DeadEndRemovalTime, 383.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1500 SDtfs, 52601 SDslu, 5271 SDs, 0 SdLazy, 84211 SolverSat, 20111 SolverUnsat, 46 SolverUnknown, 0 SolverNotchecked, 132.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8838 GetRequests, 7995 SyntacticMatches, 3 SemanticMatches, 840 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34915 ImplicationChecksByTransitivity, 43.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61880occurred in iteration=15, 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: 11.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 37807 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 2758 PreInvPairs, 3394 NumberOfFragments, 3477 HoareAnnotationTreeSize, 2758 FomulaSimplifications, 98856547 FormulaSimplificationTreeSizeReduction, 39.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 35596151 FormulaSimplificationTreeSizeReductionInter, 344.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 15774 NumberOfCodeBlocks, 15774 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 15741 ConstructedInterpolants, 61 QuantifiedInterpolants, 28566993 SizeOfPredicates, 21 NumberOfNonLiveVariables, 11931 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 33 InterpolantComputations, 5 PerfectInterpolantSequences, 25036/26526 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...