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_label02.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 18:15:54,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 18:15:54,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 18:15:54,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 18:15:54,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 18:15:54,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 18:15:54,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 18:15:54,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 18:15:54,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 18:15:54,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 18:15:54,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 18:15:54,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 18:15:54,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 18:15:54,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 18:15:54,774 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 18:15:54,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 18:15:54,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 18:15:54,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 18:15:54,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 18:15:54,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 18:15:54,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 18:15:54,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 18:15:54,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 18:15:54,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 18:15:54,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 18:15:54,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 18:15:54,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 18:15:54,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 18:15:54,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 18:15:54,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 18:15:54,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 18:15:54,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 18:15:54,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 18:15:54,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 18:15:54,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 18:15:54,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 18:15:54,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 18:15:54,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 18:15:54,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 18:15:54,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 18:15:54,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 18:15:54,823 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:15:54,847 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 18:15:54,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 18:15:54,849 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 18:15:54,850 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 18:15:54,850 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 18:15:54,850 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 18:15:54,850 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 18:15:54,851 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 18:15:54,851 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 18:15:54,851 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 18:15:54,852 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 18:15:54,852 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 18:15:54,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 18:15:54,853 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 18:15:54,853 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 18:15:54,853 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 18:15:54,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 18:15:54,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 18:15:54,854 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 18:15:54,854 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 18:15:54,854 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 18:15:54,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 18:15:54,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 18:15:54,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 18:15:54,855 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 18:15:54,856 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 18:15:54,856 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 18:15:54,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 18:15:54,856 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 18:15:54,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 18:15:54,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 18:15:54,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 18:15:54,931 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 18:15:54,931 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 18:15:54,932 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label02.c [2019-09-07 18:15:55,016 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0572a82c/4b33784192a1454fafd2c689a3353532/FLAG44079a416 [2019-09-07 18:15:55,688 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 18:15:55,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label02.c [2019-09-07 18:15:55,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0572a82c/4b33784192a1454fafd2c689a3353532/FLAG44079a416 [2019-09-07 18:15:55,916 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0572a82c/4b33784192a1454fafd2c689a3353532 [2019-09-07 18:15:55,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 18:15:55,928 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 18:15:55,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 18:15:55,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 18:15:55,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 18:15:55,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:15:55" (1/1) ... [2019-09-07 18:15:55,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61dde08c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:15:55, skipping insertion in model container [2019-09-07 18:15:55,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:15:55" (1/1) ... [2019-09-07 18:15:55,946 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 18:15:56,013 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 18:15:56,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:15:56,835 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 18:15:57,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:15:57,032 INFO L192 MainTranslator]: Completed translation [2019-09-07 18:15:57,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:15:57 WrapperNode [2019-09-07 18:15:57,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 18:15:57,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 18:15:57,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 18:15:57,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 18:15:57,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:15:57" (1/1) ... [2019-09-07 18:15:57,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:15:57" (1/1) ... [2019-09-07 18:15:57,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:15:57" (1/1) ... [2019-09-07 18:15:57,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:15:57" (1/1) ... [2019-09-07 18:15:57,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:15:57" (1/1) ... [2019-09-07 18:15:57,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:15:57" (1/1) ... [2019-09-07 18:15:57,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:15:57" (1/1) ... [2019-09-07 18:15:57,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 18:15:57,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 18:15:57,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 18:15:57,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 18:15:57,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:15:57" (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:15:57,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 18:15:57,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 18:15:57,284 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 18:15:57,284 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 18:15:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 18:15:57,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 18:15:57,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 18:15:57,286 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 18:15:57,286 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 18:15:57,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 18:15:57,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 18:15:59,697 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 18:15:59,698 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 18:15:59,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:15:59 BoogieIcfgContainer [2019-09-07 18:15:59,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 18:15:59,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 18:15:59,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 18:15:59,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 18:15:59,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 06:15:55" (1/3) ... [2019-09-07 18:15:59,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40da8b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:15:59, skipping insertion in model container [2019-09-07 18:15:59,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:15:57" (2/3) ... [2019-09-07 18:15:59,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40da8b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:15:59, skipping insertion in model container [2019-09-07 18:15:59,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:15:59" (3/3) ... [2019-09-07 18:15:59,724 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label02.c [2019-09-07 18:15:59,738 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 18:15:59,749 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 18:15:59,771 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 18:15:59,817 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 18:15:59,818 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 18:15:59,820 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 18:15:59,821 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 18:15:59,821 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 18:15:59,821 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 18:15:59,821 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 18:15:59,821 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 18:15:59,822 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 18:15:59,864 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-09-07 18:15:59,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 18:15:59,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:15:59,878 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, 1, 1, 1, 1] [2019-09-07 18:15:59,881 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:15:59,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:15:59,888 INFO L82 PathProgramCache]: Analyzing trace with hash -130901253, now seen corresponding path program 1 times [2019-09-07 18:15:59,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:15:59,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:15:59,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:15:59,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:15:59,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:16:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:16:00,383 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:16:00,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:16:00,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:16:00,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:16:00,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:16:00,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:16:00,418 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 4 states. [2019-09-07 18:16:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:16:02,902 INFO L93 Difference]: Finished difference Result 981 states and 1757 transitions. [2019-09-07 18:16:02,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:16:02,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-09-07 18:16:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:16:02,934 INFO L225 Difference]: With dead ends: 981 [2019-09-07 18:16:02,934 INFO L226 Difference]: Without dead ends: 622 [2019-09-07 18:16:02,946 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:16:02,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-09-07 18:16:03,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2019-09-07 18:16:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-09-07 18:16:03,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 880 transitions. [2019-09-07 18:16:03,050 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 880 transitions. Word has length 60 [2019-09-07 18:16:03,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:16:03,051 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 880 transitions. [2019-09-07 18:16:03,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:16:03,051 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 880 transitions. [2019-09-07 18:16:03,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-07 18:16:03,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:16:03,066 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, 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:16:03,066 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:16:03,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:16:03,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2003613546, now seen corresponding path program 1 times [2019-09-07 18:16:03,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:16:03,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:16:03,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:16:03,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:16:03,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:16:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:16:03,395 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:16:03,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:16:03,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 18:16:03,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:16:03,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:16:03,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:16:03,400 INFO L87 Difference]: Start difference. First operand 622 states and 880 transitions. Second operand 6 states. [2019-09-07 18:16:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:16:05,521 INFO L93 Difference]: Finished difference Result 1839 states and 2644 transitions. [2019-09-07 18:16:05,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:16:05,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-07 18:16:05,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:16:05,533 INFO L225 Difference]: With dead ends: 1839 [2019-09-07 18:16:05,534 INFO L226 Difference]: Without dead ends: 1223 [2019-09-07 18:16:05,537 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:16:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-09-07 18:16:05,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1210. [2019-09-07 18:16:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-09-07 18:16:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1601 transitions. [2019-09-07 18:16:05,621 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1601 transitions. Word has length 140 [2019-09-07 18:16:05,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:16:05,622 INFO L475 AbstractCegarLoop]: Abstraction has 1210 states and 1601 transitions. [2019-09-07 18:16:05,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:16:05,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1601 transitions. [2019-09-07 18:16:05,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-07 18:16:05,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:16:05,633 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, 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, 1, 1, 1, 1, 1, 1] [2019-09-07 18:16:05,634 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:16:05,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:16:05,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1990596462, now seen corresponding path program 1 times [2019-09-07 18:16:05,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:16:05,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:16:05,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:16:05,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:16:05,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:16:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:16:05,788 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:16:05,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:16:05,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:16:05,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:16:05,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:16:05,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:16:05,791 INFO L87 Difference]: Start difference. First operand 1210 states and 1601 transitions. Second operand 4 states. [2019-09-07 18:16:08,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:16:08,004 INFO L93 Difference]: Finished difference Result 4723 states and 6453 transitions. [2019-09-07 18:16:08,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:16:08,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-07 18:16:08,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:16:08,030 INFO L225 Difference]: With dead ends: 4723 [2019-09-07 18:16:08,030 INFO L226 Difference]: Without dead ends: 3519 [2019-09-07 18:16:08,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:16:08,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2019-09-07 18:16:08,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 3306. [2019-09-07 18:16:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2019-09-07 18:16:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4314 transitions. [2019-09-07 18:16:08,181 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4314 transitions. Word has length 154 [2019-09-07 18:16:08,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:16:08,183 INFO L475 AbstractCegarLoop]: Abstraction has 3306 states and 4314 transitions. [2019-09-07 18:16:08,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:16:08,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4314 transitions. [2019-09-07 18:16:08,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-07 18:16:08,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:16:08,197 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:08,197 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:16:08,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:16:08,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1420862588, now seen corresponding path program 1 times [2019-09-07 18:16:08,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:16:08,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:16:08,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:16:08,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:16:08,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:16:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:16:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 48 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:16:08,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:16:08,453 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:16:08,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:16:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:16:08,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:16:08,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:16:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:16:08,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:16:08,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 18:16:08,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:16:08,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:16:08,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:16:08,759 INFO L87 Difference]: Start difference. First operand 3306 states and 4314 transitions. Second operand 9 states. [2019-09-07 18:16:13,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:16:13,298 INFO L93 Difference]: Finished difference Result 11964 states and 16310 transitions. [2019-09-07 18:16:13,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 18:16:13,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2019-09-07 18:16:13,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:16:13,363 INFO L225 Difference]: With dead ends: 11964 [2019-09-07 18:16:13,363 INFO L226 Difference]: Without dead ends: 8852 [2019-09-07 18:16:13,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-09-07 18:16:13,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8852 states. [2019-09-07 18:16:13,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8852 to 8085. [2019-09-07 18:16:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8085 states. [2019-09-07 18:16:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8085 states to 8085 states and 10331 transitions. [2019-09-07 18:16:13,830 INFO L78 Accepts]: Start accepts. Automaton has 8085 states and 10331 transitions. Word has length 191 [2019-09-07 18:16:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:16:13,832 INFO L475 AbstractCegarLoop]: Abstraction has 8085 states and 10331 transitions. [2019-09-07 18:16:13,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:16:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 8085 states and 10331 transitions. [2019-09-07 18:16:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-07 18:16:13,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:16:13,845 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:13,845 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:16:13,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:16:13,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1542958884, now seen corresponding path program 1 times [2019-09-07 18:16:13,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:16:13,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:16:13,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:16:13,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:16:13,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:16:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:16:14,758 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 156 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:16:14,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:16:14,759 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:16:14,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:16:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:16:14,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:16:14,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:16:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-07 18:16:15,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:16:15,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-09-07 18:16:15,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 18:16:15,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 18:16:15,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-07 18:16:15,153 INFO L87 Difference]: Start difference. First operand 8085 states and 10331 transitions. Second operand 19 states. [2019-09-07 18:16:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:16:36,226 INFO L93 Difference]: Finished difference Result 25403 states and 37595 transitions. [2019-09-07 18:16:36,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-07 18:16:36,227 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 295 [2019-09-07 18:16:36,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:16:36,381 INFO L225 Difference]: With dead ends: 25403 [2019-09-07 18:16:36,381 INFO L226 Difference]: Without dead ends: 16930 [2019-09-07 18:16:36,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5889 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2222, Invalid=13030, Unknown=0, NotChecked=0, Total=15252 [2019-09-07 18:16:36,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16930 states. [2019-09-07 18:16:37,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16930 to 14568. [2019-09-07 18:16:37,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14568 states. [2019-09-07 18:16:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14568 states to 14568 states and 18465 transitions. [2019-09-07 18:16:37,156 INFO L78 Accepts]: Start accepts. Automaton has 14568 states and 18465 transitions. Word has length 295 [2019-09-07 18:16:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:16:37,157 INFO L475 AbstractCegarLoop]: Abstraction has 14568 states and 18465 transitions. [2019-09-07 18:16:37,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 18:16:37,157 INFO L276 IsEmpty]: Start isEmpty. Operand 14568 states and 18465 transitions. [2019-09-07 18:16:37,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-09-07 18:16:37,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:16:37,197 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, 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, 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] [2019-09-07 18:16:37,198 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:16:37,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:16:37,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1751037336, now seen corresponding path program 1 times [2019-09-07 18:16:37,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:16:37,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:16:37,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:16:37,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:16:37,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:16:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:16:38,088 WARN L188 SmtUtils]: Spent 624.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-09-07 18:16:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 268 proven. 104 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-07 18:16:38,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:16:38,224 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:16:38,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:16:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:16:38,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:16:38,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:16:38,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:16:38,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:16:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 314 proven. 106 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-07 18:16:39,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:16:39,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 9 [2019-09-07 18:16:39,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:16:39,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:16:39,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=53, Unknown=1, NotChecked=0, Total=72 [2019-09-07 18:16:39,900 INFO L87 Difference]: Start difference. First operand 14568 states and 18465 transitions. Second operand 9 states. [2019-09-07 18:17:49,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:17:49,327 INFO L93 Difference]: Finished difference Result 39968 states and 55869 transitions. [2019-09-07 18:17:49,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 18:17:49,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 402 [2019-09-07 18:17:49,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:17:49,457 INFO L225 Difference]: With dead ends: 39968 [2019-09-07 18:17:49,457 INFO L226 Difference]: Without dead ends: 25784 [2019-09-07 18:17:49,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 412 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=142, Invalid=401, Unknown=9, NotChecked=0, Total=552 [2019-09-07 18:17:49,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25784 states. [2019-09-07 18:17:50,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25784 to 25236. [2019-09-07 18:17:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25236 states. [2019-09-07 18:17:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25236 states to 25236 states and 32718 transitions. [2019-09-07 18:17:50,301 INFO L78 Accepts]: Start accepts. Automaton has 25236 states and 32718 transitions. Word has length 402 [2019-09-07 18:17:50,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:17:50,303 INFO L475 AbstractCegarLoop]: Abstraction has 25236 states and 32718 transitions. [2019-09-07 18:17:50,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:17:50,303 INFO L276 IsEmpty]: Start isEmpty. Operand 25236 states and 32718 transitions. [2019-09-07 18:17:50,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-09-07 18:17:50,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:17:50,338 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, 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, 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:17:50,339 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:17:50,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:17:50,339 INFO L82 PathProgramCache]: Analyzing trace with hash -341395156, now seen corresponding path program 1 times [2019-09-07 18:17:50,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:17:50,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:17:50,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:50,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:17:50,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 368 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 18:17:50,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:17:50,769 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) [2019-09-07 18:17:50,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:17:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:50,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:17:50,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:17:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 368 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 18:17:51,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:17:51,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-09-07 18:17:51,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:17:51,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:17:51,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:17:51,018 INFO L87 Difference]: Start difference. First operand 25236 states and 32718 transitions. Second operand 6 states. [2019-09-07 18:17:52,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:17:52,476 INFO L93 Difference]: Finished difference Result 45466 states and 59814 transitions. [2019-09-07 18:17:52,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:17:52,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 403 [2019-09-07 18:17:52,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:17:52,549 INFO L225 Difference]: With dead ends: 45466 [2019-09-07 18:17:52,549 INFO L226 Difference]: Without dead ends: 22170 [2019-09-07 18:17:52,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 407 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:17:52,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22170 states. [2019-09-07 18:17:53,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22170 to 22014. [2019-09-07 18:17:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22014 states. [2019-09-07 18:17:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22014 states to 22014 states and 27992 transitions. [2019-09-07 18:17:53,208 INFO L78 Accepts]: Start accepts. Automaton has 22014 states and 27992 transitions. Word has length 403 [2019-09-07 18:17:53,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:17:53,209 INFO L475 AbstractCegarLoop]: Abstraction has 22014 states and 27992 transitions. [2019-09-07 18:17:53,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:17:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 22014 states and 27992 transitions. [2019-09-07 18:17:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-09-07 18:17:53,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:17:53,268 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:53,268 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:17:53,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:17:53,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1394340320, now seen corresponding path program 1 times [2019-09-07 18:17:53,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:17:53,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:17:53,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:53,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:17:53,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:17:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 231 proven. 286 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-09-07 18:17:53,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:17:53,778 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:17:53,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:17:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:17:53,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 18:17:53,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:17:53,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:17:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 510 proven. 2 refuted. 0 times theorem prover too weak. 282 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:17:54,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:17:54,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 18:17:54,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 18:17:54,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 18:17:54,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-07 18:17:54,357 INFO L87 Difference]: Start difference. First operand 22014 states and 27992 transitions. Second operand 10 states. [2019-09-07 18:18:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:01,431 INFO L93 Difference]: Finished difference Result 48815 states and 62966 transitions. [2019-09-07 18:18:01,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 18:18:01,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 502 [2019-09-07 18:18:01,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:01,525 INFO L225 Difference]: With dead ends: 48815 [2019-09-07 18:18:01,526 INFO L226 Difference]: Without dead ends: 26393 [2019-09-07 18:18:01,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=265, Invalid=1141, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 18:18:01,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26393 states. [2019-09-07 18:18:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26393 to 25874. [2019-09-07 18:18:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25874 states. [2019-09-07 18:18:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25874 states to 25874 states and 32607 transitions. [2019-09-07 18:18:01,983 INFO L78 Accepts]: Start accepts. Automaton has 25874 states and 32607 transitions. Word has length 502 [2019-09-07 18:18:01,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:01,984 INFO L475 AbstractCegarLoop]: Abstraction has 25874 states and 32607 transitions. [2019-09-07 18:18:01,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 18:18:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 25874 states and 32607 transitions. [2019-09-07 18:18:02,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2019-09-07 18:18:02,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:02,045 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, 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, 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, 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:18:02,046 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:02,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:02,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1993475787, now seen corresponding path program 1 times [2019-09-07 18:18:02,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:02,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:02,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:02,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:02,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 423 proven. 122 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-09-07 18:18:03,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:18:03,269 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:18:03,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:03,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:18:03,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:18:03,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:18:03,669 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 685 proven. 2 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-07 18:18:03,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:18:03,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-09-07 18:18:03,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 18:18:03,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 18:18:03,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:18:03,688 INFO L87 Difference]: Start difference. First operand 25874 states and 32607 transitions. Second operand 16 states. [2019-09-07 18:18:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:09,372 INFO L93 Difference]: Finished difference Result 54143 states and 69239 transitions. [2019-09-07 18:18:09,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 18:18:09,373 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 540 [2019-09-07 18:18:09,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:09,443 INFO L225 Difference]: With dead ends: 54143 [2019-09-07 18:18:09,443 INFO L226 Difference]: Without dead ends: 28265 [2019-09-07 18:18:09,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 572 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=471, Invalid=1881, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 18:18:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28265 states. [2019-09-07 18:18:09,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28265 to 25075. [2019-09-07 18:18:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25075 states. [2019-09-07 18:18:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25075 states to 25075 states and 30862 transitions. [2019-09-07 18:18:09,957 INFO L78 Accepts]: Start accepts. Automaton has 25075 states and 30862 transitions. Word has length 540 [2019-09-07 18:18:09,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:09,958 INFO L475 AbstractCegarLoop]: Abstraction has 25075 states and 30862 transitions. [2019-09-07 18:18:09,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 18:18:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 25075 states and 30862 transitions. [2019-09-07 18:18:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2019-09-07 18:18:09,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:09,981 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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:18:09,981 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:09,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:09,982 INFO L82 PathProgramCache]: Analyzing trace with hash 318535359, now seen corresponding path program 1 times [2019-09-07 18:18:09,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:09,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:09,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:09,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:09,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:10,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 670 proven. 2 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2019-09-07 18:18:10,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:18:10,581 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) [2019-09-07 18:18:10,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:18:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:10,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:18:10,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:18:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 670 proven. 2 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2019-09-07 18:18:11,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:18:11,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 18:18:11,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:18:11,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:18:11,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:18:11,018 INFO L87 Difference]: Start difference. First operand 25075 states and 30862 transitions. Second operand 6 states. [2019-09-07 18:18:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:13,729 INFO L93 Difference]: Finished difference Result 49471 states and 61195 transitions. [2019-09-07 18:18:13,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 18:18:13,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 579 [2019-09-07 18:18:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:13,803 INFO L225 Difference]: With dead ends: 49471 [2019-09-07 18:18:13,803 INFO L226 Difference]: Without dead ends: 25962 [2019-09-07 18:18:13,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-07 18:18:13,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25962 states. [2019-09-07 18:18:15,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25962 to 24346. [2019-09-07 18:18:15,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24346 states. [2019-09-07 18:18:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24346 states to 24346 states and 29669 transitions. [2019-09-07 18:18:15,221 INFO L78 Accepts]: Start accepts. Automaton has 24346 states and 29669 transitions. Word has length 579 [2019-09-07 18:18:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:15,223 INFO L475 AbstractCegarLoop]: Abstraction has 24346 states and 29669 transitions. [2019-09-07 18:18:15,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:18:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 24346 states and 29669 transitions. [2019-09-07 18:18:15,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2019-09-07 18:18:15,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:15,255 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:15,256 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:15,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2128467558, now seen corresponding path program 1 times [2019-09-07 18:18:15,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:15,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:15,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:15,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:15,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 365 proven. 209 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2019-09-07 18:18:15,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:18:15,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:18:15,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:15,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:18:15,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:18:15,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:18:15,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:18:16,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:18:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 530 proven. 2 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-09-07 18:18:18,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:18:18,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-07 18:18:18,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 18:18:18,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 18:18:18,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=76, Unknown=1, NotChecked=0, Total=110 [2019-09-07 18:18:18,354 INFO L87 Difference]: Start difference. First operand 24346 states and 29669 transitions. Second operand 11 states. [2019-09-07 18:18:21,327 WARN L188 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2019-09-07 18:18:42,098 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-09-07 18:18:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:18:50,085 INFO L93 Difference]: Finished difference Result 59589 states and 75542 transitions. [2019-09-07 18:18:50,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 18:18:50,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 594 [2019-09-07 18:18:50,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:18:50,154 INFO L225 Difference]: With dead ends: 59589 [2019-09-07 18:18:50,154 INFO L226 Difference]: Without dead ends: 35627 [2019-09-07 18:18:50,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 604 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=173, Invalid=425, Unknown=2, NotChecked=0, Total=600 [2019-09-07 18:18:50,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35627 states. [2019-09-07 18:18:50,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35627 to 34560. [2019-09-07 18:18:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34560 states. [2019-09-07 18:18:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34560 states to 34560 states and 41947 transitions. [2019-09-07 18:18:50,741 INFO L78 Accepts]: Start accepts. Automaton has 34560 states and 41947 transitions. Word has length 594 [2019-09-07 18:18:50,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:18:50,741 INFO L475 AbstractCegarLoop]: Abstraction has 34560 states and 41947 transitions. [2019-09-07 18:18:50,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 18:18:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 34560 states and 41947 transitions. [2019-09-07 18:18:50,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2019-09-07 18:18:50,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:18:50,785 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:18:50,786 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:18:50,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:18:50,786 INFO L82 PathProgramCache]: Analyzing trace with hash 24975297, now seen corresponding path program 1 times [2019-09-07 18:18:50,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:18:50,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:18:50,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:50,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:50,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:18:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1257 backedges. 178 proven. 809 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-09-07 18:18:52,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:18:52,597 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:18:52,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:18:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:18:52,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 944 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:18:52,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:18:52,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:18:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1257 backedges. 670 proven. 2 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-09-07 18:18:53,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:18:53,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 6] total 25 [2019-09-07 18:18:53,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 18:18:53,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 18:18:53,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2019-09-07 18:18:53,199 INFO L87 Difference]: Start difference. First operand 34560 states and 41947 transitions. Second operand 25 states. [2019-09-07 18:19:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:32,155 INFO L93 Difference]: Finished difference Result 82463 states and 102527 transitions. [2019-09-07 18:19:32,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2019-09-07 18:19:32,156 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 613 [2019-09-07 18:19:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:32,246 INFO L225 Difference]: With dead ends: 82463 [2019-09-07 18:19:32,246 INFO L226 Difference]: Without dead ends: 45975 [2019-09-07 18:19:32,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 743 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17722 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=4402, Invalid=38240, Unknown=0, NotChecked=0, Total=42642 [2019-09-07 18:19:32,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45975 states. [2019-09-07 18:19:32,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45975 to 42619. [2019-09-07 18:19:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42619 states. [2019-09-07 18:19:32,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42619 states to 42619 states and 50560 transitions. [2019-09-07 18:19:32,960 INFO L78 Accepts]: Start accepts. Automaton has 42619 states and 50560 transitions. Word has length 613 [2019-09-07 18:19:32,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:32,961 INFO L475 AbstractCegarLoop]: Abstraction has 42619 states and 50560 transitions. [2019-09-07 18:19:32,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 18:19:32,961 INFO L276 IsEmpty]: Start isEmpty. Operand 42619 states and 50560 transitions. [2019-09-07 18:19:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2019-09-07 18:19:33,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:33,124 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, 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, 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, 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:19:33,124 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:33,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1025522323, now seen corresponding path program 1 times [2019-09-07 18:19:33,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:33,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:33,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:33,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:33,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 286 proven. 2 refuted. 0 times theorem prover too weak. 984 trivial. 0 not checked. [2019-09-07 18:19:33,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:33,553 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:19:33,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:33,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 18:19:33,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2019-09-07 18:19:33,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:19:33,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 18:19:33,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 18:19:33,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 18:19:33,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:19:33,880 INFO L87 Difference]: Start difference. First operand 42619 states and 50560 transitions. Second operand 3 states. [2019-09-07 18:19:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:35,012 INFO L93 Difference]: Finished difference Result 81631 states and 96977 transitions. [2019-09-07 18:19:35,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 18:19:35,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 631 [2019-09-07 18:19:35,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:35,076 INFO L225 Difference]: With dead ends: 81631 [2019-09-07 18:19:35,076 INFO L226 Difference]: Without dead ends: 40164 [2019-09-07 18:19:35,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 632 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:19:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40164 states. [2019-09-07 18:19:35,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40164 to 40162. [2019-09-07 18:19:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40162 states. [2019-09-07 18:19:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40162 states to 40162 states and 46769 transitions. [2019-09-07 18:19:35,732 INFO L78 Accepts]: Start accepts. Automaton has 40162 states and 46769 transitions. Word has length 631 [2019-09-07 18:19:35,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:35,732 INFO L475 AbstractCegarLoop]: Abstraction has 40162 states and 46769 transitions. [2019-09-07 18:19:35,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 18:19:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 40162 states and 46769 transitions. [2019-09-07 18:19:35,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2019-09-07 18:19:35,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:35,783 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, 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, 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, 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:19:35,783 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:35,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:35,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1433219241, now seen corresponding path program 1 times [2019-09-07 18:19:35,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:35,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:35,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:35,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:35,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 435 proven. 104 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2019-09-07 18:19:36,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:36,429 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:19:36,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:36,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 18:19:36,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:36,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 685 proven. 2 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-07 18:19:36,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:19:36,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2019-09-07 18:19:36,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 18:19:36,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 18:19:36,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-07 18:19:36,884 INFO L87 Difference]: Start difference. First operand 40162 states and 46769 transitions. Second operand 7 states. [2019-09-07 18:19:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:39,462 INFO L93 Difference]: Finished difference Result 76416 states and 89116 transitions. [2019-09-07 18:19:39,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 18:19:39,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 632 [2019-09-07 18:19:39,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:39,516 INFO L225 Difference]: With dead ends: 76416 [2019-09-07 18:19:39,517 INFO L226 Difference]: Without dead ends: 35880 [2019-09-07 18:19:39,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 640 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-09-07 18:19:39,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35880 states. [2019-09-07 18:19:40,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35880 to 33158. [2019-09-07 18:19:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33158 states. [2019-09-07 18:19:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33158 states to 33158 states and 37073 transitions. [2019-09-07 18:19:40,103 INFO L78 Accepts]: Start accepts. Automaton has 33158 states and 37073 transitions. Word has length 632 [2019-09-07 18:19:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:40,104 INFO L475 AbstractCegarLoop]: Abstraction has 33158 states and 37073 transitions. [2019-09-07 18:19:40,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 18:19:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 33158 states and 37073 transitions. [2019-09-07 18:19:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2019-09-07 18:19:40,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:40,154 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-07 18:19:40,154 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:40,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:40,154 INFO L82 PathProgramCache]: Analyzing trace with hash -422527580, now seen corresponding path program 1 times [2019-09-07 18:19:40,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:40,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:40,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:40,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:40,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2475 backedges. 822 proven. 557 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2019-09-07 18:19:42,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:42,212 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) [2019-09-07 18:19:42,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:19:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:42,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:19:42,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:42,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:42,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:43,693 WARN L188 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-09-07 18:19:43,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2475 backedges. 1139 proven. 2 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2019-09-07 18:19:46,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:19:46,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-07 18:19:46,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 18:19:46,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 18:19:46,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=106, Unknown=1, NotChecked=0, Total=132 [2019-09-07 18:19:46,076 INFO L87 Difference]: Start difference. First operand 33158 states and 37073 transitions. Second operand 12 states. [2019-09-07 18:19:54,531 WARN L188 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-09-07 18:19:58,835 WARN L188 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 35 DAG size of output: 22 [2019-09-07 18:20:10,112 WARN L188 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2019-09-07 18:20:17,686 WARN L188 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-09-07 18:20:30,494 WARN L188 SmtUtils]: Spent 4.91 s on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-09-07 18:20:48,037 WARN L188 SmtUtils]: Spent 4.60 s on a formula simplification. DAG size of input: 32 DAG size of output: 19 [2019-09-07 18:21:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:21:05,796 INFO L93 Difference]: Finished difference Result 85608 states and 95884 transitions. [2019-09-07 18:21:05,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-07 18:21:05,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 840 [2019-09-07 18:21:05,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:21:05,887 INFO L225 Difference]: With dead ends: 85608 [2019-09-07 18:21:05,887 INFO L226 Difference]: Without dead ends: 52658 [2019-09-07 18:21:05,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 969 GetRequests, 891 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2202 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=1024, Invalid=4979, Unknown=3, NotChecked=0, Total=6006 [2019-09-07 18:21:05,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52658 states. [2019-09-07 18:21:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52658 to 50394. [2019-09-07 18:21:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50394 states. [2019-09-07 18:21:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50394 states to 50394 states and 55749 transitions. [2019-09-07 18:21:06,526 INFO L78 Accepts]: Start accepts. Automaton has 50394 states and 55749 transitions. Word has length 840 [2019-09-07 18:21:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:21:06,526 INFO L475 AbstractCegarLoop]: Abstraction has 50394 states and 55749 transitions. [2019-09-07 18:21:06,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 18:21:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 50394 states and 55749 transitions. [2019-09-07 18:21:06,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1155 [2019-09-07 18:21:06,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:21:06,579 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:21:06,579 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:21:06,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:21:06,580 INFO L82 PathProgramCache]: Analyzing trace with hash 24630763, now seen corresponding path program 1 times [2019-09-07 18:21:06,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:21:06,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:21:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:06,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5090 backedges. 661 proven. 778 refuted. 0 times theorem prover too weak. 3651 trivial. 0 not checked. [2019-09-07 18:21:07,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:21:07,583 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:21:07,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:07,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 1694 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:21:07,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:21:07,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:21:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5090 backedges. 3231 proven. 2 refuted. 0 times theorem prover too weak. 1857 trivial. 0 not checked. [2019-09-07 18:21:08,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:21:08,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 18:21:08,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 18:21:08,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 18:21:08,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 18:21:08,728 INFO L87 Difference]: Start difference. First operand 50394 states and 55749 transitions. Second operand 8 states. [2019-09-07 18:21:11,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:21:11,937 INFO L93 Difference]: Finished difference Result 92061 states and 101891 transitions. [2019-09-07 18:21:11,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 18:21:11,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1154 [2019-09-07 18:21:11,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:21:11,998 INFO L225 Difference]: With dead ends: 92061 [2019-09-07 18:21:11,998 INFO L226 Difference]: Without dead ends: 42837 [2019-09-07 18:21:12,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1192 GetRequests, 1168 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2019-09-07 18:21:12,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42837 states. [2019-09-07 18:21:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42837 to 36562. [2019-09-07 18:21:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36562 states. [2019-09-07 18:21:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36562 states to 36562 states and 39907 transitions. [2019-09-07 18:21:12,490 INFO L78 Accepts]: Start accepts. Automaton has 36562 states and 39907 transitions. Word has length 1154 [2019-09-07 18:21:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:21:12,491 INFO L475 AbstractCegarLoop]: Abstraction has 36562 states and 39907 transitions. [2019-09-07 18:21:12,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 18:21:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 36562 states and 39907 transitions. [2019-09-07 18:21:12,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1165 [2019-09-07 18:21:12,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:21:12,526 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:12,526 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:21:12,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:21:12,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1802754431, now seen corresponding path program 1 times [2019-09-07 18:21:12,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:21:12,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:21:12,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:12,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:12,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4282 backedges. 1400 proven. 557 refuted. 0 times theorem prover too weak. 2325 trivial. 0 not checked. [2019-09-07 18:21:13,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:21:13,886 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:21:13,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:14,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 18:21:14,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:21:14,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 18:21:14,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:14,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:14,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:14,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:16,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4282 backedges. 2244 proven. 223 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2019-09-07 18:21:16,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:21:16,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 16 [2019-09-07 18:21:16,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 18:21:16,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 18:21:16,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:21:16,977 INFO L87 Difference]: Start difference. First operand 36562 states and 39907 transitions. Second operand 16 states. [2019-09-07 18:21:31,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:21:31,416 INFO L93 Difference]: Finished difference Result 70388 states and 78416 transitions. [2019-09-07 18:21:31,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-07 18:21:31,417 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1164 [2019-09-07 18:21:31,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:21:31,418 INFO L225 Difference]: With dead ends: 70388 [2019-09-07 18:21:31,418 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 18:21:31,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1298 GetRequests, 1202 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3086 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1582, Invalid=7538, Unknown=0, NotChecked=0, Total=9120 [2019-09-07 18:21:31,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 18:21:31,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 18:21:31,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 18:21:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 18:21:31,485 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1164 [2019-09-07 18:21:31,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:21:31,485 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 18:21:31,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 18:21:31,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 18:21:31,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 18:21:31,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 18:21:47,618 WARN L188 SmtUtils]: Spent 12.19 s on a formula simplification. DAG size of input: 1921 DAG size of output: 1515 [2019-09-07 18:21:57,851 WARN L188 SmtUtils]: Spent 10.23 s on a formula simplification. DAG size of input: 1921 DAG size of output: 1515 [2019-09-07 18:21:57,996 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 38 [2019-09-07 18:22:20,901 WARN L188 SmtUtils]: Spent 22.77 s on a formula simplification. DAG size of input: 1208 DAG size of output: 167 [2019-09-07 18:24:49,024 WARN L188 SmtUtils]: Spent 2.47 m on a formula simplification. DAG size of input: 1442 DAG size of output: 127 [2019-09-07 18:27:10,745 WARN L188 SmtUtils]: Spent 2.36 m on a formula simplification. DAG size of input: 1442 DAG size of output: 127 [2019-09-07 18:27:10,747 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 18:27:10,748 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a23~0 |old(~a23~0)|) (<= |old(~a29~0)| ~a29~0) (<= ~a29~0 |old(~a29~0)|) (= ~a4~0 |old(~a4~0)|) (= ~a25~0 |old(~a25~0)|)) [2019-09-07 18:27:10,748 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 18:27:10,748 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-09-07 18:27:10,748 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-09-07 18:27:10,748 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-09-07 18:27:10,748 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-09-07 18:27:10,748 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,748 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,748 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,749 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,749 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,749 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,749 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,749 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-09-07 18:27:10,749 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-09-07 18:27:10,749 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-09-07 18:27:10,749 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,749 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,749 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,749 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,749 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,750 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,750 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,750 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,750 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,750 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-09-07 18:27:10,750 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-09-07 18:27:10,750 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-09-07 18:27:10,750 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,750 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,750 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,750 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,750 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,751 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,751 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,751 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,751 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,751 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-09-07 18:27:10,751 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-09-07 18:27:10,751 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-09-07 18:27:10,751 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-09-07 18:27:10,751 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-09-07 18:27:10,752 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-09-07 18:27:10,752 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-09-07 18:27:10,752 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,752 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,752 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,752 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,752 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,752 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,752 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,753 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,753 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,753 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,753 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-09-07 18:27:10,753 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-09-07 18:27:10,753 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-09-07 18:27:10,753 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,753 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,753 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,754 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,754 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,754 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-09-07 18:27:10,754 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-09-07 18:27:10,754 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-09-07 18:27:10,754 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,754 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,754 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,754 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,755 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,755 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-09-07 18:27:10,755 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-09-07 18:27:10,755 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,755 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,755 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,755 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,755 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,755 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,756 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-09-07 18:27:10,756 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-09-07 18:27:10,756 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,756 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,756 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-09-07 18:27:10,756 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-09-07 18:27:10,756 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-09-07 18:27:10,756 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,756 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,756 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,757 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,757 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,757 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,757 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,757 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-09-07 18:27:10,757 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-09-07 18:27:10,757 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-09-07 18:27:10,757 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-09-07 18:27:10,757 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-09-07 18:27:10,757 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-09-07 18:27:10,758 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-09-07 18:27:10,758 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,758 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,758 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-09-07 18:27:10,758 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-09-07 18:27:10,758 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,758 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,758 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,758 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,759 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 22 1026) the Hoare annotation is: (let ((.cse2 (not (< 140 |old(~a29~0)|))) (.cse10 (not (< 0 (+ |old(~a23~0)| 43))))) (let ((.cse27 (= 12 |old(~a25~0)|)) (.cse19 (<= |old(~a29~0)| ~a29~0)) (.cse5 (= ~a29~0 |old(~a29~0)|)) (.cse12 (= ~a23~0 |old(~a23~0)|)) (.cse7 (= ~a25~0 |old(~a25~0)|)) (.cse0 (not (= 15 ~a8~0))) (.cse1 (not (= 1 ~a3~0))) (.cse23 (not (<= 130 |old(~a29~0)|))) (.cse15 (not (= 9 |old(~a25~0)|))) (.cse3 (not (= 1 |old(~a4~0)|))) (.cse31 (and .cse2 .cse10)) (.cse18 (<= ~a29~0 |old(~a29~0)|)) (.cse6 (= ~a4~0 |old(~a4~0)|))) (let ((.cse11 (= ~a25~0 9)) (.cse4 (not (= 13 |old(~a25~0)|))) (.cse21 (and .cse18 .cse6)) (.cse16 (or .cse0 .cse1 .cse23 .cse15 .cse3 .cse31)) (.cse9 (not (<= |old(~a23~0)| 599997))) (.cse13 (= 1 ~a4~0)) (.cse28 (and .cse5 .cse12 .cse6 .cse7)) (.cse29 (and .cse12 .cse19 (<= ~a29~0 275) .cse6 .cse7)) (.cse30 (not (<= |old(~a29~0)| 275))) (.cse32 (not (<= (+ |old(~a23~0)| 119992) 0))) (.cse20 (not (<= (+ |old(~a23~0)| 55) 0))) (.cse24 (forall ((v_~a29~0_505 Int)) (or (not (<= 0 v_~a29~0_505)) (not (<= |old(~a29~0)| (+ (mod v_~a29~0_505 15) 260))) (not (<= |old(~a29~0)| v_~a29~0_505))))) (.cse22 (not (<= |old(~a4~0)| 0))) (.cse14 (not (<= |old(~a23~0)| 312))) (.cse8 (and .cse12 .cse19 .cse18 .cse6 .cse7)) (.cse33 (not .cse27)) (.cse26 (not (<= |old(~a23~0)| 600000))) (.cse25 (not (<= 312 |old(~a23~0)|))) (.cse17 (not (< 277 |old(~a29~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= (+ |old(~a23~0)| 599772) 0)) (and (<= ~a23~0 |old(~a23~0)|) .cse5 .cse6 .cse7)) (or .cse0 .cse1 .cse2 .cse8 .cse3 .cse9 .cse10) (or (and .cse11 .cse12 .cse5 .cse13) (or .cse14 .cse0 .cse1 .cse15 .cse3 .cse10)) (or (or .cse16 (not (<= |old(~a23~0)| 371192)) .cse17) (and (and .cse11 .cse18 .cse13) .cse12 .cse19)) (or .cse20 .cse16 (and .cse12 .cse18 .cse6 .cse7 (<= 277 ~a29~0)) (not (<= 277 |old(~a29~0)|))) (or .cse20 (and .cse21 .cse12 .cse19 .cse7) (or .cse15 .cse0 .cse1 .cse22 .cse17)) (or .cse8 .cse0 .cse1 .cse3 .cse4 .cse9 .cse10) (or .cse0 .cse1 (and .cse12 .cse5 .cse6 .cse7) .cse23 .cse3 .cse10 (not (<= |old(~a23~0)| 138))) (or (or .cse0 .cse1 .cse24 .cse25 .cse2 .cse3) .cse26 (and .cse12 .cse19 .cse21 .cse7)) (or (or .cse0 .cse1 .cse24 .cse2 .cse27 .cse3) .cse9 .cse28) (or .cse29 (or .cse16 .cse2 .cse9 .cse30)) (or .cse9 (or (not (= 10 |old(~a25~0)|)) .cse0 .cse1 .cse3) (and .cse12 (and .cse5 (= ~a25~0 10)) .cse13)) (or .cse28 .cse0 .cse1 .cse15 .cse3 .cse31 .cse32) (or (forall ((v_~a29~0_512 Int)) (or (not (<= (+ (mod v_~a29~0_512 15) 260) |old(~a29~0)|)) (not (<= 0 v_~a29~0_512)) (not (<= 130 v_~a29~0_512)))) .cse33 .cse29 .cse0 .cse1 .cse30 .cse22 .cse32) (or .cse20 .cse8 .cse0 .cse1 .cse22 (not (<= |old(~a29~0)| 130))) (or .cse20 (or (or .cse0 .cse1 .cse24 .cse22) .cse2) .cse8 .cse33) (or .cse14 .cse0 .cse1 .cse8 .cse3 .cse10 .cse33) (or (and .cse7 (and .cse12 .cse19 .cse18 .cse6)) .cse26 (or .cse0 .cse1 .cse25 .cse3 .cse17 (not (<= |old(~a25~0)| 11)))))))) [2019-09-07 18:27:10,759 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,759 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-09-07 18:27:10,759 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-09-07 18:27:10,759 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-09-07 18:27:10,760 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,760 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,760 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,760 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,760 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,760 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,760 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-09-07 18:27:10,760 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-09-07 18:27:10,760 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-09-07 18:27:10,760 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,761 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,761 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,761 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,761 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,761 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,761 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,761 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,761 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-09-07 18:27:10,761 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-09-07 18:27:10,761 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-09-07 18:27:10,762 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,762 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,762 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,762 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,762 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,762 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,762 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,762 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,763 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,763 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,763 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,763 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-09-07 18:27:10,763 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-09-07 18:27:10,763 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-09-07 18:27:10,763 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-09-07 18:27:10,763 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-09-07 18:27:10,763 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,764 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,764 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,764 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,764 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,764 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,764 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,764 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-09-07 18:27:10,764 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-09-07 18:27:10,764 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-09-07 18:27:10,764 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,765 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,765 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,765 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-09-07 18:27:10,765 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-09-07 18:27:10,765 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,765 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,765 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,765 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,765 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,765 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-09-07 18:27:10,766 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-09-07 18:27:10,766 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,766 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,766 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-09-07 18:27:10,766 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-09-07 18:27:10,766 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,766 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,766 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,766 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,766 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,767 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,767 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-09-07 18:27:10,767 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-09-07 18:27:10,767 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-09-07 18:27:10,767 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-09-07 18:27:10,767 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,767 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,767 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,767 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,767 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,768 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,768 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,768 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,768 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-09-07 18:27:10,768 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-09-07 18:27:10,768 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-09-07 18:27:10,768 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-09-07 18:27:10,768 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-09-07 18:27:10,768 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-09-07 18:27:10,768 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,768 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,768 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,768 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,769 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,769 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,769 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,769 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-09-07 18:27:10,769 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-09-07 18:27:10,769 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,769 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,769 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,769 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,769 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,769 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,769 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,769 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-09-07 18:27:10,769 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-09-07 18:27:10,769 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,769 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,770 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,770 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,770 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,770 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,770 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,770 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-09-07 18:27:10,770 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,770 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,770 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,770 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-09-07 18:27:10,770 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-09-07 18:27:10,770 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-09-07 18:27:10,770 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,770 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-09-07 18:27:10,770 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,771 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-09-07 18:27:10,771 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,771 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,771 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,771 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,771 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,771 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,771 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-09-07 18:27:10,771 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-09-07 18:27:10,771 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-09-07 18:27:10,771 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,772 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,772 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,772 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,772 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,772 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,772 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,772 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,772 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,773 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,773 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-09-07 18:27:10,773 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-09-07 18:27:10,773 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-09-07 18:27:10,773 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,773 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-09-07 18:27:10,773 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-09-07 18:27:10,773 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,774 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,774 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,774 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,774 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,774 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,774 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-09-07 18:27:10,774 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-09-07 18:27:10,774 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-09-07 18:27:10,774 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,774 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,775 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,775 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,775 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-09-07 18:27:10,775 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-09-07 18:27:10,775 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,775 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,775 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-09-07 18:27:10,775 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,776 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,776 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:27:10,776 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 18:27:10,776 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:27:10,776 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 18:27:10,776 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 18:27:10,776 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 (= ~a25~0 |old(~a25~0)|) (= ~a23~0 |old(~a23~0)|) (<= |old(~a29~0)| ~a29~0) (= 1 ~a4~0) (<= ~a29~0 |old(~a29~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:27:10,777 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1028 1044) no Hoare annotation was computed. [2019-09-07 18:27:10,777 INFO L439 ceAbstractionStarter]: At program point L1042(line 1042) the Hoare annotation is: (let ((.cse16 (< 0 (+ ~a23~0 43))) (.cse7 (< 140 ~a29~0))) (let ((.cse2 (= ~a25~0 9)) (.cse4 (or .cse16 .cse7)) (.cse9 (= 10 |old(~a25~0)|)) (.cse20 (<= 130 ~a29~0)) (.cse5 (= ~a4~0 |old(~a4~0)|)) (.cse1 (= 1 ~a4~0))) (let ((.cse8 (<= ~a29~0 274)) (.cse10 (<= (+ ~a23~0 55) 0)) (.cse14 (= ~a25~0 13)) (.cse0 (<= ~a23~0 599997)) (.cse17 (<= ~a23~0 371192)) (.cse13 (and .cse2 (<= 0 (+ |old(~a23~0)| 42)) .cse4 (or (= 11 |old(~a25~0)|) (= 12 |old(~a25~0)|) .cse9) .cse20 .cse5 .cse1)) (.cse6 (<= ~a23~0 600000)) (.cse15 (< 277 ~a29~0)) (.cse19 (<= ~a23~0 312)) (.cse11 (<= ~a4~0 0)) (.cse3 (<= (+ ~a23~0 119992) 0)) (.cse12 (= ~a25~0 12)) (.cse18 (<= ~a29~0 275))) (or (and .cse0 (and .cse1 (= ~a25~0 10))) (not (<= 130 |old(~a29~0)|)) (not (<= 312 |old(~a23~0)|)) (and .cse2 .cse3 .cse4 .cse5) (and .cse6 (and .cse7 (and (and .cse8 (<= 312 ~a23~0)) .cse1))) (not .cse9) (not (<= |old(~a29~0)| 130)) (not (= 1 |old(~a4~0)|)) (and .cse10 (and .cse11 (<= ~a29~0 130))) (and (and (and .cse12 .cse11 .cse8) .cse7) .cse10) (and .cse13 .cse10 (<= 277 ~a29~0)) (and .cse0 (and .cse7 (and (and (not .cse12) (exists ((v_~a29~0_505 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_505 15) 260)) (<= |old(~a29~0)| v_~a29~0_505) (<= 0 v_~a29~0_505)))) .cse1))) (and .cse14 (<= (+ ~a23~0 599772) 0) .cse7 .cse1) (and .cse2 .cse11 .cse15 .cse10) (and .cse14 .cse0 .cse16 .cse5) (and .cse0 .cse16 .cse7 .cse5) (and .cse17 .cse13 .cse15) (and .cse17 .cse7 .cse13 .cse18) (and .cse2 (and .cse19 .cse16) .cse1) (not (<= |old(~a23~0)| 312)) (not (= 1 ~a3~0)) (and .cse6 (and (<= ~a25~0 11) .cse15 .cse16 .cse5)) (and .cse12 .cse19 .cse16 .cse5) (and (and .cse16 .cse20 .cse1) (<= ~a23~0 138)) (not (= 15 ~a8~0)) (and .cse11 .cse3 .cse12 .cse7 .cse18))))) [2019-09-07 18:27:10,777 INFO L443 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2019-09-07 18:27:10,777 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-09-07 18:27:10,778 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse16 (< 0 (+ ~a23~0 43))) (.cse7 (< 140 ~a29~0))) (let ((.cse2 (= ~a25~0 9)) (.cse4 (or .cse16 .cse7)) (.cse9 (= 10 |old(~a25~0)|)) (.cse20 (<= 130 ~a29~0)) (.cse5 (= ~a4~0 |old(~a4~0)|)) (.cse1 (= 1 ~a4~0))) (let ((.cse8 (<= ~a29~0 274)) (.cse10 (<= (+ ~a23~0 55) 0)) (.cse14 (= ~a25~0 13)) (.cse0 (<= ~a23~0 599997)) (.cse17 (<= ~a23~0 371192)) (.cse13 (and .cse2 (<= 0 (+ |old(~a23~0)| 42)) .cse4 (or (= 11 |old(~a25~0)|) (= 12 |old(~a25~0)|) .cse9) .cse20 .cse5 .cse1)) (.cse6 (<= ~a23~0 600000)) (.cse15 (< 277 ~a29~0)) (.cse19 (<= ~a23~0 312)) (.cse11 (<= ~a4~0 0)) (.cse3 (<= (+ ~a23~0 119992) 0)) (.cse12 (= ~a25~0 12)) (.cse18 (<= ~a29~0 275))) (or (and .cse0 (and .cse1 (= ~a25~0 10))) (not (<= 130 |old(~a29~0)|)) (not (<= 312 |old(~a23~0)|)) (and .cse2 .cse3 .cse4 .cse5) (and .cse6 (and .cse7 (and (and .cse8 (<= 312 ~a23~0)) .cse1))) (not .cse9) (not (<= |old(~a29~0)| 130)) (not (= 1 |old(~a4~0)|)) (and .cse10 (and .cse11 (<= ~a29~0 130))) (and (and (and .cse12 .cse11 .cse8) .cse7) .cse10) (and .cse13 .cse10 (<= 277 ~a29~0)) (and .cse0 (and .cse7 (and (and (not .cse12) (exists ((v_~a29~0_505 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_505 15) 260)) (<= |old(~a29~0)| v_~a29~0_505) (<= 0 v_~a29~0_505)))) .cse1))) (and .cse14 (<= (+ ~a23~0 599772) 0) .cse7 .cse1) (and .cse2 .cse11 .cse15 .cse10) (and .cse14 .cse0 .cse16 .cse5) (and .cse0 .cse16 .cse7 .cse5) (and .cse17 .cse13 .cse15) (and .cse17 .cse7 .cse13 .cse18) (and .cse2 (and .cse19 .cse16) .cse1) (not (<= |old(~a23~0)| 312)) (not (= 1 ~a3~0)) (and .cse6 (and (<= ~a25~0 11) .cse15 .cse16 .cse5)) (and .cse12 .cse19 .cse16 .cse5) (and (and .cse16 .cse20 .cse1) (<= ~a23~0 138)) (not (= 15 ~a8~0)) (and .cse11 .cse3 .cse12 .cse7 .cse18))))) [2019-09-07 18:27:10,778 INFO L443 ceAbstractionStarter]: For program point L1034-3(lines 1028 1044) no Hoare annotation was computed. [2019-09-07 18:27:10,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-09-07 18:27:10,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-09-07 18:27:10,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-09-07 18:27:10,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-09-07 18:27:10,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-09-07 18:27:10,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-09-07 18:27:10,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 06:27:10 BoogieIcfgContainer [2019-09-07 18:27:10,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 18:27:10,809 INFO L168 Benchmark]: Toolchain (without parser) took 674880.66 ms. Allocated memory was 133.2 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 85.8 MB in the beginning and 765.1 MB in the end (delta: -679.2 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-09-07 18:27:10,810 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-07 18:27:10,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1103.86 ms. Allocated memory was 133.2 MB in the beginning and 201.3 MB in the end (delta: 68.2 MB). Free memory was 85.6 MB in the beginning and 140.2 MB in the end (delta: -54.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2019-09-07 18:27:10,812 INFO L168 Benchmark]: Boogie Preprocessor took 166.14 ms. Allocated memory is still 201.3 MB. Free memory was 140.2 MB in the beginning and 132.4 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 7.1 GB. [2019-09-07 18:27:10,813 INFO L168 Benchmark]: RCFGBuilder took 2500.54 ms. Allocated memory was 201.3 MB in the beginning and 225.4 MB in the end (delta: 24.1 MB). Free memory was 131.8 MB in the beginning and 78.4 MB in the end (delta: 53.4 MB). Peak memory consumption was 77.5 MB. Max. memory is 7.1 GB. [2019-09-07 18:27:10,813 INFO L168 Benchmark]: TraceAbstraction took 671105.68 ms. Allocated memory was 225.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 78.4 MB in the beginning and 765.1 MB in the end (delta: -686.7 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-09-07 18:27:10,817 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.54 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1103.86 ms. Allocated memory was 133.2 MB in the beginning and 201.3 MB in the end (delta: 68.2 MB). Free memory was 85.6 MB in the beginning and 140.2 MB in the end (delta: -54.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 166.14 ms. Allocated memory is still 201.3 MB. Free memory was 140.2 MB in the beginning and 132.4 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2500.54 ms. Allocated memory was 201.3 MB in the beginning and 225.4 MB in the end (delta: 24.1 MB). Free memory was 131.8 MB in the beginning and 78.4 MB in the end (delta: 53.4 MB). Peak memory consumption was 77.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 671105.68 ms. Allocated memory was 225.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 78.4 MB in the beginning and 765.1 MB in the end (delta: -686.7 MB). Peak memory consumption was 2.6 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_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 168]: 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:27:10,827 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-09-07 18:27:10,827 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-09-07 18:27:10,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-09-07 18:27:10,830 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-09-07 18:27:10,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-09-07 18:27:10,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((a23 <= 599997 && 1 == a4 && a25 == 10) || !(130 <= \old(a29))) || !(312 <= \old(a23))) || (((a25 == 9 && a23 + 119992 <= 0) && (0 < a23 + 43 || 140 < a29)) && a4 == \old(a4))) || (a23 <= 600000 && 140 < a29 && (a29 <= 274 && 312 <= a23) && 1 == a4)) || !(10 == \old(a25))) || !(\old(a29) <= 130)) || !(1 == \old(a4))) || (a23 + 55 <= 0 && a4 <= 0 && a29 <= 130)) || ((((a25 == 12 && a4 <= 0) && a29 <= 274) && 140 < a29) && a23 + 55 <= 0)) || ((((((((a25 == 9 && 0 <= \old(a23) + 42) && (0 < a23 + 43 || 140 < a29)) && ((11 == \old(a25) || 12 == \old(a25)) || 10 == \old(a25))) && 130 <= a29) && a4 == \old(a4)) && 1 == a4) && a23 + 55 <= 0) && 277 <= a29)) || (a23 <= 599997 && 140 < a29 && (!(a25 == 12) && (\exists v_~a29~0_505 : int :: (a29 <= v_~a29~0_505 % 15 + 260 && \old(a29) <= v_~a29~0_505) && 0 <= v_~a29~0_505)) && 1 == a4)) || (((a25 == 13 && a23 + 599772 <= 0) && 140 < a29) && 1 == a4)) || (((a25 == 9 && a4 <= 0) && 277 < a29) && a23 + 55 <= 0)) || (((a25 == 13 && a23 <= 599997) && 0 < a23 + 43) && a4 == \old(a4))) || (((a23 <= 599997 && 0 < a23 + 43) && 140 < a29) && a4 == \old(a4))) || ((a23 <= 371192 && (((((a25 == 9 && 0 <= \old(a23) + 42) && (0 < a23 + 43 || 140 < a29)) && ((11 == \old(a25) || 12 == \old(a25)) || 10 == \old(a25))) && 130 <= a29) && a4 == \old(a4)) && 1 == a4) && 277 < a29)) || (((a23 <= 371192 && 140 < a29) && (((((a25 == 9 && 0 <= \old(a23) + 42) && (0 < a23 + 43 || 140 < a29)) && ((11 == \old(a25) || 12 == \old(a25)) || 10 == \old(a25))) && 130 <= a29) && a4 == \old(a4)) && 1 == a4) && a29 <= 275)) || ((a25 == 9 && a23 <= 312 && 0 < a23 + 43) && 1 == a4)) || !(\old(a23) <= 312)) || !(1 == a3)) || (a23 <= 600000 && ((a25 <= 11 && 277 < a29) && 0 < a23 + 43) && a4 == \old(a4))) || (((a25 == 12 && a23 <= 312) && 0 < a23 + 43) && a4 == \old(a4))) || (((0 < a23 + 43 && 130 <= a29) && 1 == a4) && a23 <= 138)) || !(15 == a8)) || ((((a4 <= 0 && a23 + 119992 <= 0) && a25 == 12) && 140 < a29) && a29 <= 275) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 292 locations, 1 error locations. SAFE Result, 670.9s OverallTime, 17 OverallIterations, 11 TraceHistogramMax, 292.3s AutomataDifference, 0.0s DeadEndRemovalTime, 339.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1681 SDtfs, 51695 SDslu, 3926 SDs, 0 SdLazy, 77690 SolverSat, 19389 SolverUnsat, 78 SolverUnknown, 0 SolverNotchecked, 199.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9619 GetRequests, 8906 SyntacticMatches, 11 SemanticMatches, 702 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 30388 ImplicationChecksByTransitivity, 75.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50394occurred 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: 8.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 25070 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 2556 PreInvPairs, 3366 NumberOfFragments, 1837 HoareAnnotationTreeSize, 2556 FomulaSimplifications, 4812821 FormulaSimplificationTreeSizeReduction, 26.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1073780 FormulaSimplificationTreeSizeReductionInter, 312.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 17434 NumberOfCodeBlocks, 17434 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 17403 ConstructedInterpolants, 23 QuantifiedInterpolants, 29589942 SizeOfPredicates, 15 NumberOfNonLiveVariables, 13061 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 31 InterpolantComputations, 5 PerfectInterpolantSequences, 36738/40678 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...