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_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 18:19:06,975 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 18:19:06,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 18:19:06,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 18:19:06,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 18:19:06,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 18:19:06,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 18:19:07,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 18:19:07,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 18:19:07,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 18:19:07,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 18:19:07,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 18:19:07,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 18:19:07,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 18:19:07,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 18:19:07,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 18:19:07,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 18:19:07,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 18:19:07,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 18:19:07,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 18:19:07,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 18:19:07,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 18:19:07,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 18:19:07,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 18:19:07,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 18:19:07,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 18:19:07,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 18:19:07,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 18:19:07,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 18:19:07,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 18:19:07,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 18:19:07,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 18:19:07,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 18:19:07,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 18:19:07,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 18:19:07,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 18:19:07,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 18:19:07,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 18:19:07,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 18:19:07,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 18:19:07,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 18:19:07,044 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:19:07,059 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 18:19:07,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 18:19:07,060 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 18:19:07,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 18:19:07,061 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 18:19:07,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 18:19:07,061 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 18:19:07,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 18:19:07,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 18:19:07,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 18:19:07,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 18:19:07,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 18:19:07,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 18:19:07,062 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 18:19:07,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 18:19:07,063 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 18:19:07,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 18:19:07,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 18:19:07,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 18:19:07,064 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 18:19:07,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 18:19:07,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 18:19:07,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 18:19:07,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 18:19:07,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 18:19:07,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 18:19:07,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 18:19:07,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 18:19:07,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 18:19:07,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 18:19:07,135 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 18:19:07,139 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 18:19:07,140 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 18:19:07,141 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 18:19:07,141 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label28.c [2019-09-07 18:19:07,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e148f7a7a/2c429cf3a5734578851f6300a6064da6/FLAG8e2c0bcc8 [2019-09-07 18:19:07,847 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 18:19:07,849 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label28.c [2019-09-07 18:19:07,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e148f7a7a/2c429cf3a5734578851f6300a6064da6/FLAG8e2c0bcc8 [2019-09-07 18:19:08,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e148f7a7a/2c429cf3a5734578851f6300a6064da6 [2019-09-07 18:19:08,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 18:19:08,036 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 18:19:08,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 18:19:08,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 18:19:08,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 18:19:08,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:19:08" (1/1) ... [2019-09-07 18:19:08,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aaddbe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:19:08, skipping insertion in model container [2019-09-07 18:19:08,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:19:08" (1/1) ... [2019-09-07 18:19:08,052 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 18:19:08,112 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 18:19:08,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:19:08,853 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 18:19:09,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:19:09,094 INFO L192 MainTranslator]: Completed translation [2019-09-07 18:19:09,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:19:09 WrapperNode [2019-09-07 18:19:09,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 18:19:09,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 18:19:09,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 18:19:09,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 18:19:09,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:19:09" (1/1) ... [2019-09-07 18:19:09,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:19:09" (1/1) ... [2019-09-07 18:19:09,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:19:09" (1/1) ... [2019-09-07 18:19:09,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:19:09" (1/1) ... [2019-09-07 18:19:09,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:19:09" (1/1) ... [2019-09-07 18:19:09,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:19:09" (1/1) ... [2019-09-07 18:19:09,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:19:09" (1/1) ... [2019-09-07 18:19:09,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 18:19:09,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 18:19:09,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 18:19:09,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 18:19:09,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:19:09" (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:19:09,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 18:19:09,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 18:19:09,335 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 18:19:09,335 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 18:19:09,336 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 18:19:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 18:19:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 18:19:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 18:19:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 18:19:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 18:19:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 18:19:11,149 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 18:19:11,150 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 18:19:11,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:19:11 BoogieIcfgContainer [2019-09-07 18:19:11,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 18:19:11,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 18:19:11,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 18:19:11,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 18:19:11,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 06:19:08" (1/3) ... [2019-09-07 18:19:11,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190e9759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:19:11, skipping insertion in model container [2019-09-07 18:19:11,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:19:09" (2/3) ... [2019-09-07 18:19:11,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190e9759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:19:11, skipping insertion in model container [2019-09-07 18:19:11,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:19:11" (3/3) ... [2019-09-07 18:19:11,161 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label28.c [2019-09-07 18:19:11,171 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 18:19:11,181 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 18:19:11,200 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 18:19:11,238 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 18:19:11,239 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 18:19:11,239 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 18:19:11,239 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 18:19:11,240 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 18:19:11,240 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 18:19:11,240 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 18:19:11,240 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 18:19:11,240 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 18:19:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-09-07 18:19:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-07 18:19:11,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:11,278 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] [2019-09-07 18:19:11,280 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:11,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:11,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1610348989, now seen corresponding path program 1 times [2019-09-07 18:19:11,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:11,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:11,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:11,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:11,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:11,740 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:19:11,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:19:11,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:19:11,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:19:11,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:19:11,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:19:11,765 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 4 states. [2019-09-07 18:19:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:13,956 INFO L93 Difference]: Finished difference Result 978 states and 1754 transitions. [2019-09-07 18:19:13,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:19:13,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-09-07 18:19:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:13,990 INFO L225 Difference]: With dead ends: 978 [2019-09-07 18:19:13,990 INFO L226 Difference]: Without dead ends: 619 [2019-09-07 18:19:14,000 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:19:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-09-07 18:19:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-09-07 18:19:14,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-09-07 18:19:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 859 transitions. [2019-09-07 18:19:14,103 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 859 transitions. Word has length 54 [2019-09-07 18:19:14,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:14,104 INFO L475 AbstractCegarLoop]: Abstraction has 619 states and 859 transitions. [2019-09-07 18:19:14,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:19:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 859 transitions. [2019-09-07 18:19:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-07 18:19:14,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:14,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,112 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:14,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1973618443, now seen corresponding path program 1 times [2019-09-07 18:19:14,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:14,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:14,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:14,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:14,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:19:14,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:19:14,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:19:14,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:19:14,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:19:14,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:19:14,324 INFO L87 Difference]: Start difference. First operand 619 states and 859 transitions. Second operand 4 states. [2019-09-07 18:19:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:16,308 INFO L93 Difference]: Finished difference Result 2378 states and 3384 transitions. [2019-09-07 18:19:16,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:19:16,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-07 18:19:16,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:16,322 INFO L225 Difference]: With dead ends: 2378 [2019-09-07 18:19:16,322 INFO L226 Difference]: Without dead ends: 1765 [2019-09-07 18:19:16,325 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:19:16,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-09-07 18:19:16,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1750. [2019-09-07 18:19:16,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-09-07 18:19:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2347 transitions. [2019-09-07 18:19:16,414 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2347 transitions. Word has length 127 [2019-09-07 18:19:16,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:16,417 INFO L475 AbstractCegarLoop]: Abstraction has 1750 states and 2347 transitions. [2019-09-07 18:19:16,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:19:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2347 transitions. [2019-09-07 18:19:16,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-07 18:19:16,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:16,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,434 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:16,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:16,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1199392174, now seen corresponding path program 1 times [2019-09-07 18:19:16,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:16,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:16,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:16,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:16,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:19:16,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:19:16,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 18:19:16,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:19:16,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:19:16,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:19:16,688 INFO L87 Difference]: Start difference. First operand 1750 states and 2347 transitions. Second operand 6 states. [2019-09-07 18:19:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:18,581 INFO L93 Difference]: Finished difference Result 4688 states and 6402 transitions. [2019-09-07 18:19:18,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:19:18,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-07 18:19:18,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:18,597 INFO L225 Difference]: With dead ends: 4688 [2019-09-07 18:19:18,598 INFO L226 Difference]: Without dead ends: 2944 [2019-09-07 18:19:18,602 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:19:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2019-09-07 18:19:18,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2929. [2019-09-07 18:19:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2929 states. [2019-09-07 18:19:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 3748 transitions. [2019-09-07 18:19:18,693 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 3748 transitions. Word has length 134 [2019-09-07 18:19:18,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:18,694 INFO L475 AbstractCegarLoop]: Abstraction has 2929 states and 3748 transitions. [2019-09-07 18:19:18,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:19:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 3748 transitions. [2019-09-07 18:19:18,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-07 18:19:18,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:18,701 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:19:18,701 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:18,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:18,702 INFO L82 PathProgramCache]: Analyzing trace with hash -91916028, now seen corresponding path program 1 times [2019-09-07 18:19:18,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:18,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:18,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:18,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:18,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:18,926 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 165 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:19:18,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:18,927 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:19:18,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:19,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 18:19:19,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:19,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:19:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-07 18:19:19,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:19:19,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 18:19:19,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:19:19,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:19:19,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:19:19,266 INFO L87 Difference]: Start difference. First operand 2929 states and 3748 transitions. Second operand 9 states. [2019-09-07 18:19:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:23,920 INFO L93 Difference]: Finished difference Result 8496 states and 11469 transitions. [2019-09-07 18:19:23,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 18:19:23,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 207 [2019-09-07 18:19:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:23,954 INFO L225 Difference]: With dead ends: 8496 [2019-09-07 18:19:23,954 INFO L226 Difference]: Without dead ends: 5573 [2019-09-07 18:19:23,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-09-07 18:19:23,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5573 states. [2019-09-07 18:19:24,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5573 to 5534. [2019-09-07 18:19:24,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5534 states. [2019-09-07 18:19:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5534 states to 5534 states and 7399 transitions. [2019-09-07 18:19:24,157 INFO L78 Accepts]: Start accepts. Automaton has 5534 states and 7399 transitions. Word has length 207 [2019-09-07 18:19:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:24,159 INFO L475 AbstractCegarLoop]: Abstraction has 5534 states and 7399 transitions. [2019-09-07 18:19:24,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:19:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 5534 states and 7399 transitions. [2019-09-07 18:19:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-07 18:19:24,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:24,171 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:19:24,171 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:24,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:24,172 INFO L82 PathProgramCache]: Analyzing trace with hash 563951691, now seen corresponding path program 1 times [2019-09-07 18:19:24,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:24,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:24,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:24,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:24,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-07 18:19:24,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:24,579 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:19:24,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:24,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:19:24,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:24,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:19:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 172 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:19:24,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:19:24,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 18:19:24,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 18:19:24,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 18:19:24,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-07 18:19:24,795 INFO L87 Difference]: Start difference. First operand 5534 states and 7399 transitions. Second operand 10 states. [2019-09-07 18:19:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:34,514 INFO L93 Difference]: Finished difference Result 17042 states and 24236 transitions. [2019-09-07 18:19:34,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 18:19:34,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 250 [2019-09-07 18:19:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:34,577 INFO L225 Difference]: With dead ends: 17042 [2019-09-07 18:19:34,577 INFO L226 Difference]: Without dead ends: 11522 [2019-09-07 18:19:34,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=352, Invalid=1810, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 18:19:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11522 states. [2019-09-07 18:19:34,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11522 to 11382. [2019-09-07 18:19:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11382 states. [2019-09-07 18:19:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11382 states to 11382 states and 14865 transitions. [2019-09-07 18:19:34,983 INFO L78 Accepts]: Start accepts. Automaton has 11382 states and 14865 transitions. Word has length 250 [2019-09-07 18:19:34,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:34,984 INFO L475 AbstractCegarLoop]: Abstraction has 11382 states and 14865 transitions. [2019-09-07 18:19:34,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 18:19:34,984 INFO L276 IsEmpty]: Start isEmpty. Operand 11382 states and 14865 transitions. [2019-09-07 18:19:35,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-07 18:19:35,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:35,083 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:19:35,083 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:35,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:35,084 INFO L82 PathProgramCache]: Analyzing trace with hash 11397960, now seen corresponding path program 1 times [2019-09-07 18:19:35,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:35,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:35,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:35,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:35,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-07 18:19:35,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:19:35,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 18:19:35,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 18:19:35,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 18:19:35,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:19:35,325 INFO L87 Difference]: Start difference. First operand 11382 states and 14865 transitions. Second operand 3 states. [2019-09-07 18:19:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:36,492 INFO L93 Difference]: Finished difference Result 25969 states and 34384 transitions. [2019-09-07 18:19:36,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 18:19:36,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-09-07 18:19:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:36,565 INFO L225 Difference]: With dead ends: 25969 [2019-09-07 18:19:36,566 INFO L226 Difference]: Without dead ends: 14785 [2019-09-07 18:19:36,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:36,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14785 states. [2019-09-07 18:19:36,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14785 to 12712. [2019-09-07 18:19:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12712 states. [2019-09-07 18:19:36,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12712 states to 12712 states and 16548 transitions. [2019-09-07 18:19:36,966 INFO L78 Accepts]: Start accepts. Automaton has 12712 states and 16548 transitions. Word has length 292 [2019-09-07 18:19:36,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:36,967 INFO L475 AbstractCegarLoop]: Abstraction has 12712 states and 16548 transitions. [2019-09-07 18:19:36,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 18:19:36,968 INFO L276 IsEmpty]: Start isEmpty. Operand 12712 states and 16548 transitions. [2019-09-07 18:19:36,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-07 18:19:36,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:36,989 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:19:36,999 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:37,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:37,001 INFO L82 PathProgramCache]: Analyzing trace with hash -777562786, now seen corresponding path program 1 times [2019-09-07 18:19:37,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:37,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:37,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:37,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:37,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 221 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:19:37,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:37,924 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:19:37,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:38,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:19:38,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 221 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:19:38,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:19:38,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 17 [2019-09-07 18:19:38,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 18:19:38,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 18:19:38,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-07 18:19:38,181 INFO L87 Difference]: Start difference. First operand 12712 states and 16548 transitions. Second operand 17 states. [2019-09-07 18:19:42,941 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-09-07 18:19:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:43,177 INFO L93 Difference]: Finished difference Result 25527 states and 34783 transitions. [2019-09-07 18:19:43,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 18:19:43,178 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 333 [2019-09-07 18:19:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:43,240 INFO L225 Difference]: With dead ends: 25527 [2019-09-07 18:19:43,240 INFO L226 Difference]: Without dead ends: 13013 [2019-09-07 18:19:43,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 342 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=628, Invalid=1822, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 18:19:43,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13013 states. [2019-09-07 18:19:43,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13013 to 12765. [2019-09-07 18:19:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12765 states. [2019-09-07 18:19:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12765 states to 12765 states and 16496 transitions. [2019-09-07 18:19:43,570 INFO L78 Accepts]: Start accepts. Automaton has 12765 states and 16496 transitions. Word has length 333 [2019-09-07 18:19:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:43,571 INFO L475 AbstractCegarLoop]: Abstraction has 12765 states and 16496 transitions. [2019-09-07 18:19:43,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 18:19:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 12765 states and 16496 transitions. [2019-09-07 18:19:43,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-07 18:19:43,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:43,594 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, 3, 3, 3, 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, 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:43,595 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:43,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:43,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1923645087, now seen corresponding path program 1 times [2019-09-07 18:19:43,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:43,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:43,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:43,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:43,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 321 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-07 18:19:43,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:43,906 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:19:43,922 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:19:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:44,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:19:44,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 321 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-07 18:19:44,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:19:44,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-09-07 18:19:44,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:19:44,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:19:44,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:19:44,117 INFO L87 Difference]: Start difference. First operand 12765 states and 16496 transitions. Second operand 6 states. [2019-09-07 18:19:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:19:45,697 INFO L93 Difference]: Finished difference Result 24551 states and 33140 transitions. [2019-09-07 18:19:45,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:19:45,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 349 [2019-09-07 18:19:45,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:19:45,758 INFO L225 Difference]: With dead ends: 24551 [2019-09-07 18:19:45,758 INFO L226 Difference]: Without dead ends: 12152 [2019-09-07 18:19:45,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 353 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:19:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12152 states. [2019-09-07 18:19:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12152 to 11218. [2019-09-07 18:19:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11218 states. [2019-09-07 18:19:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11218 states to 11218 states and 13951 transitions. [2019-09-07 18:19:46,096 INFO L78 Accepts]: Start accepts. Automaton has 11218 states and 13951 transitions. Word has length 349 [2019-09-07 18:19:46,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:19:46,097 INFO L475 AbstractCegarLoop]: Abstraction has 11218 states and 13951 transitions. [2019-09-07 18:19:46,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:19:46,097 INFO L276 IsEmpty]: Start isEmpty. Operand 11218 states and 13951 transitions. [2019-09-07 18:19:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-07 18:19:46,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:19:46,119 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:19:46,119 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:19:46,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:19:46,120 INFO L82 PathProgramCache]: Analyzing trace with hash 838668360, now seen corresponding path program 1 times [2019-09-07 18:19:46,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:19:46,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:19:46,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:46,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:46,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:19:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 168 proven. 125 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-07 18:19:46,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:19:46,861 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:19:46,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:19:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:19:47,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 18:19:47,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:19:47,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:19:47,292 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 325 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 18:19:47,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:19:47,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5] total 20 [2019-09-07 18:19:47,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 18:19:47,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 18:19:47,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-09-07 18:19:47,308 INFO L87 Difference]: Start difference. First operand 11218 states and 13951 transitions. Second operand 20 states. [2019-09-07 18:20:01,925 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-07 18:20:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:20:04,301 INFO L93 Difference]: Finished difference Result 26818 states and 35560 transitions. [2019-09-07 18:20:04,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-07 18:20:04,301 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 353 [2019-09-07 18:20:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:20:04,346 INFO L225 Difference]: With dead ends: 26818 [2019-09-07 18:20:04,346 INFO L226 Difference]: Without dead ends: 14970 [2019-09-07 18:20:04,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2304 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1200, Invalid=6282, Unknown=0, NotChecked=0, Total=7482 [2019-09-07 18:20:04,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14970 states. [2019-09-07 18:20:04,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14970 to 13275. [2019-09-07 18:20:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13275 states. [2019-09-07 18:20:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13275 states to 13275 states and 16113 transitions. [2019-09-07 18:20:04,657 INFO L78 Accepts]: Start accepts. Automaton has 13275 states and 16113 transitions. Word has length 353 [2019-09-07 18:20:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:20:04,658 INFO L475 AbstractCegarLoop]: Abstraction has 13275 states and 16113 transitions. [2019-09-07 18:20:04,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 18:20:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 13275 states and 16113 transitions. [2019-09-07 18:20:04,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-07 18:20:04,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:20:04,680 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:20:04,680 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:20:04,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:20:04,681 INFO L82 PathProgramCache]: Analyzing trace with hash -100766097, now seen corresponding path program 1 times [2019-09-07 18:20:04,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:20:04,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:20:04,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:04,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:04,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 245 proven. 170 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 18:20:05,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:20:05,631 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:20:05,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:05,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:20:05,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:20:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 336 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 18:20:05,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:20:05,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 19 [2019-09-07 18:20:05,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 18:20:05,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 18:20:05,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2019-09-07 18:20:05,860 INFO L87 Difference]: Start difference. First operand 13275 states and 16113 transitions. Second operand 19 states. [2019-09-07 18:20:06,061 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-09-07 18:20:17,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:20:17,023 INFO L93 Difference]: Finished difference Result 31408 states and 40268 transitions. [2019-09-07 18:20:17,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-07 18:20:17,024 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 364 [2019-09-07 18:20:17,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:20:17,088 INFO L225 Difference]: With dead ends: 31408 [2019-09-07 18:20:17,088 INFO L226 Difference]: Without dead ends: 18115 [2019-09-07 18:20:17,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 417 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2113 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1174, Invalid=5306, Unknown=0, NotChecked=0, Total=6480 [2019-09-07 18:20:17,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18115 states. [2019-09-07 18:20:17,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18115 to 14636. [2019-09-07 18:20:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14636 states. [2019-09-07 18:20:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14636 states to 14636 states and 17468 transitions. [2019-09-07 18:20:17,478 INFO L78 Accepts]: Start accepts. Automaton has 14636 states and 17468 transitions. Word has length 364 [2019-09-07 18:20:17,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:20:17,479 INFO L475 AbstractCegarLoop]: Abstraction has 14636 states and 17468 transitions. [2019-09-07 18:20:17,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 18:20:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand 14636 states and 17468 transitions. [2019-09-07 18:20:17,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-07 18:20:17,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:20:17,508 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:17,508 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:20:17,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:20:17,509 INFO L82 PathProgramCache]: Analyzing trace with hash 84971668, now seen corresponding path program 1 times [2019-09-07 18:20:17,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:20:17,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:20:17,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:17,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:17,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:20:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 146 proven. 209 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-07 18:20:17,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:20:17,927 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:20:17,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:20:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:20:18,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:20:18,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:20:18,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:20:18,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:20:20,283 WARN L188 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-09-07 18:20:20,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:20:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 309 proven. 2 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-07 18:20:22,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:20:22,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-07 18:20:22,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 18:20:22,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 18:20:22,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110 [2019-09-07 18:20:22,263 INFO L87 Difference]: Start difference. First operand 14636 states and 17468 transitions. Second operand 11 states. [2019-09-07 18:20:34,107 WARN L188 SmtUtils]: Spent 4.45 s on a formula simplification. DAG size of input: 32 DAG size of output: 13 [2019-09-07 18:21:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:21:01,064 INFO L93 Difference]: Finished difference Result 42368 states and 51869 transitions. [2019-09-07 18:21:01,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 18:21:01,065 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 397 [2019-09-07 18:21:01,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:21:01,146 INFO L225 Difference]: With dead ends: 42368 [2019-09-07 18:21:01,146 INFO L226 Difference]: Without dead ends: 27932 [2019-09-07 18:21:01,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 414 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=232, Invalid=758, Unknown=2, NotChecked=0, Total=992 [2019-09-07 18:21:01,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27932 states. [2019-09-07 18:21:01,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27932 to 25856. [2019-09-07 18:21:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25856 states. [2019-09-07 18:21:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25856 states to 25856 states and 30516 transitions. [2019-09-07 18:21:01,752 INFO L78 Accepts]: Start accepts. Automaton has 25856 states and 30516 transitions. Word has length 397 [2019-09-07 18:21:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:21:01,753 INFO L475 AbstractCegarLoop]: Abstraction has 25856 states and 30516 transitions. [2019-09-07 18:21:01,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 18:21:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 25856 states and 30516 transitions. [2019-09-07 18:21:01,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-07 18:21:01,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:21:01,781 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:21:01,782 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:21:01,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:21:01,782 INFO L82 PathProgramCache]: Analyzing trace with hash 636376888, now seen corresponding path program 1 times [2019-09-07 18:21:01,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:21:01,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:21:01,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:01,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:01,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 11 proven. 145 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2019-09-07 18:21:02,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:21:02,181 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:21:02,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:02,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 18:21:02,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:21:02,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:21:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 360 proven. 4 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-07 18:21:02,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:21:02,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-09-07 18:21:02,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 18:21:02,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 18:21:02,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-07 18:21:02,575 INFO L87 Difference]: Start difference. First operand 25856 states and 30516 transitions. Second operand 15 states. [2019-09-07 18:21:13,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:21:13,415 INFO L93 Difference]: Finished difference Result 72379 states and 89380 transitions. [2019-09-07 18:21:13,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-07 18:21:13,415 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 411 [2019-09-07 18:21:13,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:21:13,559 INFO L225 Difference]: With dead ends: 72379 [2019-09-07 18:21:13,560 INFO L226 Difference]: Without dead ends: 48983 [2019-09-07 18:21:13,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2726 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1109, Invalid=6201, Unknown=0, NotChecked=0, Total=7310 [2019-09-07 18:21:13,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48983 states. [2019-09-07 18:21:14,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48983 to 44728. [2019-09-07 18:21:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44728 states. [2019-09-07 18:21:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44728 states to 44728 states and 52478 transitions. [2019-09-07 18:21:14,647 INFO L78 Accepts]: Start accepts. Automaton has 44728 states and 52478 transitions. Word has length 411 [2019-09-07 18:21:14,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:21:14,648 INFO L475 AbstractCegarLoop]: Abstraction has 44728 states and 52478 transitions. [2019-09-07 18:21:14,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 18:21:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 44728 states and 52478 transitions. [2019-09-07 18:21:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2019-09-07 18:21:14,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:21:14,706 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 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] [2019-09-07 18:21:14,707 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:21:14,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:21:14,707 INFO L82 PathProgramCache]: Analyzing trace with hash -281957481, now seen corresponding path program 1 times [2019-09-07 18:21:14,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:21:14,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:21:14,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:14,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:14,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 433 proven. 105 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-09-07 18:21:15,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:21:15,921 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:21:15,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:16,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:21:16,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:21:16,321 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 507 proven. 2 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:21:16,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:21:16,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-07 18:21:16,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 18:21:16,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 18:21:16,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-07 18:21:16,335 INFO L87 Difference]: Start difference. First operand 44728 states and 52478 transitions. Second operand 15 states. [2019-09-07 18:21:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:21:24,251 INFO L93 Difference]: Finished difference Result 94036 states and 110965 transitions. [2019-09-07 18:21:24,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 18:21:24,251 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 566 [2019-09-07 18:21:24,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:21:24,370 INFO L225 Difference]: With dead ends: 94036 [2019-09-07 18:21:24,370 INFO L226 Difference]: Without dead ends: 49300 [2019-09-07 18:21:24,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 597 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=797, Invalid=3493, Unknown=0, NotChecked=0, Total=4290 [2019-09-07 18:21:24,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49300 states. [2019-09-07 18:21:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49300 to 48292. [2019-09-07 18:21:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48292 states. [2019-09-07 18:21:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48292 states to 48292 states and 55894 transitions. [2019-09-07 18:21:25,213 INFO L78 Accepts]: Start accepts. Automaton has 48292 states and 55894 transitions. Word has length 566 [2019-09-07 18:21:25,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:21:25,213 INFO L475 AbstractCegarLoop]: Abstraction has 48292 states and 55894 transitions. [2019-09-07 18:21:25,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 18:21:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 48292 states and 55894 transitions. [2019-09-07 18:21:25,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-09-07 18:21:25,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:21:25,264 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 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:21:25,264 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:21:25,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:21:25,265 INFO L82 PathProgramCache]: Analyzing trace with hash 587302935, now seen corresponding path program 1 times [2019-09-07 18:21:25,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:21:25,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:21:25,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:25,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:25,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 537 proven. 100 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2019-09-07 18:21:25,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:21:25,682 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:21:25,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:26,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 946 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:21:26,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:21:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 873 proven. 2 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2019-09-07 18:21:26,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:21:26,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 18:21:26,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:21:26,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:21:26,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:21:26,288 INFO L87 Difference]: Start difference. First operand 48292 states and 55894 transitions. Second operand 9 states. [2019-09-07 18:21:28,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:21:28,489 INFO L93 Difference]: Finished difference Result 93766 states and 109387 transitions. [2019-09-07 18:21:28,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 18:21:28,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 609 [2019-09-07 18:21:28,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:21:28,592 INFO L225 Difference]: With dead ends: 93766 [2019-09-07 18:21:28,593 INFO L226 Difference]: Without dead ends: 43928 [2019-09-07 18:21:28,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 614 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:21:28,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43928 states. [2019-09-07 18:21:29,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43928 to 42322. [2019-09-07 18:21:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42322 states. [2019-09-07 18:21:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42322 states to 42322 states and 47967 transitions. [2019-09-07 18:21:29,428 INFO L78 Accepts]: Start accepts. Automaton has 42322 states and 47967 transitions. Word has length 609 [2019-09-07 18:21:29,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:21:29,429 INFO L475 AbstractCegarLoop]: Abstraction has 42322 states and 47967 transitions. [2019-09-07 18:21:29,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:21:29,430 INFO L276 IsEmpty]: Start isEmpty. Operand 42322 states and 47967 transitions. [2019-09-07 18:21:29,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2019-09-07 18:21:29,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:21:29,487 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 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] [2019-09-07 18:21:29,487 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:21:29,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:21:29,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1525436706, now seen corresponding path program 1 times [2019-09-07 18:21:29,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:21:29,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:21:29,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:29,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:29,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:21:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 262 proven. 562 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-09-07 18:21:30,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:21:30,241 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:21:30,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:21:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:21:30,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:21:30,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:21:30,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:30,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:32,532 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-09-07 18:21:32,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:21:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 594 proven. 46 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2019-09-07 18:21:32,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:21:32,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-07 18:21:32,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 18:21:32,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 18:21:32,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-07 18:21:32,939 INFO L87 Difference]: Start difference. First operand 42322 states and 47967 transitions. Second operand 12 states. [2019-09-07 18:21:52,915 WARN L188 SmtUtils]: Spent 776.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-09-07 18:22:13,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:22:13,491 INFO L93 Difference]: Finished difference Result 102798 states and 117040 transitions. [2019-09-07 18:22:13,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 18:22:13,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 610 [2019-09-07 18:22:13,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:22:13,599 INFO L225 Difference]: With dead ends: 102798 [2019-09-07 18:22:13,599 INFO L226 Difference]: Without dead ends: 62606 [2019-09-07 18:22:13,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 625 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2019-09-07 18:22:13,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62606 states. [2019-09-07 18:22:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62606 to 57715. [2019-09-07 18:22:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57715 states. [2019-09-07 18:22:14,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57715 states to 57715 states and 65353 transitions. [2019-09-07 18:22:14,342 INFO L78 Accepts]: Start accepts. Automaton has 57715 states and 65353 transitions. Word has length 610 [2019-09-07 18:22:14,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:22:14,342 INFO L475 AbstractCegarLoop]: Abstraction has 57715 states and 65353 transitions. [2019-09-07 18:22:14,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 18:22:14,343 INFO L276 IsEmpty]: Start isEmpty. Operand 57715 states and 65353 transitions. [2019-09-07 18:22:14,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 770 [2019-09-07 18:22:14,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:22:14,392 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 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] [2019-09-07 18:22:14,393 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:22:14,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:22:14,393 INFO L82 PathProgramCache]: Analyzing trace with hash -701277203, now seen corresponding path program 1 times [2019-09-07 18:22:14,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:22:14,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:22:14,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:14,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:14,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 601 proven. 246 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2019-09-07 18:22:15,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:22:15,060 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:22:15,073 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:22:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:15,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1148 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 18:22:15,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:22:15,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:15,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 18:22:15,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:15,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 18:22:15,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 18:22:17,282 WARN L188 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-09-07 18:22:17,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:22:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 719 proven. 496 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-09-07 18:22:18,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:22:18,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 14 [2019-09-07 18:22:18,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 18:22:18,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 18:22:18,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-07 18:22:18,255 INFO L87 Difference]: Start difference. First operand 57715 states and 65353 transitions. Second operand 14 states. [2019-09-07 18:22:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:22:28,235 INFO L93 Difference]: Finished difference Result 116530 states and 132351 transitions. [2019-09-07 18:22:28,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 18:22:28,235 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 769 [2019-09-07 18:22:28,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:22:28,340 INFO L225 Difference]: With dead ends: 116530 [2019-09-07 18:22:28,340 INFO L226 Difference]: Without dead ends: 59199 [2019-09-07 18:22:28,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 865 GetRequests, 798 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1504 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=783, Invalid=3773, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 18:22:28,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59199 states. [2019-09-07 18:22:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59199 to 49208. [2019-09-07 18:22:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49208 states. [2019-09-07 18:22:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49208 states to 49208 states and 54987 transitions. [2019-09-07 18:22:29,074 INFO L78 Accepts]: Start accepts. Automaton has 49208 states and 54987 transitions. Word has length 769 [2019-09-07 18:22:29,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:22:29,074 INFO L475 AbstractCegarLoop]: Abstraction has 49208 states and 54987 transitions. [2019-09-07 18:22:29,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 18:22:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 49208 states and 54987 transitions. [2019-09-07 18:22:29,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2019-09-07 18:22:29,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:22:29,118 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:22:29,118 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:22:29,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:22:29,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2107287855, now seen corresponding path program 1 times [2019-09-07 18:22:29,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:22:29,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:22:29,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:29,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:29,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:31,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1866 backedges. 559 proven. 164 refuted. 0 times theorem prover too weak. 1143 trivial. 0 not checked. [2019-09-07 18:22:31,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:22:31,285 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:22:31,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:31,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 18:22:31,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:22:31,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:31,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:31,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:31,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:31,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:31,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:31,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:31,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1866 backedges. 1241 proven. 2 refuted. 0 times theorem prover too weak. 623 trivial. 0 not checked. [2019-09-07 18:22:32,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:22:32,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2019-09-07 18:22:32,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 18:22:32,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 18:22:32,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-07 18:22:32,280 INFO L87 Difference]: Start difference. First operand 49208 states and 54987 transitions. Second operand 7 states. [2019-09-07 18:22:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:22:34,691 INFO L93 Difference]: Finished difference Result 99080 states and 110596 transitions. [2019-09-07 18:22:34,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 18:22:34,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 831 [2019-09-07 18:22:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:22:34,766 INFO L225 Difference]: With dead ends: 99080 [2019-09-07 18:22:34,767 INFO L226 Difference]: Without dead ends: 50264 [2019-09-07 18:22:34,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 855 GetRequests, 839 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-09-07 18:22:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50264 states. [2019-09-07 18:22:35,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50264 to 41926. [2019-09-07 18:22:35,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41926 states. [2019-09-07 18:22:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41926 states to 41926 states and 45372 transitions. [2019-09-07 18:22:35,545 INFO L78 Accepts]: Start accepts. Automaton has 41926 states and 45372 transitions. Word has length 831 [2019-09-07 18:22:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:22:35,546 INFO L475 AbstractCegarLoop]: Abstraction has 41926 states and 45372 transitions. [2019-09-07 18:22:35,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 18:22:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 41926 states and 45372 transitions. [2019-09-07 18:22:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 979 [2019-09-07 18:22:35,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:22:35,586 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 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:22:35,587 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:22:35,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:22:35,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1356699824, now seen corresponding path program 1 times [2019-09-07 18:22:35,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:22:35,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:22:35,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:35,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:22:35,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:22:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3717 backedges. 745 proven. 419 refuted. 0 times theorem prover too weak. 2553 trivial. 0 not checked. [2019-09-07 18:22:36,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:22:36,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:22:36,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:22:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:22:37,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 1482 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 18:22:37,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:22:37,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:37,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:22:38,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3717 backedges. 1938 proven. 154 refuted. 0 times theorem prover too weak. 1625 trivial. 0 not checked. [2019-09-07 18:22:38,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:22:38,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-07 18:22:38,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 18:22:38,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 18:22:38,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-07 18:22:38,377 INFO L87 Difference]: Start difference. First operand 41926 states and 45372 transitions. Second operand 11 states. [2019-09-07 18:22:53,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:22:53,629 INFO L93 Difference]: Finished difference Result 81635 states and 88395 transitions. [2019-09-07 18:22:53,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 18:22:53,634 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 978 [2019-09-07 18:22:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:22:53,635 INFO L225 Difference]: With dead ends: 81635 [2019-09-07 18:22:53,635 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 18:22:53,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 1001 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=288, Invalid=1692, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 18:22:53,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 18:22:53,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 18:22:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 18:22:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 18:22:53,708 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 978 [2019-09-07 18:22:53,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:22:53,708 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 18:22:53,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 18:22:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 18:22:53,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 18:22:53,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 18:23:05,094 WARN L188 SmtUtils]: Spent 9.36 s on a formula simplification. DAG size of input: 2265 DAG size of output: 1720 [2019-09-07 18:23:13,834 WARN L188 SmtUtils]: Spent 8.73 s on a formula simplification. DAG size of input: 2265 DAG size of output: 1720 [2019-09-07 18:23:13,977 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 38 [2019-09-07 18:23:36,237 WARN L188 SmtUtils]: Spent 22.16 s on a formula simplification. DAG size of input: 1417 DAG size of output: 243 [2019-09-07 18:24:02,405 WARN L188 SmtUtils]: Spent 26.14 s on a formula simplification. DAG size of input: 1566 DAG size of output: 193 [2019-09-07 18:24:28,455 WARN L188 SmtUtils]: Spent 26.04 s on a formula simplification. DAG size of input: 1566 DAG size of output: 193 [2019-09-07 18:24:28,458 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 18:24:28,459 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a29~0 |old(~a29~0)|) (= ~a23~0 |old(~a23~0)|) (= ~a4~0 |old(~a4~0)|) (= ~a25~0 |old(~a25~0)|)) [2019-09-07 18:24:28,459 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 18:24:28,459 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-09-07 18:24:28,459 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-09-07 18:24:28,459 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-09-07 18:24:28,459 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,459 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,459 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,460 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,460 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,460 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,460 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,460 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-09-07 18:24:28,460 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-09-07 18:24:28,460 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-09-07 18:24:28,460 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,460 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,460 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,460 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,460 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,460 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,460 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,461 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,461 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,461 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-09-07 18:24:28,461 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-09-07 18:24:28,461 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-09-07 18:24:28,461 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,461 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,461 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,461 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,461 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,461 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,462 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,462 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,462 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,462 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-09-07 18:24:28,462 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-09-07 18:24:28,462 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-09-07 18:24:28,462 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-09-07 18:24:28,462 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-09-07 18:24:28,462 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-09-07 18:24:28,462 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-09-07 18:24:28,462 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,462 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,463 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,463 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,463 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,463 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,463 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,463 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,463 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,463 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,463 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-09-07 18:24:28,463 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-09-07 18:24:28,464 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-09-07 18:24:28,464 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,464 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,464 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,464 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,464 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,464 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-09-07 18:24:28,464 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-09-07 18:24:28,464 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-09-07 18:24:28,465 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,465 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,465 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,465 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,465 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,465 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-09-07 18:24:28,465 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-09-07 18:24:28,465 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,465 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,466 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,466 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,466 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,466 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,466 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-09-07 18:24:28,466 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-09-07 18:24:28,466 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,466 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,466 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-09-07 18:24:28,467 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-09-07 18:24:28,467 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-09-07 18:24:28,467 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,467 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,467 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,467 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,467 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,467 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,467 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,467 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-09-07 18:24:28,467 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-09-07 18:24:28,467 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-09-07 18:24:28,467 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-09-07 18:24:28,468 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-09-07 18:24:28,468 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-09-07 18:24:28,468 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-09-07 18:24:28,468 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,468 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,468 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-09-07 18:24:28,468 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-09-07 18:24:28,468 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,468 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,468 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,468 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,469 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 22 1026) the Hoare annotation is: (let ((.cse13 (= 1 |old(~a4~0)|)) (.cse43 (+ |old(~a23~0)| 43)) (.cse31 (not (<= |old(~a23~0)| 137))) (.cse45 (= 13 |old(~a25~0)|))) (let ((.cse33 (= ~a29~0 |old(~a29~0)|)) (.cse32 (= ~a23~0 |old(~a23~0)|)) (.cse34 (= ~a4~0 |old(~a4~0)|)) (.cse35 (= ~a25~0 |old(~a25~0)|)) (.cse44 (div (+ |old(~a23~0)| 577632) 5)) (.cse23 (or .cse31 .cse45)) (.cse3 (not (= 9 |old(~a25~0)|))) (.cse2 (not (< 138 |old(~a23~0)|))) (.cse39 (not (<= |old(~a29~0)| 140))) (.cse29 (not (<= .cse43 0))) (.cse0 (not (= 15 ~a8~0))) (.cse1 (not (= 1 ~a3~0))) (.cse27 (not (= 11 |old(~a25~0)|))) (.cse4 (not .cse13))) (let ((.cse17 (not (<= 255 |old(~a29~0)|))) (.cse22 (not .cse45)) (.cse26 (not (<= |old(~a23~0)| 312))) (.cse28 (or .cse0 .cse1 .cse27 .cse4)) (.cse19 (not (<= (+ |old(~a23~0)| 119992) 0))) (.cse16 (not (= 10 |old(~a25~0)|))) (.cse24 (and .cse2 .cse39 .cse29 (not (< 245 |old(~a29~0)|)))) (.cse21 (or .cse0 .cse1 .cse3 .cse4)) (.cse14 (not (<= |old(~a23~0)| 138))) (.cse18 (not (<= |old(~a29~0)| 275))) (.cse20 (not (<= 246 |old(~a29~0)|))) (.cse15 (not (<= 0 (+ |old(~a23~0)| 599992)))) (.cse10 (not (<= |old(~a29~0)| 244))) (.cse11 (not (< 140 |old(~a29~0)|))) (.cse8 (not (<= 312 |old(~a23~0)|))) (.cse42 (or .cse0 .cse1 .cse23 .cse4)) (.cse9 (forall ((v_prenex_3 Int)) (or (not (<= (+ (mod v_prenex_3 15) 260) |old(~a29~0)|)) (not (<= 130 v_prenex_3)) (not (<= 0 v_prenex_3))))) (.cse36 (not (< 0 (+ .cse44 43)))) (.cse37 (not (= (mod (+ |old(~a23~0)| 2) 5) 0))) (.cse38 (not (<= .cse44 138))) (.cse41 (and (and .cse33 .cse32) .cse34 .cse35)) (.cse40 (not (<= 0 (+ .cse44 42)))) (.cse5 (not (<= |old(~a29~0)| 130))) (.cse7 (not (= 12 |old(~a25~0)|))) (.cse6 (and .cse33 .cse32 .cse34 .cse35)) (.cse25 (not (< 0 .cse43)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (or .cse7 .cse0 .cse1 .cse8 .cse9 .cse4) .cse6) (or .cse3 .cse6 .cse10 .cse0 .cse1 .cse11 (forall ((|v_old(~a23~0)_AFTER_CALL_70| Int)) (let ((.cse12 (div (+ |v_old(~a23~0)_AFTER_CALL_70| 577632) 5))) (or (not (< 0 (+ .cse12 43))) (not (<= .cse12 138)) (not (= 0 (mod (+ |v_old(~a23~0)_AFTER_CALL_70| 2) 5))) (not (<= (+ (div |v_old(~a23~0)_AFTER_CALL_70| 5) 371131) |old(~a23~0)|))))) .cse4) (or .cse13 .cse3 .cse6 .cse14 .cse0 .cse1 .cse5 .cse15) (or .cse16 .cse0 .cse1 .cse6 .cse4) (or .cse6 (or .cse7 .cse17 .cse0 .cse1 .cse18 .cse19)) (or (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse20) (or .cse21 .cse17)) .cse6) (or .cse0 .cse1 .cse2 .cse4 .cse22 .cse6) (or .cse16 .cse23 .cse10 .cse24 .cse0 .cse1 .cse6 .cse25) (or .cse26 .cse6 .cse0 .cse1 .cse2 .cse4 .cse7) (or .cse27 .cse10 .cse6 .cse0 .cse1 .cse11 .cse8 .cse4) (or .cse26 .cse2 .cse6 .cse28) (or (or .cse0 .cse1 .cse3 .cse29 (forall ((v_~a29~0_513 Int)) (let ((.cse30 (mod v_~a29~0_513 299861))) (or (not (= 0 .cse30)) (not (<= (+ .cse30 10250) |old(~a29~0)|)) (not (< 140 v_~a29~0_513)))))) .cse6) (or (or .cse31 .cse3) .cse10 .cse6 .cse24 .cse0 .cse1 .cse25) (or (or .cse31 .cse5) .cse0 .cse1 (and .cse32 .cse33 .cse34 .cse35) .cse4 .cse7) (or .cse6 .cse31 .cse13 .cse0 .cse1 .cse22 .cse25) (or .cse6 (or .cse0 .cse1 .cse13 .cse11 .cse7 .cse15) .cse10) (or .cse6 .cse36 .cse7 .cse0 .cse1 .cse37 .cse38) (or .cse26 .cse39 (or .cse0 .cse1 .cse2 .cse3 .cse4) .cse6) (or (and .cse33 .cse32 (= 1 ~a4~0) (= ~a25~0 11)) .cse20 .cse28) (or (and (or .cse27 .cse0 .cse1 .cse29 .cse5) (or .cse40 (or .cse0 .cse1 .cse27) .cse39 .cse19)) (and (and .cse33 .cse32 .cse34) .cse35)) (or (or .cse20 .cse7 .cse0 .cse1 .cse8 .cse18) .cse6) (or (or .cse16 .cse0 .cse1 .cse5) .cse6) (or .cse41 .cse27 .cse42 .cse24) (or .cse7 .cse6 .cse0 .cse1 .cse5 (forall ((v_~a23~0_BEFORE_CALL_12 Int) (v_~a23~0_484 Int)) (or (not (<= v_~a23~0_BEFORE_CALL_12 v_~a23~0_484)) (not (<= (+ v_~a23~0_484 43) 0)) (not (<= 0 (+ (div (+ v_~a23~0_BEFORE_CALL_12 577632) 5) 42))) (not (= 0 (mod v_~a23~0_484 5))) (not (<= (+ (div v_~a23~0_484 5) 553468) |old(~a23~0)|))))) (or .cse21 .cse6 .cse10 .cse14 .cse11) (or (or .cse18 (or .cse0 .cse1 .cse13 .cse20 .cse7 .cse15)) (and (and .cse32 .cse34 .cse35) .cse33)) (or .cse10 .cse7 .cse6 .cse0 .cse1 .cse11 .cse8) (or .cse0 .cse1 .cse6 .cse29 .cse4) (or .cse42 (not (<= |old(~a25~0)| 9)) .cse41) (or (or .cse9 .cse27) .cse36 .cse0 .cse1 .cse37 .cse38 .cse41) (or .cse40 .cse13 .cse7 .cse0 .cse1 .cse5 .cse6) (or .cse31 .cse13 .cse7 .cse0 .cse1 .cse6 .cse25))))) [2019-09-07 18:24:28,469 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,469 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-09-07 18:24:28,469 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-09-07 18:24:28,469 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-09-07 18:24:28,469 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,469 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,469 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,469 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,469 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,469 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,470 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-09-07 18:24:28,470 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-09-07 18:24:28,470 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-09-07 18:24:28,470 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,470 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,470 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,470 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,470 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,470 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,470 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,470 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,470 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-09-07 18:24:28,470 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-09-07 18:24:28,470 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-09-07 18:24:28,470 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,470 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,471 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,471 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,471 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,471 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,471 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,471 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,471 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,471 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,471 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,471 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-09-07 18:24:28,471 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-09-07 18:24:28,471 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-09-07 18:24:28,471 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-09-07 18:24:28,471 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-09-07 18:24:28,471 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,471 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,472 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,472 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,472 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,472 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,472 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,472 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-09-07 18:24:28,472 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-09-07 18:24:28,472 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-09-07 18:24:28,472 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,472 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-09-07 18:24:28,473 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,473 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,473 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-09-07 18:24:28,473 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-09-07 18:24:28,473 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,473 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,473 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,473 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,473 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,474 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-09-07 18:24:28,474 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-09-07 18:24:28,474 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,474 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,474 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-09-07 18:24:28,474 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-09-07 18:24:28,474 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,474 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,474 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,475 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,475 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,475 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,475 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-09-07 18:24:28,475 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-09-07 18:24:28,475 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-09-07 18:24:28,475 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-09-07 18:24:28,475 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,475 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,476 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,476 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,476 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,476 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,476 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,476 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,476 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-09-07 18:24:28,476 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-09-07 18:24:28,476 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-09-07 18:24:28,477 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-09-07 18:24:28,477 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-09-07 18:24:28,477 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-09-07 18:24:28,477 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,477 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,477 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,477 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,477 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,477 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,478 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,478 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-09-07 18:24:28,478 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-09-07 18:24:28,478 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,478 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,478 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,478 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,478 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,478 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,478 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,479 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-09-07 18:24:28,479 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-09-07 18:24:28,479 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,479 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,479 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,479 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,479 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,479 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,479 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,479 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-09-07 18:24:28,480 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,480 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,480 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,480 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-09-07 18:24:28,480 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-09-07 18:24:28,480 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-09-07 18:24:28,480 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,480 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-09-07 18:24:28,480 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,480 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-09-07 18:24:28,481 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,481 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,481 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,481 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,481 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,481 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,481 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-09-07 18:24:28,481 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-09-07 18:24:28,481 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-09-07 18:24:28,481 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,482 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,482 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,482 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,482 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,482 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,482 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,482 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,482 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,482 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,482 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-09-07 18:24:28,483 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-09-07 18:24:28,483 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-09-07 18:24:28,483 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,483 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-09-07 18:24:28,483 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-09-07 18:24:28,483 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,483 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,483 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,483 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,483 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,484 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,484 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-09-07 18:24:28,484 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-09-07 18:24:28,484 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-09-07 18:24:28,484 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,484 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,484 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,484 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,485 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-09-07 18:24:28,485 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-09-07 18:24:28,485 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,485 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,485 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-09-07 18:24:28,485 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,485 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,485 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:24:28,485 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 18:24:28,486 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:24:28,486 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 18:24:28,486 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 18:24:28,486 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1028 1044) the Hoare annotation is: (or (not (= 10 |old(~a25~0)|)) (not (<= 130 |old(~a29~0)|)) (and (= ~a23~0 |old(~a23~0)|) (<= 130 ~a29~0) (<= ~a29~0 130) (= ~a4~0 |old(~a4~0)|) (= ~a25~0 |old(~a25~0)|)) (not (<= |old(~a23~0)| 312)) (not (= 15 ~a8~0)) (not (= 1 ~a3~0)) (not (<= 312 |old(~a23~0)|)) (not (= 1 |old(~a4~0)|)) (not (<= |old(~a29~0)| 130))) [2019-09-07 18:24:28,486 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1028 1044) no Hoare annotation was computed. [2019-09-07 18:24:28,487 INFO L439 ceAbstractionStarter]: At program point L1042(line 1042) the Hoare annotation is: (let ((.cse4 (= ~a25~0 12)) (.cse29 (= 1 ~a3~0)) (.cse11 (< 138 ~a23~0)) (.cse32 (div (+ ~a23~0 577632) 5)) (.cse10 (= 1 ~a4~0)) (.cse30 (+ ~a23~0 43)) (.cse31 (<= 307 |old(~a23~0)|)) (.cse28 (= ~a25~0 13)) (.cse3 (<= ~a23~0 137))) (let ((.cse14 (<= 0 (+ ~a23~0 599992))) (.cse24 (<= 255 ~a29~0)) (.cse20 (<= ~a29~0 275)) (.cse8 (<= ~a23~0 312)) (.cse15 (and .cse31 (not .cse28) .cse3)) (.cse0 (= ~a25~0 10)) (.cse2 (< 0 .cse30)) (.cse6 (not .cse10)) (.cse26 (<= .cse32 138)) (.cse27 (= 0 (mod (+ ~a23~0 2) 5))) (.cse5 (<= ~a29~0 130)) (.cse7 (<= 0 (+ .cse32 42))) (.cse1 (<= ~a29~0 140)) (.cse19 (<= 246 ~a29~0)) (.cse25 (and (and .cse31 .cse4 .cse29 .cse11) .cse10)) (.cse22 (<= .cse30 0)) (.cse9 (= ~a25~0 9)) (.cse18 (<= ~a23~0 138)) (.cse23 (= ~a25~0 11)) (.cse16 (<= 312 ~a23~0)) (.cse13 (< 140 ~a29~0)) (.cse12 (<= ~a29~0 244))) (or (and .cse0 .cse1 .cse2 .cse3) (and (and .cse4 .cse5 .cse6) .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse1) (and .cse12 (and .cse6 .cse4 .cse13 .cse14)) (not (<= 130 |old(~a29~0)|)) (not (<= 312 |old(~a23~0)|)) (and (<= ~a25~0 9) .cse15 .cse10) (not (= 10 |old(~a25~0)|)) (and .cse4 .cse5 .cse3 .cse10) (and .cse4 .cse5 (exists ((v_~a23~0_BEFORE_CALL_12 Int) (v_~a23~0_484 Int)) (and (<= 0 (+ (div (+ v_~a23~0_BEFORE_CALL_12 577632) 5) 42)) (= 0 (mod v_~a23~0_484 5)) (<= (+ v_~a23~0_484 43) 0) (<= v_~a23~0_BEFORE_CALL_12 v_~a23~0_484) (<= (+ (div v_~a23~0_484 5) 553468) ~a23~0)))) (not (<= |old(~a29~0)| 130)) (and (and .cse4 .cse16) .cse13 .cse12) (and .cse0 .cse10) (and .cse13 .cse12 (exists ((|v_old(~a23~0)_AFTER_CALL_70| Int)) (let ((.cse17 (div (+ |v_old(~a23~0)_AFTER_CALL_70| 577632) 5))) (and (<= .cse17 138) (<= (+ (div |v_old(~a23~0)_AFTER_CALL_70| 5) 371131) ~a23~0) (< 0 (+ .cse17 43)) (= 0 (mod (+ |v_old(~a23~0)_AFTER_CALL_70| 2) 5))))) (and .cse9 .cse10)) (and .cse9 .cse18 .cse6 .cse14 .cse5) (and (and .cse4 .cse3 .cse6) .cse2) (not (= 1 |old(~a4~0)|)) (and .cse9 .cse5 .cse10 .cse11) (and (and .cse6 .cse4 .cse19 .cse14) .cse20) (and .cse9 (exists ((v_~a29~0_513 Int)) (let ((.cse21 (mod v_~a29~0_513 299861))) (and (< 140 v_~a29~0_513) (= 0 .cse21) (<= (+ .cse21 10250) ~a29~0)))) .cse22) (and (and .cse10 .cse23) .cse19) (and .cse9 .cse24 .cse10) (and (and (<= (+ ~a23~0 246) 0) .cse4 .cse24) .cse20) (and .cse8 .cse25) (and (and .cse23 (exists ((v_prenex_3 Int)) (and (<= (+ (mod v_prenex_3 15) 260) ~a29~0) (<= 0 v_prenex_3) (<= 130 v_prenex_3)))) .cse26 .cse27 .cse7) (and .cse9 .cse1 .cse2 .cse3) (and .cse8 (and .cse23 .cse10) .cse11) (and .cse1 .cse15 .cse10 .cse23) (and .cse5 .cse0) (and .cse2 (and .cse28 .cse6 .cse3)) (and (and .cse28 .cse11) .cse10) (and .cse9 .cse10 .cse11 .cse19) (and .cse26 .cse27 .cse4 .cse7) (or (and .cse5 .cse23 .cse22) (and (<= (+ ~a23~0 119992) 0) .cse7 .cse23 .cse1)) (not (<= |old(~a23~0)| 312)) (not .cse29) (and .cse19 .cse25) (and .cse10 .cse22) (and .cse9 .cse18 .cse10 .cse13 .cse12) (not (= 15 ~a8~0)) (and (and .cse10 .cse23 .cse16) .cse13 .cse12)))) [2019-09-07 18:24:28,487 INFO L443 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2019-09-07 18:24:28,487 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-09-07 18:24:28,488 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse4 (= ~a25~0 12)) (.cse29 (= 1 ~a3~0)) (.cse11 (< 138 ~a23~0)) (.cse32 (div (+ ~a23~0 577632) 5)) (.cse10 (= 1 ~a4~0)) (.cse30 (+ ~a23~0 43)) (.cse31 (<= 307 |old(~a23~0)|)) (.cse28 (= ~a25~0 13)) (.cse3 (<= ~a23~0 137))) (let ((.cse14 (<= 0 (+ ~a23~0 599992))) (.cse24 (<= 255 ~a29~0)) (.cse20 (<= ~a29~0 275)) (.cse8 (<= ~a23~0 312)) (.cse15 (and .cse31 (not .cse28) .cse3)) (.cse0 (= ~a25~0 10)) (.cse2 (< 0 .cse30)) (.cse6 (not .cse10)) (.cse26 (<= .cse32 138)) (.cse27 (= 0 (mod (+ ~a23~0 2) 5))) (.cse5 (<= ~a29~0 130)) (.cse7 (<= 0 (+ .cse32 42))) (.cse1 (<= ~a29~0 140)) (.cse19 (<= 246 ~a29~0)) (.cse25 (and (and .cse31 .cse4 .cse29 .cse11) .cse10)) (.cse22 (<= .cse30 0)) (.cse9 (= ~a25~0 9)) (.cse18 (<= ~a23~0 138)) (.cse23 (= ~a25~0 11)) (.cse16 (<= 312 ~a23~0)) (.cse13 (< 140 ~a29~0)) (.cse12 (<= ~a29~0 244))) (or (and .cse0 .cse1 .cse2 .cse3) (and (and .cse4 .cse5 .cse6) .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse1) (and .cse12 (and .cse6 .cse4 .cse13 .cse14)) (not (<= 130 |old(~a29~0)|)) (not (<= 312 |old(~a23~0)|)) (and (<= ~a25~0 9) .cse15 .cse10) (not (= 10 |old(~a25~0)|)) (and .cse4 .cse5 .cse3 .cse10) (and .cse4 .cse5 (exists ((v_~a23~0_BEFORE_CALL_12 Int) (v_~a23~0_484 Int)) (and (<= 0 (+ (div (+ v_~a23~0_BEFORE_CALL_12 577632) 5) 42)) (= 0 (mod v_~a23~0_484 5)) (<= (+ v_~a23~0_484 43) 0) (<= v_~a23~0_BEFORE_CALL_12 v_~a23~0_484) (<= (+ (div v_~a23~0_484 5) 553468) ~a23~0)))) (not (<= |old(~a29~0)| 130)) (and (and .cse4 .cse16) .cse13 .cse12) (and .cse0 .cse10) (and .cse13 .cse12 (exists ((|v_old(~a23~0)_AFTER_CALL_70| Int)) (let ((.cse17 (div (+ |v_old(~a23~0)_AFTER_CALL_70| 577632) 5))) (and (<= .cse17 138) (<= (+ (div |v_old(~a23~0)_AFTER_CALL_70| 5) 371131) ~a23~0) (< 0 (+ .cse17 43)) (= 0 (mod (+ |v_old(~a23~0)_AFTER_CALL_70| 2) 5))))) (and .cse9 .cse10)) (and .cse9 .cse18 .cse6 .cse14 .cse5) (and (and .cse4 .cse3 .cse6) .cse2) (not (= 1 |old(~a4~0)|)) (and .cse9 .cse5 .cse10 .cse11) (and (and .cse6 .cse4 .cse19 .cse14) .cse20) (and .cse9 (exists ((v_~a29~0_513 Int)) (let ((.cse21 (mod v_~a29~0_513 299861))) (and (< 140 v_~a29~0_513) (= 0 .cse21) (<= (+ .cse21 10250) ~a29~0)))) .cse22) (and (and .cse10 .cse23) .cse19) (and .cse9 .cse24 .cse10) (and (and (<= (+ ~a23~0 246) 0) .cse4 .cse24) .cse20) (and .cse8 .cse25) (and (and .cse23 (exists ((v_prenex_3 Int)) (and (<= (+ (mod v_prenex_3 15) 260) ~a29~0) (<= 0 v_prenex_3) (<= 130 v_prenex_3)))) .cse26 .cse27 .cse7) (and .cse9 .cse1 .cse2 .cse3) (and .cse8 (and .cse23 .cse10) .cse11) (and .cse1 .cse15 .cse10 .cse23) (and .cse5 .cse0) (and .cse2 (and .cse28 .cse6 .cse3)) (and (and .cse28 .cse11) .cse10) (and .cse9 .cse10 .cse11 .cse19) (and .cse26 .cse27 .cse4 .cse7) (or (and .cse5 .cse23 .cse22) (and (<= (+ ~a23~0 119992) 0) .cse7 .cse23 .cse1)) (not (<= |old(~a23~0)| 312)) (not .cse29) (and .cse19 .cse25) (and .cse10 .cse22) (and .cse9 .cse18 .cse10 .cse13 .cse12) (not (= 15 ~a8~0)) (and (and .cse10 .cse23 .cse16) .cse13 .cse12)))) [2019-09-07 18:24:28,488 INFO L443 ceAbstractionStarter]: For program point L1034-3(lines 1028 1044) no Hoare annotation was computed. [2019-09-07 18:24:28,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_BEFORE_CALL_12,QUANTIFIED] [2019-09-07 18:24:28,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] [2019-09-07 18:24:28,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] [2019-09-07 18:24:28,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_BEFORE_CALL_12,QUANTIFIED] [2019-09-07 18:24:28,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] [2019-09-07 18:24:28,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] [2019-09-07 18:24:28,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] [2019-09-07 18:24:28,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] [2019-09-07 18:24:28,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] [2019-09-07 18:24:28,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] [2019-09-07 18:24:28,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] [2019-09-07 18:24:28,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] [2019-09-07 18:24:28,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] [2019-09-07 18:24:28,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-09-07 18:24:28,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-09-07 18:24:28,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-09-07 18:24:28,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_BEFORE_CALL_12,QUANTIFIED] [2019-09-07 18:24:28,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] [2019-09-07 18:24:28,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] [2019-09-07 18:24:28,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_BEFORE_CALL_12,QUANTIFIED] [2019-09-07 18:24:28,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] [2019-09-07 18:24:28,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] [2019-09-07 18:24:28,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] [2019-09-07 18:24:28,528 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] [2019-09-07 18:24:28,531 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] [2019-09-07 18:24:28,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] [2019-09-07 18:24:28,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] [2019-09-07 18:24:28,532 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] [2019-09-07 18:24:28,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] [2019-09-07 18:24:28,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-09-07 18:24:28,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-09-07 18:24:28,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-09-07 18:24:28,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 06:24:28 BoogieIcfgContainer [2019-09-07 18:24:28,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 18:24:28,540 INFO L168 Benchmark]: Toolchain (without parser) took 320503.19 ms. Allocated memory was 132.1 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 84.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-09-07 18:24:28,541 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 132.1 MB. Free memory was 105.3 MB in the beginning and 105.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 18:24:28,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1057.86 ms. Allocated memory was 132.1 MB in the beginning and 217.1 MB in the end (delta: 84.9 MB). Free memory was 83.9 MB in the beginning and 176.3 MB in the end (delta: -92.4 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. [2019-09-07 18:24:28,542 INFO L168 Benchmark]: Boogie Preprocessor took 168.25 ms. Allocated memory is still 217.1 MB. Free memory was 176.3 MB in the beginning and 168.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:24:28,543 INFO L168 Benchmark]: RCFGBuilder took 1887.03 ms. Allocated memory was 217.1 MB in the beginning and 280.5 MB in the end (delta: 63.4 MB). Free memory was 168.4 MB in the beginning and 178.9 MB in the end (delta: -10.5 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. [2019-09-07 18:24:28,543 INFO L168 Benchmark]: TraceAbstraction took 317385.67 ms. Allocated memory was 280.5 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 178.9 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-09-07 18:24:28,547 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.23 ms. Allocated memory is still 132.1 MB. Free memory was 105.3 MB in the beginning and 105.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1057.86 ms. Allocated memory was 132.1 MB in the beginning and 217.1 MB in the end (delta: 84.9 MB). Free memory was 83.9 MB in the beginning and 176.3 MB in the end (delta: -92.4 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 168.25 ms. Allocated memory is still 217.1 MB. Free memory was 176.3 MB in the beginning and 168.4 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1887.03 ms. Allocated memory was 217.1 MB in the beginning and 280.5 MB in the end (delta: 63.4 MB). Free memory was 168.4 MB in the beginning and 178.9 MB in the end (delta: -10.5 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 317385.67 ms. Allocated memory was 280.5 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 178.9 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). 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_~a23~0_BEFORE_CALL_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_BEFORE_CALL_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_BEFORE_CALL_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_BEFORE_CALL_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 150]: 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:24:28,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_BEFORE_CALL_12,QUANTIFIED] [2019-09-07 18:24:28,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] [2019-09-07 18:24:28,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] [2019-09-07 18:24:28,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_BEFORE_CALL_12,QUANTIFIED] [2019-09-07 18:24:28,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] [2019-09-07 18:24:28,569 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] [2019-09-07 18:24:28,569 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] [2019-09-07 18:24:28,569 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] [2019-09-07 18:24:28,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] [2019-09-07 18:24:28,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] [2019-09-07 18:24:28,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] [2019-09-07 18:24:28,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] [2019-09-07 18:24:28,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] [2019-09-07 18:24:28,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-09-07 18:24:28,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-09-07 18:24:28,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-09-07 18:24:28,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_BEFORE_CALL_12,QUANTIFIED] [2019-09-07 18:24:28,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] [2019-09-07 18:24:28,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] [2019-09-07 18:24:28,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_BEFORE_CALL_12,QUANTIFIED] [2019-09-07 18:24:28,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] [2019-09-07 18:24:28,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_484,QUANTIFIED] [2019-09-07 18:24:28,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] [2019-09-07 18:24:28,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] [2019-09-07 18:24:28,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] [2019-09-07 18:24:28,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_old_~a23~0__AFTER_CALL_70,QUANTIFIED] [2019-09-07 18:24:28,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] [2019-09-07 18:24:28,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] [2019-09-07 18:24:28,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_513,QUANTIFIED] [2019-09-07 18:24:28,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-09-07 18:24:28,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] [2019-09-07 18:24:28,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_3,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((a25 == 10 && a29 <= 140) && 0 < a23 + 43) && a23 <= 137) || (((a25 == 12 && a29 <= 130) && !(1 == a4)) && 0 <= (a23 + 577632) / 5 + 42)) || ((((a23 <= 312 && a25 == 9) && 1 == a4) && 138 < a23) && a29 <= 140)) || (a29 <= 244 && ((!(1 == a4) && a25 == 12) && 140 < a29) && 0 <= a23 + 599992)) || !(130 <= \old(a29))) || !(312 <= \old(a23))) || ((a25 <= 9 && (307 <= \old(a23) && !(a25 == 13)) && a23 <= 137) && 1 == a4)) || !(10 == \old(a25))) || (((a25 == 12 && a29 <= 130) && a23 <= 137) && 1 == a4)) || ((a25 == 12 && a29 <= 130) && (\exists v_~a23~0_BEFORE_CALL_12 : int, v_~a23~0_484 : int :: (((0 <= (v_~a23~0_BEFORE_CALL_12 + 577632) / 5 + 42 && 0 == v_~a23~0_484 % 5) && v_~a23~0_484 + 43 <= 0) && v_~a23~0_BEFORE_CALL_12 <= v_~a23~0_484) && v_~a23~0_484 / 5 + 553468 <= a23))) || !(\old(a29) <= 130)) || (((a25 == 12 && 312 <= a23) && 140 < a29) && a29 <= 244)) || (a25 == 10 && 1 == a4)) || (((140 < a29 && a29 <= 244) && (\exists v_\old(~a23~0)_AFTER_CALL_70 : int :: (((v_\old_~a23~0__AFTER_CALL_70 + 577632) / 5 <= 138 && v_\old_~a23~0__AFTER_CALL_70 / 5 + 371131 <= a23) && 0 < (v_\old_~a23~0__AFTER_CALL_70 + 577632) / 5 + 43) && 0 == (v_\old_~a23~0__AFTER_CALL_70 + 2) % 5)) && a25 == 9 && 1 == a4)) || ((((a25 == 9 && a23 <= 138) && !(1 == a4)) && 0 <= a23 + 599992) && a29 <= 130)) || (((a25 == 12 && a23 <= 137) && !(1 == a4)) && 0 < a23 + 43)) || !(1 == \old(a4))) || (((a25 == 9 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((((!(1 == a4) && a25 == 12) && 246 <= a29) && 0 <= a23 + 599992) && a29 <= 275)) || ((a25 == 9 && (\exists v_~a29~0_513 : int :: (140 < v_~a29~0_513 && 0 == v_~a29~0_513 % 299861) && v_~a29~0_513 % 299861 + 10250 <= a29)) && a23 + 43 <= 0)) || ((1 == a4 && a25 == 11) && 246 <= a29)) || ((a25 == 9 && 255 <= a29) && 1 == a4)) || (((a23 + 246 <= 0 && a25 == 12) && 255 <= a29) && a29 <= 275)) || (a23 <= 312 && (((307 <= \old(a23) && a25 == 12) && 1 == a3) && 138 < a23) && 1 == a4)) || ((((a25 == 11 && (\exists v_prenex_3 : int :: (v_prenex_3 % 15 + 260 <= a29 && 0 <= v_prenex_3) && 130 <= v_prenex_3)) && (a23 + 577632) / 5 <= 138) && 0 == (a23 + 2) % 5) && 0 <= (a23 + 577632) / 5 + 42)) || (((a25 == 9 && a29 <= 140) && 0 < a23 + 43) && a23 <= 137)) || ((a23 <= 312 && a25 == 11 && 1 == a4) && 138 < a23)) || (((a29 <= 140 && (307 <= \old(a23) && !(a25 == 13)) && a23 <= 137) && 1 == a4) && a25 == 11)) || (a29 <= 130 && a25 == 10)) || (0 < a23 + 43 && (a25 == 13 && !(1 == a4)) && a23 <= 137)) || ((a25 == 13 && 138 < a23) && 1 == a4)) || (((a25 == 9 && 1 == a4) && 138 < a23) && 246 <= a29)) || ((((a23 + 577632) / 5 <= 138 && 0 == (a23 + 2) % 5) && a25 == 12) && 0 <= (a23 + 577632) / 5 + 42)) || ((a29 <= 130 && a25 == 11) && a23 + 43 <= 0) || (((a23 + 119992 <= 0 && 0 <= (a23 + 577632) / 5 + 42) && a25 == 11) && a29 <= 140)) || !(\old(a23) <= 312)) || !(1 == a3)) || (246 <= a29 && (((307 <= \old(a23) && a25 == 12) && 1 == a3) && 138 < a23) && 1 == a4)) || (1 == a4 && a23 + 43 <= 0)) || ((((a25 == 9 && a23 <= 138) && 1 == a4) && 140 < a29) && a29 <= 244)) || !(15 == a8)) || ((((1 == a4 && a25 == 11) && 312 <= a23) && 140 < a29) && a29 <= 244) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 292 locations, 1 error locations. SAFE Result, 317.2s OverallTime, 18 OverallIterations, 10 TraceHistogramMax, 186.1s AutomataDifference, 0.0s DeadEndRemovalTime, 94.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1666 SDtfs, 36401 SDslu, 4768 SDs, 0 SdLazy, 68439 SolverSat, 14268 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 138.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7965 GetRequests, 7314 SyntacticMatches, 7 SemanticMatches, 644 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12389 ImplicationChecksByTransitivity, 34.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57715occurred 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: 7.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 40803 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 2375 PreInvPairs, 2937 NumberOfFragments, 2950 HoareAnnotationTreeSize, 2375 FomulaSimplifications, 5936241 FormulaSimplificationTreeSizeReduction, 20.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 578211 FormulaSimplificationTreeSizeReductionInter, 74.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 14661 NumberOfCodeBlocks, 14661 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 14629 ConstructedInterpolants, 111 QuantifiedInterpolants, 27292498 SizeOfPredicates, 14 NumberOfNonLiveVariables, 11120 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 32 InterpolantComputations, 5 PerfectInterpolantSequences, 23841/26907 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...