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_label54.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 18:31:45,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 18:31:45,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 18:31:45,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 18:31:45,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 18:31:45,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 18:31:45,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 18:31:45,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 18:31:45,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 18:31:45,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 18:31:45,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 18:31:46,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 18:31:46,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 18:31:46,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 18:31:46,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 18:31:46,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 18:31:46,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 18:31:46,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 18:31:46,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 18:31:46,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 18:31:46,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 18:31:46,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 18:31:46,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 18:31:46,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 18:31:46,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 18:31:46,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 18:31:46,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 18:31:46,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 18:31:46,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 18:31:46,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 18:31:46,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 18:31:46,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 18:31:46,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 18:31:46,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 18:31:46,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 18:31:46,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 18:31:46,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 18:31:46,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 18:31:46,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 18:31:46,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 18:31:46,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 18:31:46,024 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:31:46,048 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 18:31:46,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 18:31:46,049 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 18:31:46,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 18:31:46,050 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 18:31:46,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 18:31:46,050 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 18:31:46,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 18:31:46,051 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 18:31:46,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 18:31:46,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 18:31:46,051 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 18:31:46,051 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 18:31:46,052 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 18:31:46,052 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 18:31:46,052 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 18:31:46,052 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 18:31:46,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 18:31:46,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 18:31:46,053 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 18:31:46,053 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 18:31:46,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 18:31:46,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 18:31:46,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 18:31:46,054 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 18:31:46,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 18:31:46,054 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 18:31:46,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 18:31:46,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 18:31:46,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 18:31:46,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 18:31:46,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 18:31:46,102 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 18:31:46,102 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 18:31:46,103 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label54.c [2019-09-07 18:31:46,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c269364/0150615553e7407b9160a5628288bb97/FLAG811e416f5 [2019-09-07 18:31:46,788 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 18:31:46,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label54.c [2019-09-07 18:31:46,812 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c269364/0150615553e7407b9160a5628288bb97/FLAG811e416f5 [2019-09-07 18:31:46,987 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c269364/0150615553e7407b9160a5628288bb97 [2019-09-07 18:31:46,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 18:31:47,000 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 18:31:47,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 18:31:47,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 18:31:47,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 18:31:47,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:31:46" (1/1) ... [2019-09-07 18:31:47,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc6461a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:31:47, skipping insertion in model container [2019-09-07 18:31:47,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:31:46" (1/1) ... [2019-09-07 18:31:47,017 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 18:31:47,072 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 18:31:47,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:31:47,716 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 18:31:47,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:31:47,935 INFO L192 MainTranslator]: Completed translation [2019-09-07 18:31:47,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:31:47 WrapperNode [2019-09-07 18:31:47,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 18:31:47,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 18:31:47,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 18:31:47,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 18:31:47,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:31:47" (1/1) ... [2019-09-07 18:31:47,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:31:47" (1/1) ... [2019-09-07 18:31:47,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:31:47" (1/1) ... [2019-09-07 18:31:47,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:31:47" (1/1) ... [2019-09-07 18:31:48,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:31:47" (1/1) ... [2019-09-07 18:31:48,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:31:47" (1/1) ... [2019-09-07 18:31:48,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:31:47" (1/1) ... [2019-09-07 18:31:48,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 18:31:48,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 18:31:48,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 18:31:48,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 18:31:48,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:31:47" (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:31:48,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 18:31:48,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 18:31:48,162 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 18:31:48,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 18:31:48,163 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 18:31:48,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 18:31:48,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 18:31:48,164 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 18:31:48,164 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 18:31:48,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 18:31:48,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 18:31:50,013 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 18:31:50,013 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 18:31:50,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:31:50 BoogieIcfgContainer [2019-09-07 18:31:50,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 18:31:50,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 18:31:50,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 18:31:50,019 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 18:31:50,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 06:31:46" (1/3) ... [2019-09-07 18:31:50,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae8d0c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:31:50, skipping insertion in model container [2019-09-07 18:31:50,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:31:47" (2/3) ... [2019-09-07 18:31:50,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae8d0c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:31:50, skipping insertion in model container [2019-09-07 18:31:50,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:31:50" (3/3) ... [2019-09-07 18:31:50,024 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label54.c [2019-09-07 18:31:50,034 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 18:31:50,042 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 18:31:50,060 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 18:31:50,097 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 18:31:50,098 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 18:31:50,098 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 18:31:50,098 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 18:31:50,098 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 18:31:50,098 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 18:31:50,099 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 18:31:50,099 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 18:31:50,099 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 18:31:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-09-07 18:31:50,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 18:31:50,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:31:50,134 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] [2019-09-07 18:31:50,137 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:31:50,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:31:50,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1043442102, now seen corresponding path program 1 times [2019-09-07 18:31:50,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:31:50,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:31:50,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:31:50,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:31:50,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:31:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:31:50,454 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:31:50,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:31:50,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:31:50,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:31:50,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:31:50,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:31:50,482 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 4 states. [2019-09-07 18:31:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:31:52,697 INFO L93 Difference]: Finished difference Result 994 states and 1776 transitions. [2019-09-07 18:31:52,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:31:52,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-09-07 18:31:52,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:31:52,726 INFO L225 Difference]: With dead ends: 994 [2019-09-07 18:31:52,726 INFO L226 Difference]: Without dead ends: 620 [2019-09-07 18:31:52,736 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:31:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-07 18:31:52,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 614. [2019-09-07 18:31:52,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-07 18:31:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 908 transitions. [2019-09-07 18:31:52,835 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 908 transitions. Word has length 43 [2019-09-07 18:31:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:31:52,835 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 908 transitions. [2019-09-07 18:31:52,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:31:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 908 transitions. [2019-09-07 18:31:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-07 18:31:52,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:31:52,845 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:52,845 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:31:52,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:31:52,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2051275321, now seen corresponding path program 1 times [2019-09-07 18:31:52,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:31:52,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:31:52,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:31:52,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:31:52,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:31:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:31:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:31:53,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:31:53,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:31:53,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:31:53,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:31:53,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:31:53,176 INFO L87 Difference]: Start difference. First operand 614 states and 908 transitions. Second operand 4 states. [2019-09-07 18:31:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:31:55,148 INFO L93 Difference]: Finished difference Result 2367 states and 3579 transitions. [2019-09-07 18:31:55,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:31:55,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-07 18:31:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:31:55,162 INFO L225 Difference]: With dead ends: 2367 [2019-09-07 18:31:55,162 INFO L226 Difference]: Without dead ends: 1759 [2019-09-07 18:31:55,165 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:31:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2019-09-07 18:31:55,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1183. [2019-09-07 18:31:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-09-07 18:31:55,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1681 transitions. [2019-09-07 18:31:55,240 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1681 transitions. Word has length 116 [2019-09-07 18:31:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:31:55,244 INFO L475 AbstractCegarLoop]: Abstraction has 1183 states and 1681 transitions. [2019-09-07 18:31:55,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:31:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1681 transitions. [2019-09-07 18:31:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-07 18:31:55,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:31:55,257 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:55,257 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:31:55,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:31:55,258 INFO L82 PathProgramCache]: Analyzing trace with hash -442913762, now seen corresponding path program 1 times [2019-09-07 18:31:55,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:31:55,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:31:55,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:31:55,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:31:55,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:31:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:31:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:31:55,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:31:55,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 18:31:55,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:31:55,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:31:55,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:31:55,486 INFO L87 Difference]: Start difference. First operand 1183 states and 1681 transitions. Second operand 6 states. [2019-09-07 18:31:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:31:58,199 INFO L93 Difference]: Finished difference Result 3648 states and 5882 transitions. [2019-09-07 18:31:58,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 18:31:58,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-07 18:31:58,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:31:58,222 INFO L225 Difference]: With dead ends: 3648 [2019-09-07 18:31:58,222 INFO L226 Difference]: Without dead ends: 2471 [2019-09-07 18:31:58,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-07 18:31:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2019-09-07 18:31:58,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2397. [2019-09-07 18:31:58,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2397 states. [2019-09-07 18:31:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 3442 transitions. [2019-09-07 18:31:58,355 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 3442 transitions. Word has length 141 [2019-09-07 18:31:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:31:58,356 INFO L475 AbstractCegarLoop]: Abstraction has 2397 states and 3442 transitions. [2019-09-07 18:31:58,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:31:58,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 3442 transitions. [2019-09-07 18:31:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-07 18:31:58,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:31:58,372 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:31:58,372 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:31:58,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:31:58,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1861817831, now seen corresponding path program 1 times [2019-09-07 18:31:58,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:31:58,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:31:58,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:31:58,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:31:58,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:31:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:31:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 18:31:58,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:31:58,632 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:31:58,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:31:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:31:58,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 18:31:58,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:31:58,858 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:31:58,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:31:58,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 18:31:58,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:31:58,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:31:58,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:31:58,878 INFO L87 Difference]: Start difference. First operand 2397 states and 3442 transitions. Second operand 9 states. [2019-09-07 18:32:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:32:01,386 INFO L93 Difference]: Finished difference Result 9035 states and 15182 transitions. [2019-09-07 18:32:01,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 18:32:01,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 204 [2019-09-07 18:32:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:32:01,445 INFO L225 Difference]: With dead ends: 9035 [2019-09-07 18:32:01,446 INFO L226 Difference]: Without dead ends: 6644 [2019-09-07 18:32:01,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:32:01,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6644 states. [2019-09-07 18:32:01,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6644 to 6536. [2019-09-07 18:32:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-09-07 18:32:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 9980 transitions. [2019-09-07 18:32:01,767 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 9980 transitions. Word has length 204 [2019-09-07 18:32:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:32:01,769 INFO L475 AbstractCegarLoop]: Abstraction has 6536 states and 9980 transitions. [2019-09-07 18:32:01,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:32:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 9980 transitions. [2019-09-07 18:32:01,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-07 18:32:01,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:32:01,782 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:32:01,782 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:32:01,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:32:01,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1031566485, now seen corresponding path program 1 times [2019-09-07 18:32:01,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:32:01,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:32:01,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:01,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:01,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 143 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:32:02,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:32:02,139 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:32:02,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:02,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 18:32:02,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:32:02,306 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 18:32:02,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:32:02,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 18:32:02,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 18:32:02,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 18:32:02,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 18:32:02,324 INFO L87 Difference]: Start difference. First operand 6536 states and 9980 transitions. Second operand 7 states. [2019-09-07 18:32:04,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:32:04,900 INFO L93 Difference]: Finished difference Result 14950 states and 24725 transitions. [2019-09-07 18:32:04,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 18:32:04,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 218 [2019-09-07 18:32:04,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:32:04,949 INFO L225 Difference]: With dead ends: 14950 [2019-09-07 18:32:04,949 INFO L226 Difference]: Without dead ends: 8027 [2019-09-07 18:32:04,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 18:32:04,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8027 states. [2019-09-07 18:32:05,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8027 to 7240. [2019-09-07 18:32:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7240 states. [2019-09-07 18:32:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7240 states to 7240 states and 8980 transitions. [2019-09-07 18:32:05,221 INFO L78 Accepts]: Start accepts. Automaton has 7240 states and 8980 transitions. Word has length 218 [2019-09-07 18:32:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:32:05,222 INFO L475 AbstractCegarLoop]: Abstraction has 7240 states and 8980 transitions. [2019-09-07 18:32:05,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 18:32:05,222 INFO L276 IsEmpty]: Start isEmpty. Operand 7240 states and 8980 transitions. [2019-09-07 18:32:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-07 18:32:05,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:32:05,230 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:32:05,230 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:32:05,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:32:05,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1349983275, now seen corresponding path program 1 times [2019-09-07 18:32:05,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:32:05,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:32:05,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:05,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:05,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:05,477 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-07 18:32:05,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:32:05,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:32:05,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:32:05,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:32:05,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:32:05,479 INFO L87 Difference]: Start difference. First operand 7240 states and 8980 transitions. Second operand 4 states. [2019-09-07 18:32:07,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:32:07,363 INFO L93 Difference]: Finished difference Result 16591 states and 20695 transitions. [2019-09-07 18:32:07,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:32:07,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 260 [2019-09-07 18:32:07,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:32:07,410 INFO L225 Difference]: With dead ends: 16591 [2019-09-07 18:32:07,410 INFO L226 Difference]: Without dead ends: 9545 [2019-09-07 18:32:07,437 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:32:07,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9545 states. [2019-09-07 18:32:07,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 8398. [2019-09-07 18:32:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8398 states. [2019-09-07 18:32:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8398 states to 8398 states and 10267 transitions. [2019-09-07 18:32:07,662 INFO L78 Accepts]: Start accepts. Automaton has 8398 states and 10267 transitions. Word has length 260 [2019-09-07 18:32:07,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:32:07,663 INFO L475 AbstractCegarLoop]: Abstraction has 8398 states and 10267 transitions. [2019-09-07 18:32:07,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:32:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 8398 states and 10267 transitions. [2019-09-07 18:32:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-07 18:32:07,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:32:07,671 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:32:07,671 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:32:07,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:32:07,672 INFO L82 PathProgramCache]: Analyzing trace with hash -706378899, now seen corresponding path program 1 times [2019-09-07 18:32:07,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:32:07,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:32:07,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:07,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:07,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-07 18:32:08,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:32:08,059 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:32:08,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:08,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:32:08,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:32:08,323 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:32:08,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:32:08,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 18:32:08,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 18:32:08,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 18:32:08,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-09-07 18:32:08,340 INFO L87 Difference]: Start difference. First operand 8398 states and 10267 transitions. Second operand 11 states. [2019-09-07 18:32:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:32:11,143 INFO L93 Difference]: Finished difference Result 20016 states and 24524 transitions. [2019-09-07 18:32:11,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 18:32:11,143 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 269 [2019-09-07 18:32:11,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:32:11,176 INFO L225 Difference]: With dead ends: 20016 [2019-09-07 18:32:11,176 INFO L226 Difference]: Without dead ends: 11812 [2019-09-07 18:32:11,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-09-07 18:32:11,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11812 states. [2019-09-07 18:32:11,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11812 to 11244. [2019-09-07 18:32:11,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11244 states. [2019-09-07 18:32:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11244 states to 11244 states and 13679 transitions. [2019-09-07 18:32:11,410 INFO L78 Accepts]: Start accepts. Automaton has 11244 states and 13679 transitions. Word has length 269 [2019-09-07 18:32:11,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:32:11,411 INFO L475 AbstractCegarLoop]: Abstraction has 11244 states and 13679 transitions. [2019-09-07 18:32:11,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 18:32:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 11244 states and 13679 transitions. [2019-09-07 18:32:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-07 18:32:11,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:32:11,422 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:32:11,422 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:32:11,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:32:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1198955447, now seen corresponding path program 1 times [2019-09-07 18:32:11,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:32:11,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:32:11,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:11,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:11,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-07 18:32:11,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:32:11,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:32:11,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:32:11,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:32:11,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:32:11,669 INFO L87 Difference]: Start difference. First operand 11244 states and 13679 transitions. Second operand 4 states. [2019-09-07 18:32:13,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:32:13,156 INFO L93 Difference]: Finished difference Result 26850 states and 32906 transitions. [2019-09-07 18:32:13,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:32:13,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2019-09-07 18:32:13,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:32:13,207 INFO L225 Difference]: With dead ends: 26850 [2019-09-07 18:32:13,207 INFO L226 Difference]: Without dead ends: 15800 [2019-09-07 18:32:13,231 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:32:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15800 states. [2019-09-07 18:32:13,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15800 to 15231. [2019-09-07 18:32:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15231 states. [2019-09-07 18:32:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15231 states to 15231 states and 18705 transitions. [2019-09-07 18:32:13,607 INFO L78 Accepts]: Start accepts. Automaton has 15231 states and 18705 transitions. Word has length 283 [2019-09-07 18:32:13,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:32:13,607 INFO L475 AbstractCegarLoop]: Abstraction has 15231 states and 18705 transitions. [2019-09-07 18:32:13,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:32:13,608 INFO L276 IsEmpty]: Start isEmpty. Operand 15231 states and 18705 transitions. [2019-09-07 18:32:13,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-07 18:32:13,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:32:13,636 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:32:13,637 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:32:13,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:32:13,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1229796476, now seen corresponding path program 1 times [2019-09-07 18:32:13,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:32:13,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:32:13,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:13,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:13,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 7 proven. 68 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-07 18:32:14,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:32:14,018 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:32:14,036 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:32:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:14,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 18:32:14,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:32:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 9 proven. 66 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:32:14,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:32:14,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-09-07 18:32:14,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 18:32:14,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 18:32:14,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 18:32:14,372 INFO L87 Difference]: Start difference. First operand 15231 states and 18705 transitions. Second operand 8 states. [2019-09-07 18:32:17,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:32:17,772 INFO L93 Difference]: Finished difference Result 37925 states and 47900 transitions. [2019-09-07 18:32:17,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 18:32:17,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 334 [2019-09-07 18:32:17,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:32:17,844 INFO L225 Difference]: With dead ends: 37925 [2019-09-07 18:32:17,845 INFO L226 Difference]: Without dead ends: 22698 [2019-09-07 18:32:17,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-09-07 18:32:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22698 states. [2019-09-07 18:32:18,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22698 to 20817. [2019-09-07 18:32:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20817 states. [2019-09-07 18:32:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20817 states to 20817 states and 25651 transitions. [2019-09-07 18:32:18,296 INFO L78 Accepts]: Start accepts. Automaton has 20817 states and 25651 transitions. Word has length 334 [2019-09-07 18:32:18,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:32:18,297 INFO L475 AbstractCegarLoop]: Abstraction has 20817 states and 25651 transitions. [2019-09-07 18:32:18,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 18:32:18,298 INFO L276 IsEmpty]: Start isEmpty. Operand 20817 states and 25651 transitions. [2019-09-07 18:32:18,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-09-07 18:32:18,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:32:18,340 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:32:18,340 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:32:18,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:32:18,341 INFO L82 PathProgramCache]: Analyzing trace with hash -265750592, now seen corresponding path program 1 times [2019-09-07 18:32:18,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:32:18,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:32:18,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:18,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:18,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:32:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:18,668 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 301 proven. 35 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-07 18:32:18,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:32:18,669 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:32:18,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:32:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:32:18,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 18:32:18,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:32:18,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:18,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:32:21,443 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-09-07 18:32:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 4 proven. 332 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-07 18:32:21,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:32:21,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2019-09-07 18:32:21,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 18:32:21,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 18:32:21,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2019-09-07 18:32:21,617 INFO L87 Difference]: Start difference. First operand 20817 states and 25651 transitions. Second operand 11 states. [2019-09-07 18:32:22,501 WARN L188 SmtUtils]: Spent 870.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-09-07 18:33:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:33:01,055 INFO L93 Difference]: Finished difference Result 49959 states and 62861 transitions. [2019-09-07 18:33:01,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 18:33:01,056 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 412 [2019-09-07 18:33:01,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:33:01,168 INFO L225 Difference]: With dead ends: 49959 [2019-09-07 18:33:01,169 INFO L226 Difference]: Without dead ends: 30684 [2019-09-07 18:33:01,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 423 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=157, Invalid=490, Unknown=3, NotChecked=0, Total=650 [2019-09-07 18:33:01,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30684 states. [2019-09-07 18:33:01,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30684 to 28582. [2019-09-07 18:33:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28582 states. [2019-09-07 18:33:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28582 states to 28582 states and 35230 transitions. [2019-09-07 18:33:01,787 INFO L78 Accepts]: Start accepts. Automaton has 28582 states and 35230 transitions. Word has length 412 [2019-09-07 18:33:01,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:33:01,788 INFO L475 AbstractCegarLoop]: Abstraction has 28582 states and 35230 transitions. [2019-09-07 18:33:01,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 18:33:01,788 INFO L276 IsEmpty]: Start isEmpty. Operand 28582 states and 35230 transitions. [2019-09-07 18:33:01,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-09-07 18:33:01,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:33:01,866 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:33:01,867 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:33:01,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:33:01,867 INFO L82 PathProgramCache]: Analyzing trace with hash 454542788, now seen corresponding path program 1 times [2019-09-07 18:33:01,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:33:01,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:33:01,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:33:01,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:33:01,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:33:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:33:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 343 proven. 95 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-09-07 18:33:03,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:33:03,065 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:33:03,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:33:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:33:03,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:33:03,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:33:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 642 proven. 2 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-07 18:33:03,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:33:03,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 18:33:03,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 18:33:03,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 18:33:03,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 18:33:03,648 INFO L87 Difference]: Start difference. First operand 28582 states and 35230 transitions. Second operand 7 states. [2019-09-07 18:33:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:33:05,624 INFO L93 Difference]: Finished difference Result 65042 states and 80595 transitions. [2019-09-07 18:33:05,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 18:33:05,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 533 [2019-09-07 18:33:05,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:33:05,751 INFO L225 Difference]: With dead ends: 65042 [2019-09-07 18:33:05,751 INFO L226 Difference]: Without dead ends: 36655 [2019-09-07 18:33:05,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-09-07 18:33:05,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36655 states. [2019-09-07 18:33:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36655 to 32812. [2019-09-07 18:33:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32812 states. [2019-09-07 18:33:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32812 states to 32812 states and 40325 transitions. [2019-09-07 18:33:06,473 INFO L78 Accepts]: Start accepts. Automaton has 32812 states and 40325 transitions. Word has length 533 [2019-09-07 18:33:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:33:06,474 INFO L475 AbstractCegarLoop]: Abstraction has 32812 states and 40325 transitions. [2019-09-07 18:33:06,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 18:33:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 32812 states and 40325 transitions. [2019-09-07 18:33:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2019-09-07 18:33:06,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:33:06,527 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:33:06,527 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:33:06,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:33:06,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1942775892, now seen corresponding path program 1 times [2019-09-07 18:33:06,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:33:06,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:33:06,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:33:06,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:33:06,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:33:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:33:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 515 proven. 72 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-09-07 18:33:07,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:33:07,434 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:33:07,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:33:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:33:07,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 18:33:07,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:33:07,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:33:07,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:33:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 10 proven. 577 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-09-07 18:33:09,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:33:09,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2019-09-07 18:33:09,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 18:33:09,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 18:33:09,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2019-09-07 18:33:09,323 INFO L87 Difference]: Start difference. First operand 32812 states and 40325 transitions. Second operand 11 states. [2019-09-07 18:33:22,712 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-09-07 18:33:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:33:58,168 INFO L93 Difference]: Finished difference Result 74444 states and 93532 transitions. [2019-09-07 18:33:58,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 18:33:58,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 557 [2019-09-07 18:33:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:33:58,307 INFO L225 Difference]: With dead ends: 74444 [2019-09-07 18:33:58,308 INFO L226 Difference]: Without dead ends: 43372 [2019-09-07 18:33:58,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 571 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=166, Invalid=529, Unknown=7, NotChecked=0, Total=702 [2019-09-07 18:33:58,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43372 states. [2019-09-07 18:33:59,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43372 to 41870. [2019-09-07 18:33:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41870 states. [2019-09-07 18:33:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41870 states to 41870 states and 51367 transitions. [2019-09-07 18:33:59,390 INFO L78 Accepts]: Start accepts. Automaton has 41870 states and 51367 transitions. Word has length 557 [2019-09-07 18:33:59,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:33:59,390 INFO L475 AbstractCegarLoop]: Abstraction has 41870 states and 51367 transitions. [2019-09-07 18:33:59,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 18:33:59,390 INFO L276 IsEmpty]: Start isEmpty. Operand 41870 states and 51367 transitions. [2019-09-07 18:33:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2019-09-07 18:33:59,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:33:59,436 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 18:33:59,436 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:33:59,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:33:59,437 INFO L82 PathProgramCache]: Analyzing trace with hash -460648773, now seen corresponding path program 1 times [2019-09-07 18:33:59,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:33:59,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:33:59,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:33:59,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:33:59,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:33:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 278 proven. 233 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-09-07 18:34:00,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:34:00,592 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:34:00,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:00,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 18:34:00,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:34:00,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 18:34:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 667 proven. 2 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-09-07 18:34:01,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:34:01,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2019-09-07 18:34:01,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 18:34:01,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 18:34:01,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-09-07 18:34:01,354 INFO L87 Difference]: Start difference. First operand 41870 states and 51367 transitions. Second operand 15 states. [2019-09-07 18:34:06,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:34:06,170 INFO L93 Difference]: Finished difference Result 84615 states and 106503 transitions. [2019-09-07 18:34:06,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 18:34:06,171 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 573 [2019-09-07 18:34:06,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:34:06,265 INFO L225 Difference]: With dead ends: 84615 [2019-09-07 18:34:06,265 INFO L226 Difference]: Without dead ends: 42941 [2019-09-07 18:34:06,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=354, Invalid=906, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 18:34:06,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42941 states. [2019-09-07 18:34:07,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42941 to 42467. [2019-09-07 18:34:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42467 states. [2019-09-07 18:34:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42467 states to 42467 states and 51036 transitions. [2019-09-07 18:34:09,179 INFO L78 Accepts]: Start accepts. Automaton has 42467 states and 51036 transitions. Word has length 573 [2019-09-07 18:34:09,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:34:09,180 INFO L475 AbstractCegarLoop]: Abstraction has 42467 states and 51036 transitions. [2019-09-07 18:34:09,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 18:34:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 42467 states and 51036 transitions. [2019-09-07 18:34:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2019-09-07 18:34:09,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:34:09,243 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:34:09,243 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:34:09,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:34:09,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1049197127, now seen corresponding path program 1 times [2019-09-07 18:34:09,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:34:09,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:34:09,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:09,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:09,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 628 proven. 104 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-09-07 18:34:10,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:34:10,268 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) [2019-09-07 18:34:10,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:34:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:10,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:34:10,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:34:10,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:34:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 696 proven. 2 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-09-07 18:34:10,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:34:10,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 18:34:10,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 18:34:10,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 18:34:10,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-07 18:34:10,639 INFO L87 Difference]: Start difference. First operand 42467 states and 51036 transitions. Second operand 11 states. [2019-09-07 18:34:18,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:34:18,188 INFO L93 Difference]: Finished difference Result 104230 states and 129172 transitions. [2019-09-07 18:34:18,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 18:34:18,189 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 583 [2019-09-07 18:34:18,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:34:18,324 INFO L225 Difference]: With dead ends: 104230 [2019-09-07 18:34:18,324 INFO L226 Difference]: Without dead ends: 61187 [2019-09-07 18:34:18,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=463, Invalid=1793, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 18:34:18,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61187 states. [2019-09-07 18:34:19,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61187 to 59113. [2019-09-07 18:34:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59113 states. [2019-09-07 18:34:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59113 states to 59113 states and 71370 transitions. [2019-09-07 18:34:19,612 INFO L78 Accepts]: Start accepts. Automaton has 59113 states and 71370 transitions. Word has length 583 [2019-09-07 18:34:19,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:34:19,613 INFO L475 AbstractCegarLoop]: Abstraction has 59113 states and 71370 transitions. [2019-09-07 18:34:19,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 18:34:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 59113 states and 71370 transitions. [2019-09-07 18:34:19,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2019-09-07 18:34:19,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:34:19,700 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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:34:19,701 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:34:19,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:34:19,701 INFO L82 PathProgramCache]: Analyzing trace with hash -337863900, now seen corresponding path program 1 times [2019-09-07 18:34:19,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:34:19,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:34:19,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:19,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:19,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1294 backedges. 196 proven. 777 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2019-09-07 18:34:20,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:34:20,415 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:34:20,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:20,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:34:20,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:34:21,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1294 backedges. 751 proven. 2 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-09-07 18:34:21,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:34:21,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-09-07 18:34:21,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 18:34:21,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 18:34:21,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-07 18:34:21,392 INFO L87 Difference]: Start difference. First operand 59113 states and 71370 transitions. Second operand 10 states. [2019-09-07 18:34:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:34:25,352 INFO L93 Difference]: Finished difference Result 132231 states and 161811 transitions. [2019-09-07 18:34:25,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 18:34:25,352 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 684 [2019-09-07 18:34:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:34:25,516 INFO L225 Difference]: With dead ends: 132231 [2019-09-07 18:34:25,517 INFO L226 Difference]: Without dead ends: 76196 [2019-09-07 18:34:25,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 692 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-09-07 18:34:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76196 states. [2019-09-07 18:34:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76196 to 74395. [2019-09-07 18:34:26,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74395 states. [2019-09-07 18:34:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74395 states to 74395 states and 90137 transitions. [2019-09-07 18:34:26,914 INFO L78 Accepts]: Start accepts. Automaton has 74395 states and 90137 transitions. Word has length 684 [2019-09-07 18:34:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:34:26,914 INFO L475 AbstractCegarLoop]: Abstraction has 74395 states and 90137 transitions. [2019-09-07 18:34:26,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 18:34:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 74395 states and 90137 transitions. [2019-09-07 18:34:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 739 [2019-09-07 18:34:26,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:34:26,980 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:34:26,980 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:34:26,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:34:26,981 INFO L82 PathProgramCache]: Analyzing trace with hash 712366711, now seen corresponding path program 1 times [2019-09-07 18:34:26,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:34:26,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:34:26,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:26,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:26,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1467 backedges. 583 proven. 144 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2019-09-07 18:34:27,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:34:27,643 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:34:27,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:27,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:34:27,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:34:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1467 backedges. 1065 proven. 2 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-07 18:34:28,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:34:28,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 18:34:28,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 18:34:28,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 18:34:28,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 18:34:28,576 INFO L87 Difference]: Start difference. First operand 74395 states and 90137 transitions. Second operand 7 states. [2019-09-07 18:34:31,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:34:31,385 INFO L93 Difference]: Finished difference Result 141854 states and 171711 transitions. [2019-09-07 18:34:31,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 18:34:31,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 738 [2019-09-07 18:34:31,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:34:31,520 INFO L225 Difference]: With dead ends: 141854 [2019-09-07 18:34:31,521 INFO L226 Difference]: Without dead ends: 67655 [2019-09-07 18:34:31,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 742 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-09-07 18:34:31,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67655 states. [2019-09-07 18:34:34,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67655 to 67229. [2019-09-07 18:34:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67229 states. [2019-09-07 18:34:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67229 states to 67229 states and 79255 transitions. [2019-09-07 18:34:34,693 INFO L78 Accepts]: Start accepts. Automaton has 67229 states and 79255 transitions. Word has length 738 [2019-09-07 18:34:34,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:34:34,693 INFO L475 AbstractCegarLoop]: Abstraction has 67229 states and 79255 transitions. [2019-09-07 18:34:34,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 18:34:34,693 INFO L276 IsEmpty]: Start isEmpty. Operand 67229 states and 79255 transitions. [2019-09-07 18:34:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2019-09-07 18:34:34,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:34:34,751 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-07 18:34:34,752 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:34:34,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:34:34,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1621651928, now seen corresponding path program 1 times [2019-09-07 18:34:34,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:34:34,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:34:34,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:34,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1973 backedges. 482 proven. 813 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2019-09-07 18:34:35,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:34:35,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:34:35,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:36,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:34:36,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:34:36,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1973 backedges. 1390 proven. 2 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2019-09-07 18:34:36,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:34:36,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 16 [2019-09-07 18:34:36,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 18:34:36,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 18:34:36,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:34:36,603 INFO L87 Difference]: Start difference. First operand 67229 states and 79255 transitions. Second operand 16 states. [2019-09-07 18:34:45,857 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-09-07 18:34:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:34:46,051 INFO L93 Difference]: Finished difference Result 144304 states and 171841 transitions. [2019-09-07 18:34:46,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 18:34:46,052 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 817 [2019-09-07 18:34:46,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:34:46,198 INFO L225 Difference]: With dead ends: 144304 [2019-09-07 18:34:46,199 INFO L226 Difference]: Without dead ends: 77459 [2019-09-07 18:34:46,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 934 GetRequests, 860 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1794 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1094, Invalid=4456, Unknown=0, NotChecked=0, Total=5550 [2019-09-07 18:34:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77459 states. [2019-09-07 18:34:47,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77459 to 73207. [2019-09-07 18:34:47,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73207 states. [2019-09-07 18:34:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73207 states to 73207 states and 84152 transitions. [2019-09-07 18:34:47,096 INFO L78 Accepts]: Start accepts. Automaton has 73207 states and 84152 transitions. Word has length 817 [2019-09-07 18:34:47,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:34:47,096 INFO L475 AbstractCegarLoop]: Abstraction has 73207 states and 84152 transitions. [2019-09-07 18:34:47,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 18:34:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 73207 states and 84152 transitions. [2019-09-07 18:34:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 975 [2019-09-07 18:34:47,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:34:47,160 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:34:47,160 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:34:47,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:34:47,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1273980890, now seen corresponding path program 1 times [2019-09-07 18:34:47,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:34:47,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:34:47,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:47,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:47,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:48,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3085 backedges. 334 proven. 10 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2019-09-07 18:34:48,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:34:48,561 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:34:48,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:48,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 18:34:48,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:34:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3085 backedges. 1624 proven. 0 refuted. 0 times theorem prover too weak. 1461 trivial. 0 not checked. [2019-09-07 18:34:49,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:34:49,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 18:34:49,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 18:34:49,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 18:34:49,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:34:49,143 INFO L87 Difference]: Start difference. First operand 73207 states and 84152 transitions. Second operand 3 states. [2019-09-07 18:34:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:34:50,449 INFO L93 Difference]: Finished difference Result 140783 states and 161698 transitions. [2019-09-07 18:34:50,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 18:34:50,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 974 [2019-09-07 18:34:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:34:50,627 INFO L225 Difference]: With dead ends: 140783 [2019-09-07 18:34:50,628 INFO L226 Difference]: Without dead ends: 68206 [2019-09-07 18:34:50,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 976 GetRequests, 975 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:34:50,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68206 states. [2019-09-07 18:34:52,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68206 to 67230. [2019-09-07 18:34:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67230 states. [2019-09-07 18:34:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67230 states to 67230 states and 75847 transitions. [2019-09-07 18:34:52,933 INFO L78 Accepts]: Start accepts. Automaton has 67230 states and 75847 transitions. Word has length 974 [2019-09-07 18:34:52,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:34:52,934 INFO L475 AbstractCegarLoop]: Abstraction has 67230 states and 75847 transitions. [2019-09-07 18:34:52,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 18:34:52,934 INFO L276 IsEmpty]: Start isEmpty. Operand 67230 states and 75847 transitions. [2019-09-07 18:34:52,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1035 [2019-09-07 18:34:52,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:34:52,994 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:34:52,994 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:34:52,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:34:52,995 INFO L82 PathProgramCache]: Analyzing trace with hash -328574493, now seen corresponding path program 1 times [2019-09-07 18:34:52,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:34:52,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:34:52,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:52,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:52,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:34:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3061 backedges. 915 proven. 1390 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2019-09-07 18:34:58,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:34:58,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:34:58,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:34:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:34:58,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:34:58,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:34:58,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:34:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3061 backedges. 1943 proven. 2 refuted. 0 times theorem prover too weak. 1116 trivial. 0 not checked. [2019-09-07 18:34:59,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:34:59,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 5] total 29 [2019-09-07 18:34:59,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 18:34:59,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 18:34:59,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2019-09-07 18:34:59,050 INFO L87 Difference]: Start difference. First operand 67230 states and 75847 transitions. Second operand 29 states. [2019-09-07 18:35:04,896 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-09-07 18:35:13,979 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-07 18:35:15,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:35:15,219 INFO L93 Difference]: Finished difference Result 131056 states and 149737 transitions. [2019-09-07 18:35:15,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-07 18:35:15,219 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 1034 [2019-09-07 18:35:15,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:35:15,348 INFO L225 Difference]: With dead ends: 131056 [2019-09-07 18:35:15,348 INFO L226 Difference]: Without dead ends: 62873 [2019-09-07 18:35:15,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1198 GetRequests, 1087 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3946 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1975, Invalid=10457, Unknown=0, NotChecked=0, Total=12432 [2019-09-07 18:35:15,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62873 states. [2019-09-07 18:35:15,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62873 to 36808. [2019-09-07 18:35:15,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36808 states. [2019-09-07 18:35:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36808 states to 36808 states and 40621 transitions. [2019-09-07 18:35:16,031 INFO L78 Accepts]: Start accepts. Automaton has 36808 states and 40621 transitions. Word has length 1034 [2019-09-07 18:35:16,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:35:16,032 INFO L475 AbstractCegarLoop]: Abstraction has 36808 states and 40621 transitions. [2019-09-07 18:35:16,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 18:35:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 36808 states and 40621 transitions. [2019-09-07 18:35:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1123 [2019-09-07 18:35:16,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:35:16,066 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:35:16,066 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:35:16,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:35:16,067 INFO L82 PathProgramCache]: Analyzing trace with hash 751880323, now seen corresponding path program 1 times [2019-09-07 18:35:16,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:35:16,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:35:16,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:35:16,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:35:16,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:35:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:35:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3774 backedges. 616 proven. 650 refuted. 0 times theorem prover too weak. 2508 trivial. 0 not checked. [2019-09-07 18:35:17,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:35:17,937 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:35:17,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:35:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:35:18,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 1622 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 18:35:18,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:35:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3774 backedges. 2374 proven. 2 refuted. 0 times theorem prover too weak. 1398 trivial. 0 not checked. [2019-09-07 18:35:19,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:35:19,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 18:35:19,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 18:35:19,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 18:35:19,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-07 18:35:19,126 INFO L87 Difference]: Start difference. First operand 36808 states and 40621 transitions. Second operand 10 states. [2019-09-07 18:35:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:35:24,172 INFO L93 Difference]: Finished difference Result 63855 states and 70603 transitions. [2019-09-07 18:35:24,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 18:35:24,172 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1122 [2019-09-07 18:35:24,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:35:24,173 INFO L225 Difference]: With dead ends: 63855 [2019-09-07 18:35:24,173 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 18:35:24,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1169 GetRequests, 1139 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2019-09-07 18:35:24,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 18:35:24,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 18:35:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 18:35:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 18:35:24,222 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1122 [2019-09-07 18:35:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:35:24,222 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 18:35:24,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 18:35:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 18:35:24,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 18:35:24,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 18:35:25,918 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 89 [2019-09-07 18:35:39,180 WARN L188 SmtUtils]: Spent 12.73 s on a formula simplification. DAG size of input: 2464 DAG size of output: 1648 [2019-09-07 18:35:47,795 WARN L188 SmtUtils]: Spent 8.61 s on a formula simplification. DAG size of input: 2464 DAG size of output: 1648 [2019-09-07 18:35:47,944 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 37 [2019-09-07 18:36:08,452 WARN L188 SmtUtils]: Spent 20.40 s on a formula simplification. DAG size of input: 1379 DAG size of output: 203 [2019-09-07 18:36:47,746 WARN L188 SmtUtils]: Spent 39.27 s on a formula simplification. DAG size of input: 1372 DAG size of output: 153 [2019-09-07 18:37:27,580 WARN L188 SmtUtils]: Spent 39.82 s on a formula simplification. DAG size of input: 1372 DAG size of output: 153 [2019-09-07 18:37:27,584 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 18:37:27,584 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:37:27,584 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 18:37:27,584 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-09-07 18:37:27,584 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-09-07 18:37:27,585 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-09-07 18:37:27,585 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,585 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,585 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,585 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,585 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,585 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,585 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,585 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-09-07 18:37:27,586 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-09-07 18:37:27,586 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-09-07 18:37:27,586 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,586 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,586 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,586 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,587 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,587 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,587 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,587 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,587 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,587 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2019-09-07 18:37:27,587 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-09-07 18:37:27,587 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-09-07 18:37:27,587 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-09-07 18:37:27,588 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,588 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,588 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,588 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,588 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,588 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,588 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,588 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,588 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,589 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-09-07 18:37:27,589 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-09-07 18:37:27,589 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-09-07 18:37:27,589 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-09-07 18:37:27,589 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-09-07 18:37:27,589 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-09-07 18:37:27,589 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-09-07 18:37:27,589 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,589 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,589 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,590 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,590 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,590 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,590 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,590 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,590 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,590 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,590 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-09-07 18:37:27,590 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-09-07 18:37:27,591 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-09-07 18:37:27,591 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,591 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,591 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,591 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,591 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,591 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-09-07 18:37:27,591 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-09-07 18:37:27,591 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-09-07 18:37:27,592 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,592 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,592 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,592 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,592 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,592 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-09-07 18:37:27,592 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-09-07 18:37:27,592 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,592 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,593 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,593 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,593 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,593 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,593 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-09-07 18:37:27,593 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-09-07 18:37:27,593 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,593 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,594 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-09-07 18:37:27,594 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-09-07 18:37:27,594 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-09-07 18:37:27,594 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,594 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,594 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,594 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,594 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,594 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,594 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,595 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-09-07 18:37:27,595 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-09-07 18:37:27,595 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-09-07 18:37:27,595 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-09-07 18:37:27,595 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-09-07 18:37:27,595 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-09-07 18:37:27,595 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-09-07 18:37:27,595 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,595 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,596 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-09-07 18:37:27,596 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-09-07 18:37:27,596 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,596 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,596 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,596 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,597 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 22 1026) the Hoare annotation is: (let ((.cse21 (= 12 |old(~a25~0)|)) (.cse43 (= 1 ~a3~0)) (.cse42 (= 15 ~a8~0)) (.cse17 (not (<= |old(~a29~0)| 277))) (.cse33 (not (<= |old(~a23~0)| 138)))) (let ((.cse30 (<= |old(~a23~0)| ~a23~0)) (.cse36 (not (<= |old(~a29~0)| 130))) (.cse8 (or .cse17 .cse33)) (.cse39 (not (<= 141 |old(~a29~0)|))) (.cse13 (not .cse42)) (.cse14 (not .cse43)) (.cse31 (not (<= |old(~a4~0)| 0))) (.cse15 (not .cse21)) (.cse3 (= ~a23~0 |old(~a23~0)|)) (.cse29 (= ~a29~0 |old(~a29~0)|)) (.cse4 (= ~a4~0 |old(~a4~0)|)) (.cse5 (= ~a25~0 |old(~a25~0)|)) (.cse11 (= 13 |old(~a25~0)|))) (let ((.cse25 (not .cse11)) (.cse20 (not (<= 10250 |old(~a29~0)|))) (.cse24 (not (<= |old(~a29~0)| 310110))) (.cse28 (not (<= (+ |old(~a23~0)| 212) 0))) (.cse23 (and .cse3 .cse29 .cse4 .cse5)) (.cse27 (not (<= |old(~a29~0)| 245))) (.cse19 (and (and .cse29 .cse3) .cse4 .cse5)) (.cse34 (not (< 306 |old(~a23~0)|))) (.cse2 (and (and (<= ~a4~0 0) .cse29 .cse3 (<= ~a23~0 138) .cse42 (= ~a25~0 12) .cse43 (<= 141 ~a29~0) (<= ~a29~0 277)) .cse4)) (.cse0 (or .cse8 .cse39 .cse13 .cse14 .cse31 .cse15)) (.cse32 (not (< 0 (+ |old(~a23~0)| 43)))) (.cse12 (not (<= |old(~a23~0)| 312))) (.cse6 (not (<= |old(~a29~0)| 140))) (.cse22 (= 9 |old(~a25~0)|)) (.cse10 (or .cse36 .cse33)) (.cse37 (not (<= (+ |old(~a23~0)| 213) 0))) (.cse9 (not (<= |old(~a25~0)| 10))) (.cse38 (and .cse29 .cse30 (exists ((v_~a23~0_481 Int)) (and (<= 0 v_~a23~0_481) (<= ~a23~0 (+ (mod v_~a23~0_481 299846) 300155)) (<= |old(~a23~0)| v_~a23~0_481))) .cse4 .cse5)) (.cse1 (not (<= 247 |old(~a29~0)|))) (.cse35 (not (<= |old(~a25~0)| 9))) (.cse18 (forall ((v_~a23~0_481 Int)) (or (not (<= |old(~a23~0)| v_~a23~0_481)) (not (<= 0 v_~a23~0_481)) (not (<= |old(~a23~0)| (+ (mod v_~a23~0_481 299846) 300155)))))) (.cse26 (forall ((v_~a23~0_479 Int)) (or (not (<= |old(~a23~0)| (+ (mod v_~a23~0_479 299846) 300154))) (not (<= |old(~a23~0)| v_~a23~0_479)) (not (<= 0 v_~a23~0_479))))) (.cse7 (not (= 1 |old(~a4~0)|))) (.cse41 (not (<= (+ |old(~a29~0)| 320173) 0))) (.cse40 (not (= 0 |old(~a4~0)|))) (.cse16 (and .cse29 .cse3 .cse4 .cse5))) (and (or .cse0 .cse1 .cse2) (or (and .cse3 .cse4 .cse5 (<= ~a29~0 140)) .cse6 .cse7 .cse8 .cse9) (or .cse10 (and .cse3 (<= ~a29~0 130) .cse4 .cse5) .cse7 .cse11) (or (or .cse12 .cse13 .cse14 .cse7 .cse15) .cse16) (or .cse3 .cse1 (or .cse17 .cse13 .cse14 .cse7 .cse18 .cse9)) (or .cse19 (and (or .cse13 .cse14 .cse20 .cse21 .cse7 .cse11 .cse22 .cse18) (or .cse13 .cse14 .cse20 (or (not (<= 308 |old(~a23~0)|)) .cse9) .cse7 .cse18))) (or .cse23 (or .cse13 .cse14 .cse24 .cse20 .cse7 .cse25 .cse26)) (or (or (or .cse27 .cse12 .cse13 .cse14) .cse7) .cse3) (or .cse28 .cse13 .cse14 (and .cse29 .cse30 (<= (+ ~a23~0 212) 0) .cse4 .cse5) (or .cse10 .cse11 .cse31 .cse22)) (or .cse13 .cse14 .cse16 .cse25 .cse32 .cse31 .cse33) (or .cse34 .cse13 .cse14 .cse24 .cse7 .cse25 .cse26 .cse16) (or .cse20 .cse16 .cse13 .cse14 .cse24 .cse35 .cse31 .cse33) (or .cse28 .cse29 (or .cse7 .cse36 .cse9)) (or (or .cse13 .cse14 (or .cse7 .cse33 .cse9)) .cse19) (or .cse23 (or .cse13 .cse14 .cse32 .cse31 .cse15 .cse33)) (or .cse16 .cse15 .cse13 .cse14 .cse31 .cse37) (or .cse38 .cse27 .cse13 .cse14 (not (< 140 |old(~a29~0)|)) .cse7 .cse18) (or .cse1 .cse11 .cse13 .cse14 .cse16 .cse31 .cse22 .cse37) (or .cse19 (or .cse13 .cse14 .cse26 (or .cse34 .cse7 .cse9))) (or .cse11 .cse17 .cse26 .cse3 .cse39 .cse13 .cse14 .cse7 .cse22) (or .cse2 .cse0 .cse40) (or .cse6 .cse33 .cse16 .cse13 .cse14 .cse32 .cse31 .cse9) (or .cse6 .cse16 .cse12 .cse13 .cse14 .cse7) (or .cse13 .cse14 .cse16 .cse41 .cse35 .cse31 .cse33) (or .cse13 .cse14 (and (and .cse29 (and .cse3 .cse4)) .cse5) .cse32 (or .cse7 .cse8)) (or .cse21 .cse1 .cse11 .cse16 .cse26 .cse13 .cse14 .cse7 .cse22) (or .cse16 .cse1 .cse17 .cse15 .cse12 .cse13 .cse14 .cse40) (or .cse6 .cse16 .cse11 .cse13 .cse14 .cse31 .cse22 .cse37) (or .cse11 .cse17 .cse39 .cse13 .cse14 .cse7 .cse22 .cse18 .cse38) (or (or .cse13 .cse14 (or .cse10 .cse31 .cse37 .cse9)) .cse16) (or .cse38 .cse1 (or .cse13 .cse14 .cse17 .cse35 .cse7 .cse18)) (or .cse26 .cse15 .cse13 .cse14 .cse7 .cse36 .cse16) (or (or .cse13 .cse14 .cse41 .cse33) .cse40 .cse15 .cse16))))) [2019-09-07 18:37:27,597 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,597 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-09-07 18:37:27,597 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-09-07 18:37:27,597 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-09-07 18:37:27,597 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,598 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,598 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,598 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,598 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,598 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,598 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-09-07 18:37:27,598 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-09-07 18:37:27,598 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-09-07 18:37:27,599 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,599 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,599 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,599 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,599 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,599 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,599 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,599 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,599 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-09-07 18:37:27,599 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-09-07 18:37:27,600 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-09-07 18:37:27,600 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,600 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,600 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,600 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,600 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,600 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,600 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,600 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,601 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,601 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,601 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,601 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-09-07 18:37:27,601 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-09-07 18:37:27,601 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-09-07 18:37:27,601 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-09-07 18:37:27,601 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-09-07 18:37:27,601 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,601 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,602 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,602 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,602 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,602 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,602 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,602 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-09-07 18:37:27,602 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-09-07 18:37:27,602 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-09-07 18:37:27,602 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,602 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,603 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,603 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-09-07 18:37:27,603 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-09-07 18:37:27,603 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,603 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,603 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,603 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,603 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,603 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-09-07 18:37:27,603 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-09-07 18:37:27,603 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,604 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,604 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-09-07 18:37:27,604 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-09-07 18:37:27,604 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,604 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,604 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,604 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,604 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,604 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,604 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-09-07 18:37:27,605 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-09-07 18:37:27,605 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-09-07 18:37:27,605 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-09-07 18:37:27,605 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,605 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,605 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,605 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,605 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,605 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,605 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,606 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,606 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-09-07 18:37:27,606 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-09-07 18:37:27,606 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-09-07 18:37:27,606 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-09-07 18:37:27,606 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-09-07 18:37:27,606 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-09-07 18:37:27,606 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,606 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,607 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,607 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,607 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,607 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,607 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,607 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-09-07 18:37:27,607 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-09-07 18:37:27,607 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,607 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,608 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,608 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,608 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,608 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,608 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,608 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-09-07 18:37:27,608 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-09-07 18:37:27,608 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,609 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,609 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,609 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,609 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,609 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,609 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,609 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-09-07 18:37:27,609 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,610 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,610 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,610 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-09-07 18:37:27,610 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-09-07 18:37:27,610 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-09-07 18:37:27,610 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,610 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-09-07 18:37:27,610 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,610 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-09-07 18:37:27,611 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,611 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,611 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,611 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,611 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,611 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,611 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-09-07 18:37:27,611 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-09-07 18:37:27,611 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-09-07 18:37:27,612 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,612 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,612 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,612 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,612 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,612 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,612 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,612 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,612 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,613 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,613 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-09-07 18:37:27,613 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-09-07 18:37:27,613 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-09-07 18:37:27,613 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,613 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-09-07 18:37:27,613 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-09-07 18:37:27,613 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,614 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,614 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,614 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,614 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,614 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,614 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-09-07 18:37:27,614 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-09-07 18:37:27,614 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-09-07 18:37:27,614 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,614 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,615 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,615 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,615 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-09-07 18:37:27,615 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-09-07 18:37:27,615 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,615 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,615 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-09-07 18:37:27,615 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,615 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,616 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-09-07 18:37:27,616 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 18:37:27,616 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a25~0 9)) (<= ~a23~0 312) (= 1 ~a3~0) (<= ~a29~0 130) (= 15 ~a8~0) (<= ~a25~0 10) (= 1 ~a4~0) (<= 312 ~a23~0)) [2019-09-07 18:37:27,616 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 18:37:27,616 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 18:37:27,616 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1028 1044) the Hoare annotation is: (or (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)) (= 9 |old(~a25~0)|) (and (= ~a29~0 |old(~a29~0)|) (= ~a23~0 |old(~a23~0)|) (= ~a4~0 |old(~a4~0)|) (= ~a25~0 |old(~a25~0)|)) (not (<= |old(~a25~0)| 10))) [2019-09-07 18:37:27,616 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1028 1044) no Hoare annotation was computed. [2019-09-07 18:37:27,617 INFO L439 ceAbstractionStarter]: At program point L1042(line 1042) the Hoare annotation is: (let ((.cse26 (= ~a25~0 13)) (.cse4 (<= ~a29~0 130)) (.cse28 (<= ~a23~0 138)) (.cse16 (<= ~a29~0 277))) (let ((.cse34 (and .cse28 .cse16)) (.cse33 (and .cse28 .cse4)) (.cse19 (<= ~a25~0 10)) (.cse29 (= 1 |old(~a4~0)|)) (.cse2 (= ~a25~0 12)) (.cse3 (<= 10 |old(~a25~0)|)) (.cse30 (<= 141 ~a29~0)) (.cse8 (not (= ~a25~0 9))) (.cse5 (<= ~a4~0 0)) (.cse6 (not .cse26))) (let ((.cse11 (<= (+ ~a29~0 320173) 0)) (.cse14 (and .cse8 .cse5 .cse6 .cse28 .cse4)) (.cse21 (<= ~a23~0 600000)) (.cse20 (<= ~a29~0 245)) (.cse27 (and (and .cse5 .cse29 .cse28 .cse2 .cse3 (<= |old(~a29~0)| 140) .cse16 .cse30) (not (= 12 |old(~a25~0)|)))) (.cse17 (= 0 ~a4~0)) (.cse31 (not .cse2)) (.cse1 (<= ~a23~0 599999)) (.cse32 (< 306 ~a23~0)) (.cse13 (= ~a4~0 |old(~a4~0)|)) (.cse12 (and (and .cse33 .cse19) .cse5)) (.cse23 (and .cse34 .cse19)) (.cse7 (<= ~a29~0 140)) (.cse15 (<= ~a23~0 312)) (.cse0 (= 1 ~a4~0)) (.cse25 (<= ~a29~0 310110)) (.cse24 (<= 10250 ~a29~0)) (.cse10 (<= ~a25~0 9)) (.cse18 (<= 247 ~a29~0)) (.cse9 (<= (+ ~a23~0 213) 0)) (.cse22 (< 0 (+ ~a23~0 43)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse3 .cse9) (and .cse3 .cse10 .cse11 .cse12) (and (= ~a29~0 |old(~a29~0)|) (= ~a23~0 |old(~a23~0)|) .cse13 (= ~a25~0 |old(~a25~0)|)) (and (<= (+ ~a23~0 212) 0) .cse3 .cse14) (and (and .cse15 .cse2 .cse3 .cse16) .cse17 .cse18) (not (<= 312 |old(~a23~0)|)) (and .cse0 .cse1 .cse3 .cse19 .cse20) (and (and .cse21 .cse3 .cse16 .cse19 .cse13) .cse18) (and .cse17 (and .cse2 .cse3 .cse11 .cse14)) (and .cse3 .cse22 (and .cse5 .cse23 .cse7)) (and .cse24 .cse25 .cse3 (and .cse26 .cse15 .cse13)) (not (<= |old(~a25~0)| 10)) (and .cse27 .cse18) (not (<= |old(~a29~0)| 130)) (= 9 |old(~a25~0)|) (and (and .cse1 (and .cse26 .cse7) .cse3) .cse0) (and .cse26 .cse5 .cse22 .cse3 .cse28) (not .cse29) (and (and .cse21 .cse8 .cse6 .cse16 .cse13) .cse3 .cse30) (and .cse3 (and .cse28 .cse19 .cse0)) (and .cse6 .cse31 .cse1 .cse8 .cse3 .cse18 .cse13) (and .cse21 .cse3 .cse20 .cse30 .cse13) (and .cse26 .cse25 .cse1 .cse3 .cse32 .cse13) (and .cse27 .cse17) (and .cse6 .cse33 .cse0) (and (and (exists ((v_~a23~0_481 Int)) (and (<= 0 v_~a23~0_481) (<= ~a23~0 (+ (mod v_~a23~0_481 299846) 300155)) (<= |old(~a23~0)| v_~a23~0_481))) .cse6 .cse0 (<= 312 ~a23~0)) .cse24 .cse3 .cse31) (and .cse5 .cse2 .cse3 .cse9) (and .cse1 .cse3 .cse32 .cse19 .cse13) (and (and .cse12 .cse9) .cse3) (and (and .cse3 (and .cse34 .cse0)) .cse22) (and .cse0 .cse23 .cse7) (and .cse15 .cse6 .cse0 .cse8 .cse3) (and .cse5 .cse25 .cse24 .cse3 .cse10 .cse28) (not (<= |old(~a23~0)| 312)) (not (= 1 ~a3~0)) (and .cse5 .cse6 .cse8 .cse3 .cse18 .cse9) (not (= 15 ~a8~0)) (and .cse5 .cse28 .cse2 .cse3 .cse22))))) [2019-09-07 18:37:27,617 INFO L443 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2019-09-07 18:37:27,617 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-09-07 18:37:27,618 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse26 (= ~a25~0 13)) (.cse4 (<= ~a29~0 130)) (.cse28 (<= ~a23~0 138)) (.cse16 (<= ~a29~0 277))) (let ((.cse34 (and .cse28 .cse16)) (.cse33 (and .cse28 .cse4)) (.cse19 (<= ~a25~0 10)) (.cse29 (= 1 |old(~a4~0)|)) (.cse2 (= ~a25~0 12)) (.cse3 (<= 10 |old(~a25~0)|)) (.cse30 (<= 141 ~a29~0)) (.cse8 (not (= ~a25~0 9))) (.cse5 (<= ~a4~0 0)) (.cse6 (not .cse26))) (let ((.cse11 (<= (+ ~a29~0 320173) 0)) (.cse14 (and .cse8 .cse5 .cse6 .cse28 .cse4)) (.cse21 (<= ~a23~0 600000)) (.cse20 (<= ~a29~0 245)) (.cse27 (and (and .cse5 .cse29 .cse28 .cse2 .cse3 (<= |old(~a29~0)| 140) .cse16 .cse30) (not (= 12 |old(~a25~0)|)))) (.cse17 (= 0 ~a4~0)) (.cse31 (not .cse2)) (.cse1 (<= ~a23~0 599999)) (.cse32 (< 306 ~a23~0)) (.cse13 (= ~a4~0 |old(~a4~0)|)) (.cse12 (and (and .cse33 .cse19) .cse5)) (.cse23 (and .cse34 .cse19)) (.cse7 (<= ~a29~0 140)) (.cse15 (<= ~a23~0 312)) (.cse0 (= 1 ~a4~0)) (.cse25 (<= ~a29~0 310110)) (.cse24 (<= 10250 ~a29~0)) (.cse10 (<= ~a25~0 9)) (.cse18 (<= 247 ~a29~0)) (.cse9 (<= (+ ~a23~0 213) 0)) (.cse22 (< 0 (+ ~a23~0 43)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse3 .cse9) (and .cse3 .cse10 .cse11 .cse12) (and (= ~a29~0 |old(~a29~0)|) (= ~a23~0 |old(~a23~0)|) .cse13 (= ~a25~0 |old(~a25~0)|)) (and (<= (+ ~a23~0 212) 0) .cse3 .cse14) (and (and .cse15 .cse2 .cse3 .cse16) .cse17 .cse18) (not (<= 312 |old(~a23~0)|)) (and .cse0 .cse1 .cse3 .cse19 .cse20) (and (and .cse21 .cse3 .cse16 .cse19 .cse13) .cse18) (and .cse17 (and .cse2 .cse3 .cse11 .cse14)) (and .cse3 .cse22 (and .cse5 .cse23 .cse7)) (and .cse24 .cse25 .cse3 (and .cse26 .cse15 .cse13)) (not (<= |old(~a25~0)| 10)) (and .cse27 .cse18) (not (<= |old(~a29~0)| 130)) (= 9 |old(~a25~0)|) (and (and .cse1 (and .cse26 .cse7) .cse3) .cse0) (and .cse26 .cse5 .cse22 .cse3 .cse28) (not .cse29) (and (and .cse21 .cse8 .cse6 .cse16 .cse13) .cse3 .cse30) (and .cse3 (and .cse28 .cse19 .cse0)) (and .cse6 .cse31 .cse1 .cse8 .cse3 .cse18 .cse13) (and .cse21 .cse3 .cse20 .cse30 .cse13) (and .cse26 .cse25 .cse1 .cse3 .cse32 .cse13) (and .cse27 .cse17) (and .cse6 .cse33 .cse0) (and (and (exists ((v_~a23~0_481 Int)) (and (<= 0 v_~a23~0_481) (<= ~a23~0 (+ (mod v_~a23~0_481 299846) 300155)) (<= |old(~a23~0)| v_~a23~0_481))) .cse6 .cse0 (<= 312 ~a23~0)) .cse24 .cse3 .cse31) (and .cse5 .cse2 .cse3 .cse9) (and .cse1 .cse3 .cse32 .cse19 .cse13) (and (and .cse12 .cse9) .cse3) (and (and .cse3 (and .cse34 .cse0)) .cse22) (and .cse0 .cse23 .cse7) (and .cse15 .cse6 .cse0 .cse8 .cse3) (and .cse5 .cse25 .cse24 .cse3 .cse10 .cse28) (not (<= |old(~a23~0)| 312)) (not (= 1 ~a3~0)) (and .cse5 .cse6 .cse8 .cse3 .cse18 .cse9) (not (= 15 ~a8~0)) (and .cse5 .cse28 .cse2 .cse3 .cse22))))) [2019-09-07 18:37:27,618 INFO L443 ceAbstractionStarter]: For program point L1034-3(lines 1028 1044) no Hoare annotation was computed. [2019-09-07 18:37:27,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_481,QUANTIFIED] [2019-09-07 18:37:27,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_481,QUANTIFIED] [2019-09-07 18:37:27,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_481,QUANTIFIED] [2019-09-07 18:37:27,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_481,QUANTIFIED] [2019-09-07 18:37:27,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_481,QUANTIFIED] [2019-09-07 18:37:27,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_481,QUANTIFIED] [2019-09-07 18:37:27,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 06:37:27 BoogieIcfgContainer [2019-09-07 18:37:27,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 18:37:27,655 INFO L168 Benchmark]: Toolchain (without parser) took 340654.88 ms. Allocated memory was 133.2 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 85.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-09-07 18:37:27,656 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-09-07 18:37:27,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 935.59 ms. Allocated memory was 133.2 MB in the beginning and 202.4 MB in the end (delta: 69.2 MB). Free memory was 85.7 MB in the beginning and 141.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB. [2019-09-07 18:37:27,657 INFO L168 Benchmark]: Boogie Preprocessor took 154.80 ms. Allocated memory is still 202.4 MB. Free memory was 141.0 MB in the beginning and 133.7 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 7.1 GB. [2019-09-07 18:37:27,658 INFO L168 Benchmark]: RCFGBuilder took 1922.56 ms. Allocated memory was 202.4 MB in the beginning and 227.5 MB in the end (delta: 25.2 MB). Free memory was 133.1 MB in the beginning and 80.6 MB in the end (delta: 52.4 MB). Peak memory consumption was 77.6 MB. Max. memory is 7.1 GB. [2019-09-07 18:37:27,659 INFO L168 Benchmark]: TraceAbstraction took 337637.32 ms. Allocated memory was 227.5 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 80.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-09-07 18:37:27,663 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.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 935.59 ms. Allocated memory was 133.2 MB in the beginning and 202.4 MB in the end (delta: 69.2 MB). Free memory was 85.7 MB in the beginning and 141.0 MB in the end (delta: -55.3 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 154.80 ms. Allocated memory is still 202.4 MB. Free memory was 141.0 MB in the beginning and 133.7 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1922.56 ms. Allocated memory was 202.4 MB in the beginning and 227.5 MB in the end (delta: 25.2 MB). Free memory was 133.1 MB in the beginning and 80.6 MB in the end (delta: 52.4 MB). Peak memory consumption was 77.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 337637.32 ms. Allocated memory was 227.5 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 80.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 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_481,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_481,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_481,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_481,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_481,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_481,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 117]: 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:37:27,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_481,QUANTIFIED] [2019-09-07 18:37:27,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_481,QUANTIFIED] [2019-09-07 18:37:27,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_481,QUANTIFIED] [2019-09-07 18:37:27,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_481,QUANTIFIED] [2019-09-07 18:37:27,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_481,QUANTIFIED] [2019-09-07 18:37:27,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_481,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((1 == a4 && a23 <= 599999) && a25 == 12) && 10 <= \old(a25)) && a29 <= 130) || (((((a4 <= 0 && !(a25 == 13)) && a29 <= 140) && !(a25 == 9)) && 10 <= \old(a25)) && a23 + 213 <= 0)) || (((10 <= \old(a25) && a25 <= 9) && a29 + 320173 <= 0) && ((a23 <= 138 && a29 <= 130) && a25 <= 10) && a4 <= 0)) || (((a29 == \old(a29) && a23 == \old(a23)) && a4 == \old(a4)) && a25 == \old(a25))) || ((a23 + 212 <= 0 && 10 <= \old(a25)) && (((!(a25 == 9) && a4 <= 0) && !(a25 == 13)) && a23 <= 138) && a29 <= 130)) || (((((a23 <= 312 && a25 == 12) && 10 <= \old(a25)) && a29 <= 277) && 0 == a4) && 247 <= a29)) || !(312 <= \old(a23))) || ((((1 == a4 && a23 <= 599999) && 10 <= \old(a25)) && a25 <= 10) && a29 <= 245)) || (((((a23 <= 600000 && 10 <= \old(a25)) && a29 <= 277) && a25 <= 10) && a4 == \old(a4)) && 247 <= a29)) || (0 == a4 && ((a25 == 12 && 10 <= \old(a25)) && a29 + 320173 <= 0) && (((!(a25 == 9) && a4 <= 0) && !(a25 == 13)) && a23 <= 138) && a29 <= 130)) || ((10 <= \old(a25) && 0 < a23 + 43) && (a4 <= 0 && (a23 <= 138 && a29 <= 277) && a25 <= 10) && a29 <= 140)) || (((10250 <= a29 && a29 <= 310110) && 10 <= \old(a25)) && (a25 == 13 && a23 <= 312) && a4 == \old(a4))) || !(\old(a25) <= 10)) || (((((((((a4 <= 0 && 1 == \old(a4)) && a23 <= 138) && a25 == 12) && 10 <= \old(a25)) && \old(a29) <= 140) && a29 <= 277) && 141 <= a29) && !(12 == \old(a25))) && 247 <= a29)) || !(\old(a29) <= 130)) || 9 == \old(a25)) || (((a23 <= 599999 && a25 == 13 && a29 <= 140) && 10 <= \old(a25)) && 1 == a4)) || ((((a25 == 13 && a4 <= 0) && 0 < a23 + 43) && 10 <= \old(a25)) && a23 <= 138)) || !(1 == \old(a4))) || ((((((a23 <= 600000 && !(a25 == 9)) && !(a25 == 13)) && a29 <= 277) && a4 == \old(a4)) && 10 <= \old(a25)) && 141 <= a29)) || (10 <= \old(a25) && (a23 <= 138 && a25 <= 10) && 1 == a4)) || ((((((!(a25 == 13) && !(a25 == 12)) && a23 <= 599999) && !(a25 == 9)) && 10 <= \old(a25)) && 247 <= a29) && a4 == \old(a4))) || ((((a23 <= 600000 && 10 <= \old(a25)) && a29 <= 245) && 141 <= a29) && a4 == \old(a4))) || (((((a25 == 13 && a29 <= 310110) && a23 <= 599999) && 10 <= \old(a25)) && 306 < a23) && a4 == \old(a4))) || (((((((((a4 <= 0 && 1 == \old(a4)) && a23 <= 138) && a25 == 12) && 10 <= \old(a25)) && \old(a29) <= 140) && a29 <= 277) && 141 <= a29) && !(12 == \old(a25))) && 0 == a4)) || ((!(a25 == 13) && a23 <= 138 && a29 <= 130) && 1 == a4)) || (((((((\exists v_~a23~0_481 : int :: (0 <= v_~a23~0_481 && a23 <= v_~a23~0_481 % 299846 + 300155) && \old(a23) <= v_~a23~0_481) && !(a25 == 13)) && 1 == a4) && 312 <= a23) && 10250 <= a29) && 10 <= \old(a25)) && !(a25 == 12))) || (((a4 <= 0 && a25 == 12) && 10 <= \old(a25)) && a23 + 213 <= 0)) || ((((a23 <= 599999 && 10 <= \old(a25)) && 306 < a23) && a25 <= 10) && a4 == \old(a4))) || (((((a23 <= 138 && a29 <= 130) && a25 <= 10) && a4 <= 0) && a23 + 213 <= 0) && 10 <= \old(a25))) || ((10 <= \old(a25) && (a23 <= 138 && a29 <= 277) && 1 == a4) && 0 < a23 + 43)) || ((1 == a4 && (a23 <= 138 && a29 <= 277) && a25 <= 10) && a29 <= 140)) || ((((a23 <= 312 && !(a25 == 13)) && 1 == a4) && !(a25 == 9)) && 10 <= \old(a25))) || (((((a4 <= 0 && a29 <= 310110) && 10250 <= a29) && 10 <= \old(a25)) && a25 <= 9) && a23 <= 138)) || !(\old(a23) <= 312)) || !(1 == a3)) || (((((a4 <= 0 && !(a25 == 13)) && !(a25 == 9)) && 10 <= \old(a25)) && 247 <= a29) && a23 + 213 <= 0)) || !(15 == a8)) || ((((a4 <= 0 && a23 <= 138) && a25 == 12) && 10 <= \old(a25)) && 0 < a23 + 43) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 292 locations, 1 error locations. SAFE Result, 337.5s OverallTime, 20 OverallIterations, 10 TraceHistogramMax, 165.4s AutomataDifference, 0.0s DeadEndRemovalTime, 123.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 2081 SDtfs, 32081 SDslu, 3726 SDs, 0 SdLazy, 55428 SolverSat, 9990 SolverUnsat, 59 SolverUnknown, 0 SolverNotchecked, 124.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9749 GetRequests, 9296 SyntacticMatches, 6 SemanticMatches, 447 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7303 ImplicationChecksByTransitivity, 25.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74395occurred 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: 16.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 49231 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 3297 PreInvPairs, 3737 NumberOfFragments, 3088 HoareAnnotationTreeSize, 3297 FomulaSimplifications, 22211215 FormulaSimplificationTreeSizeReduction, 23.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 32874272 FormulaSimplificationTreeSizeReductionInter, 99.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 18947 NumberOfCodeBlocks, 18947 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 18912 ConstructedInterpolants, 4 QuantifiedInterpolants, 41140031 SizeOfPredicates, 17 NumberOfNonLiveVariables, 13727 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 35 InterpolantComputations, 8 PerfectInterpolantSequences, 33095/38554 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...