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/Problem15_label47.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:45:37,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:45:37,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:45:37,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:45:37,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:45:37,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:45:37,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:45:37,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:45:37,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:45:37,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:45:37,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:45:37,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:45:37,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:45:37,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:45:37,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:45:37,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:45:37,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:45:37,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:45:37,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:45:37,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:45:37,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:45:37,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:45:37,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:45:37,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:45:37,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:45:37,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:45:37,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:45:37,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:45:37,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:45:37,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:45:37,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:45:37,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:45:37,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:45:37,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:45:37,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:45:37,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:45:37,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:45:37,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:45:37,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:45:37,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:45:37,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:45:37,910 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 20:45:37,925 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:45:37,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:45:37,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:45:37,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:45:37,926 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:45:37,927 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:45:37,927 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:45:37,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:45:37,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:45:37,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:45:37,928 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:45:37,928 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:45:37,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:45:37,928 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:45:37,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:45:37,929 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:45:37,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:45:37,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:45:37,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:45:37,929 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:45:37,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:45:37,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:45:37,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:45:37,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:45:37,930 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:45:37,930 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:45:37,931 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:45:37,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:45:37,931 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:45:37,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:45:37,971 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:45:37,974 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:45:37,976 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:45:37,976 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:45:37,977 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label47.c [2019-09-07 20:45:38,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7880e74/6fb4926113954a2f8bd44c1b365c5ae5/FLAGf56424920 [2019-09-07 20:45:38,706 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:45:38,708 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label47.c [2019-09-07 20:45:38,728 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7880e74/6fb4926113954a2f8bd44c1b365c5ae5/FLAGf56424920 [2019-09-07 20:45:38,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7880e74/6fb4926113954a2f8bd44c1b365c5ae5 [2019-09-07 20:45:38,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:45:38,852 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:45:38,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:45:38,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:45:38,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:45:38,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:45:38" (1/1) ... [2019-09-07 20:45:38,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c54f8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:45:38, skipping insertion in model container [2019-09-07 20:45:38,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:45:38" (1/1) ... [2019-09-07 20:45:38,870 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:45:38,963 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:45:40,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:45:40,037 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:45:40,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:45:40,392 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:45:40,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:45:40 WrapperNode [2019-09-07 20:45:40,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:45:40,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:45:40,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:45:40,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:45:40,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:45:40" (1/1) ... [2019-09-07 20:45:40,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:45:40" (1/1) ... [2019-09-07 20:45:40,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:45:40" (1/1) ... [2019-09-07 20:45:40,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:45:40" (1/1) ... [2019-09-07 20:45:40,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:45:40" (1/1) ... [2019-09-07 20:45:40,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:45:40" (1/1) ... [2019-09-07 20:45:40,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:45:40" (1/1) ... [2019-09-07 20:45:40,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:45:40,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:45:40,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:45:40,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:45:40,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:45:40" (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 20:45:40,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:45:40,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:45:40,700 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:45:40,700 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:45:40,701 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:45:40,701 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:45:40,702 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:45:40,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:45:40,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:45:40,703 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:45:40,704 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:45:40,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:45:40,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:45:44,142 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:45:44,148 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:45:44,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:45:44 BoogieIcfgContainer [2019-09-07 20:45:44,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:45:44,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:45:44,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:45:44,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:45:44,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:45:38" (1/3) ... [2019-09-07 20:45:44,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2690ecbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:45:44, skipping insertion in model container [2019-09-07 20:45:44,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:45:40" (2/3) ... [2019-09-07 20:45:44,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2690ecbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:45:44, skipping insertion in model container [2019-09-07 20:45:44,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:45:44" (3/3) ... [2019-09-07 20:45:44,161 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label47.c [2019-09-07 20:45:44,172 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:45:44,185 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:45:44,204 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:45:44,241 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:45:44,242 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:45:44,242 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:45:44,242 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:45:44,242 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:45:44,243 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:45:44,243 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:45:44,243 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:45:44,243 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:45:44,274 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-09-07 20:45:44,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 20:45:44,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:45:44,281 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:45:44,284 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:45:44,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:45:44,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1707794149, now seen corresponding path program 1 times [2019-09-07 20:45:44,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:45:44,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:45:44,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:44,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:45:44,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:44,494 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 20:45:44,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:45:44,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:45:44,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:45:44,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:45:44,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:45:44,522 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 3 states. [2019-09-07 20:45:47,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:45:47,762 INFO L93 Difference]: Finished difference Result 1185 states and 2143 transitions. [2019-09-07 20:45:47,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:45:47,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 20:45:47,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:45:47,787 INFO L225 Difference]: With dead ends: 1185 [2019-09-07 20:45:47,787 INFO L226 Difference]: Without dead ends: 685 [2019-09-07 20:45:47,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 20:45:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-09-07 20:45:47,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 683. [2019-09-07 20:45:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2019-09-07 20:45:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1004 transitions. [2019-09-07 20:45:47,892 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1004 transitions. Word has length 15 [2019-09-07 20:45:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:45:47,893 INFO L475 AbstractCegarLoop]: Abstraction has 683 states and 1004 transitions. [2019-09-07 20:45:47,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:45:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1004 transitions. [2019-09-07 20:45:47,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 20:45:47,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:45:47,898 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 20:45:47,899 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:45:47,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:45:47,899 INFO L82 PathProgramCache]: Analyzing trace with hash -581258366, now seen corresponding path program 1 times [2019-09-07 20:45:47,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:45:47,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:45:47,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:47,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:45:47,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:45:48,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:45:48,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:45:48,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:45:48,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:45:48,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:45:48,141 INFO L87 Difference]: Start difference. First operand 683 states and 1004 transitions. Second operand 4 states. [2019-09-07 20:45:53,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:45:53,283 INFO L93 Difference]: Finished difference Result 2606 states and 3869 transitions. [2019-09-07 20:45:53,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:45:53,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-07 20:45:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:45:53,297 INFO L225 Difference]: With dead ends: 2606 [2019-09-07 20:45:53,297 INFO L226 Difference]: Without dead ends: 1929 [2019-09-07 20:45:53,300 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 20:45:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2019-09-07 20:45:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1924. [2019-09-07 20:45:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-09-07 20:45:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2576 transitions. [2019-09-07 20:45:53,385 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2576 transitions. Word has length 84 [2019-09-07 20:45:53,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:45:53,386 INFO L475 AbstractCegarLoop]: Abstraction has 1924 states and 2576 transitions. [2019-09-07 20:45:53,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:45:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2576 transitions. [2019-09-07 20:45:53,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-07 20:45:53,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:45:53,403 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:45:53,403 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:45:53,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:45:53,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1513418889, now seen corresponding path program 1 times [2019-09-07 20:45:53,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:45:53,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:45:53,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:53,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:45:53,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:45:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:53,888 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 19 proven. 87 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 20:45:53,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:45:53,889 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 20:45:53,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:45:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:45:53,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 20:45:53,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:45:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-07 20:45:54,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:45:54,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-07 20:45:54,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:45:54,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:45:54,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:45:54,199 INFO L87 Difference]: Start difference. First operand 1924 states and 2576 transitions. Second operand 11 states. [2019-09-07 20:46:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:08,171 INFO L93 Difference]: Finished difference Result 10161 states and 15249 transitions. [2019-09-07 20:46:08,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 20:46:08,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 233 [2019-09-07 20:46:08,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:08,239 INFO L225 Difference]: With dead ends: 10161 [2019-09-07 20:46:08,241 INFO L226 Difference]: Without dead ends: 8243 [2019-09-07 20:46:08,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=709, Invalid=2831, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 20:46:08,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8243 states. [2019-09-07 20:46:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8243 to 8017. [2019-09-07 20:46:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8017 states. [2019-09-07 20:46:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8017 states to 8017 states and 9851 transitions. [2019-09-07 20:46:08,677 INFO L78 Accepts]: Start accepts. Automaton has 8017 states and 9851 transitions. Word has length 233 [2019-09-07 20:46:08,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:08,680 INFO L475 AbstractCegarLoop]: Abstraction has 8017 states and 9851 transitions. [2019-09-07 20:46:08,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:46:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 8017 states and 9851 transitions. [2019-09-07 20:46:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-07 20:46:08,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:08,691 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:46:08,692 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:08,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:08,693 INFO L82 PathProgramCache]: Analyzing trace with hash 264638278, now seen corresponding path program 1 times [2019-09-07 20:46:08,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:08,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:08,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:08,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:08,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 98 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:46:09,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:46:09,037 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 20:46:09,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:09,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:46:09,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:46:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 98 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:46:09,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:46:09,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:46:09,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:46:09,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:46:09,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:46:09,301 INFO L87 Difference]: Start difference. First operand 8017 states and 9851 transitions. Second operand 9 states. [2019-09-07 20:46:17,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:17,072 INFO L93 Difference]: Finished difference Result 19852 states and 26583 transitions. [2019-09-07 20:46:17,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 20:46:17,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 301 [2019-09-07 20:46:17,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:17,132 INFO L225 Difference]: With dead ends: 19852 [2019-09-07 20:46:17,133 INFO L226 Difference]: Without dead ends: 12148 [2019-09-07 20:46:17,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:46:17,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12148 states. [2019-09-07 20:46:17,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12148 to 11782. [2019-09-07 20:46:17,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11782 states. [2019-09-07 20:46:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11782 states to 11782 states and 14773 transitions. [2019-09-07 20:46:17,498 INFO L78 Accepts]: Start accepts. Automaton has 11782 states and 14773 transitions. Word has length 301 [2019-09-07 20:46:17,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:17,500 INFO L475 AbstractCegarLoop]: Abstraction has 11782 states and 14773 transitions. [2019-09-07 20:46:17,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:46:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 11782 states and 14773 transitions. [2019-09-07 20:46:17,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-07 20:46:17,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:17,506 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:46:17,506 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:17,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:17,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1192857223, now seen corresponding path program 1 times [2019-09-07 20:46:17,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:17,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:17,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:17,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:17,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-07 20:46:17,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:46:17,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:46:17,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:46:17,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:46:17,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:46:17,698 INFO L87 Difference]: Start difference. First operand 11782 states and 14773 transitions. Second operand 3 states. [2019-09-07 20:46:20,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:20,443 INFO L93 Difference]: Finished difference Result 26058 states and 33473 transitions. [2019-09-07 20:46:20,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:46:20,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-07 20:46:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:20,518 INFO L225 Difference]: With dead ends: 26058 [2019-09-07 20:46:20,518 INFO L226 Difference]: Without dead ends: 14589 [2019-09-07 20:46:20,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:46:20,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14589 states. [2019-09-07 20:46:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14589 to 13345. [2019-09-07 20:46:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13345 states. [2019-09-07 20:46:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13345 states to 13345 states and 16648 transitions. [2019-09-07 20:46:20,932 INFO L78 Accepts]: Start accepts. Automaton has 13345 states and 16648 transitions. Word has length 310 [2019-09-07 20:46:20,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:20,932 INFO L475 AbstractCegarLoop]: Abstraction has 13345 states and 16648 transitions. [2019-09-07 20:46:20,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:46:20,933 INFO L276 IsEmpty]: Start isEmpty. Operand 13345 states and 16648 transitions. [2019-09-07 20:46:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-07 20:46:20,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:20,939 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:46:20,939 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:20,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:20,940 INFO L82 PathProgramCache]: Analyzing trace with hash 183229224, now seen corresponding path program 1 times [2019-09-07 20:46:20,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:20,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:20,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:20,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:20,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 20:46:21,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:46:21,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:46:21,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:46:21,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:46:21,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:46:21,208 INFO L87 Difference]: Start difference. First operand 13345 states and 16648 transitions. Second operand 4 states. [2019-09-07 20:46:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:26,453 INFO L93 Difference]: Finished difference Result 31537 states and 41444 transitions. [2019-09-07 20:46:26,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:46:26,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-07 20:46:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:26,524 INFO L225 Difference]: With dead ends: 31537 [2019-09-07 20:46:26,525 INFO L226 Difference]: Without dead ends: 18505 [2019-09-07 20:46:26,571 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 20:46:26,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18505 states. [2019-09-07 20:46:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18505 to 18496. [2019-09-07 20:46:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18496 states. [2019-09-07 20:46:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18496 states to 18496 states and 24256 transitions. [2019-09-07 20:46:27,165 INFO L78 Accepts]: Start accepts. Automaton has 18496 states and 24256 transitions. Word has length 326 [2019-09-07 20:46:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:27,166 INFO L475 AbstractCegarLoop]: Abstraction has 18496 states and 24256 transitions. [2019-09-07 20:46:27,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:46:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 18496 states and 24256 transitions. [2019-09-07 20:46:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-09-07 20:46:27,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:27,176 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:46:27,177 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:27,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:27,177 INFO L82 PathProgramCache]: Analyzing trace with hash -355969740, now seen corresponding path program 1 times [2019-09-07 20:46:27,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:27,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:27,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:27,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:27,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 177 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 20:46:27,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:46:27,566 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 20:46:27,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:27,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:46:27,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:46:27,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:46:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-07 20:46:28,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:46:28,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:46:28,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:46:28,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:46:28,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:46:28,124 INFO L87 Difference]: Start difference. First operand 18496 states and 24256 transitions. Second operand 9 states. [2019-09-07 20:46:35,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:35,298 INFO L93 Difference]: Finished difference Result 44970 states and 62221 transitions. [2019-09-07 20:46:35,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 20:46:35,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 402 [2019-09-07 20:46:35,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:35,397 INFO L225 Difference]: With dead ends: 44970 [2019-09-07 20:46:35,397 INFO L226 Difference]: Without dead ends: 26787 [2019-09-07 20:46:35,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-09-07 20:46:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26787 states. [2019-09-07 20:46:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26787 to 23587. [2019-09-07 20:46:35,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23587 states. [2019-09-07 20:46:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23587 states to 23587 states and 32533 transitions. [2019-09-07 20:46:36,045 INFO L78 Accepts]: Start accepts. Automaton has 23587 states and 32533 transitions. Word has length 402 [2019-09-07 20:46:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:36,046 INFO L475 AbstractCegarLoop]: Abstraction has 23587 states and 32533 transitions. [2019-09-07 20:46:36,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:46:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 23587 states and 32533 transitions. [2019-09-07 20:46:36,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-09-07 20:46:36,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:36,063 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:46:36,063 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:36,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:36,064 INFO L82 PathProgramCache]: Analyzing trace with hash -967018293, now seen corresponding path program 1 times [2019-09-07 20:46:36,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:36,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:36,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:36,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:36,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-09-07 20:46:37,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:46:37,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:46:37,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:46:37,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:46:37,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:46:37,309 INFO L87 Difference]: Start difference. First operand 23587 states and 32533 transitions. Second operand 4 states. [2019-09-07 20:46:42,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:42,643 INFO L93 Difference]: Finished difference Result 63208 states and 90874 transitions. [2019-09-07 20:46:42,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:46:42,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 549 [2019-09-07 20:46:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:42,782 INFO L225 Difference]: With dead ends: 63208 [2019-09-07 20:46:42,782 INFO L226 Difference]: Without dead ends: 39934 [2019-09-07 20:46:42,836 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 20:46:42,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39934 states. [2019-09-07 20:46:43,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39934 to 35199. [2019-09-07 20:46:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35199 states. [2019-09-07 20:46:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35199 states to 35199 states and 51013 transitions. [2019-09-07 20:46:43,662 INFO L78 Accepts]: Start accepts. Automaton has 35199 states and 51013 transitions. Word has length 549 [2019-09-07 20:46:43,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:43,663 INFO L475 AbstractCegarLoop]: Abstraction has 35199 states and 51013 transitions. [2019-09-07 20:46:43,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:46:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 35199 states and 51013 transitions. [2019-09-07 20:46:43,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2019-09-07 20:46:43,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:43,696 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:46:43,696 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:43,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:43,697 INFO L82 PathProgramCache]: Analyzing trace with hash -982291225, now seen corresponding path program 1 times [2019-09-07 20:46:43,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:43,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:43,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:43,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:43,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:44,556 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 433 proven. 2 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-09-07 20:46:44,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:46:44,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:46:44,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:44,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:46:44,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:46:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 433 proven. 2 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-09-07 20:46:44,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:46:44,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:46:44,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:46:44,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:46:44,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:46:44,914 INFO L87 Difference]: Start difference. First operand 35199 states and 51013 transitions. Second operand 9 states. [2019-09-07 20:46:50,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:50,658 INFO L93 Difference]: Finished difference Result 71127 states and 104257 transitions. [2019-09-07 20:46:50,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 20:46:50,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 621 [2019-09-07 20:46:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:50,796 INFO L225 Difference]: With dead ends: 71127 [2019-09-07 20:46:50,796 INFO L226 Difference]: Without dead ends: 36241 [2019-09-07 20:46:50,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:46:50,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36241 states. [2019-09-07 20:46:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36241 to 34099. [2019-09-07 20:46:51,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34099 states. [2019-09-07 20:46:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34099 states to 34099 states and 42535 transitions. [2019-09-07 20:46:51,944 INFO L78 Accepts]: Start accepts. Automaton has 34099 states and 42535 transitions. Word has length 621 [2019-09-07 20:46:51,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:51,945 INFO L475 AbstractCegarLoop]: Abstraction has 34099 states and 42535 transitions. [2019-09-07 20:46:51,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:46:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 34099 states and 42535 transitions. [2019-09-07 20:46:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2019-09-07 20:46:51,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:51,973 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:46:51,973 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:51,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:51,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2078734511, now seen corresponding path program 1 times [2019-09-07 20:46:51,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:51,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:51,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:51,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:51,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 278 proven. 126 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2019-09-07 20:46:52,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:46:52,431 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 20:46:52,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:52,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:46:52,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:46:52,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:52,872 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 20 [2019-09-07 20:46:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 400 proven. 2 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-07 20:46:53,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:46:53,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-07 20:46:53,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:46:53,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:46:53,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:46:53,666 INFO L87 Difference]: Start difference. First operand 34099 states and 42535 transitions. Second operand 10 states. [2019-09-07 20:48:45,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:48:45,968 INFO L93 Difference]: Finished difference Result 102189 states and 127475 transitions. [2019-09-07 20:48:45,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-07 20:48:45,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 655 [2019-09-07 20:48:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:48:46,103 INFO L225 Difference]: With dead ends: 102189 [2019-09-07 20:48:46,103 INFO L226 Difference]: Without dead ends: 60803 [2019-09-07 20:48:46,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=539, Invalid=3001, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 20:48:46,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60803 states. [2019-09-07 20:48:46,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60803 to 49681. [2019-09-07 20:48:46,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49681 states. [2019-09-07 20:48:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49681 states to 49681 states and 56360 transitions. [2019-09-07 20:48:47,007 INFO L78 Accepts]: Start accepts. Automaton has 49681 states and 56360 transitions. Word has length 655 [2019-09-07 20:48:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:48:47,008 INFO L475 AbstractCegarLoop]: Abstraction has 49681 states and 56360 transitions. [2019-09-07 20:48:47,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 20:48:47,008 INFO L276 IsEmpty]: Start isEmpty. Operand 49681 states and 56360 transitions. [2019-09-07 20:48:47,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2019-09-07 20:48:47,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:48:47,035 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:48:47,035 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:48:47,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:48:47,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1717377022, now seen corresponding path program 1 times [2019-09-07 20:48:47,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:48:47,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:48:47,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:48:47,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:48:47,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:48:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:48:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 328 proven. 2 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-09-07 20:48:48,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:48:48,690 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:48:48,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:48:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:48:48,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 926 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 20:48:48,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:48:48,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:48:48,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:48:51,125 WARN L188 SmtUtils]: Spent 2.20 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-07 20:48:51,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:48:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 46 proven. 10 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2019-09-07 20:48:53,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:48:53,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 9 [2019-09-07 20:48:53,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:48:53,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:48:53,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=50, Unknown=1, NotChecked=0, Total=72 [2019-09-07 20:48:53,380 INFO L87 Difference]: Start difference. First operand 49681 states and 56360 transitions. Second operand 9 states. [2019-09-07 20:48:56,441 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 34 DAG size of output: 17 [2019-09-07 20:49:16,122 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2019-09-07 20:50:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:50:14,452 INFO L93 Difference]: Finished difference Result 111330 states and 126529 transitions. [2019-09-07 20:50:14,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 20:50:14,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 668 [2019-09-07 20:50:14,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:50:14,551 INFO L225 Difference]: With dead ends: 111330 [2019-09-07 20:50:14,552 INFO L226 Difference]: Without dead ends: 63479 [2019-09-07 20:50:14,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 675 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=108, Invalid=271, Unknown=1, NotChecked=0, Total=380 [2019-09-07 20:50:14,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63479 states. [2019-09-07 20:50:15,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63479 to 58780. [2019-09-07 20:50:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58780 states. [2019-09-07 20:50:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58780 states to 58780 states and 64878 transitions. [2019-09-07 20:50:15,548 INFO L78 Accepts]: Start accepts. Automaton has 58780 states and 64878 transitions. Word has length 668 [2019-09-07 20:50:15,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:50:15,549 INFO L475 AbstractCegarLoop]: Abstraction has 58780 states and 64878 transitions. [2019-09-07 20:50:15,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:50:15,549 INFO L276 IsEmpty]: Start isEmpty. Operand 58780 states and 64878 transitions. [2019-09-07 20:50:15,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2019-09-07 20:50:15,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:50:15,576 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:50:15,576 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:50:15,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:50:15,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1216900585, now seen corresponding path program 1 times [2019-09-07 20:50:15,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:50:15,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:50:15,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:50:15,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:50:15,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:50:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:50:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 29 proven. 251 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-07 20:50:17,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:50:17,347 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 20:50:17,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:50:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:50:17,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:50:17,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:50:17,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:50:17,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:50:17,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:50:17,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:50:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 20:50:18,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:50:18,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-09-07 20:50:18,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:50:18,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:50:18,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:50:18,406 INFO L87 Difference]: Start difference. First operand 58780 states and 64878 transitions. Second operand 10 states. [2019-09-07 20:50:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:50:24,857 INFO L93 Difference]: Finished difference Result 120823 states and 133549 transitions. [2019-09-07 20:50:24,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 20:50:24,858 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 695 [2019-09-07 20:50:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:50:24,991 INFO L225 Difference]: With dead ends: 120823 [2019-09-07 20:50:24,991 INFO L226 Difference]: Without dead ends: 62356 [2019-09-07 20:50:25,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 706 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2019-09-07 20:50:25,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62356 states. [2019-09-07 20:50:25,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62356 to 56095. [2019-09-07 20:50:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56095 states. [2019-09-07 20:50:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56095 states to 56095 states and 60700 transitions. [2019-09-07 20:50:26,031 INFO L78 Accepts]: Start accepts. Automaton has 56095 states and 60700 transitions. Word has length 695 [2019-09-07 20:50:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:50:26,032 INFO L475 AbstractCegarLoop]: Abstraction has 56095 states and 60700 transitions. [2019-09-07 20:50:26,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 20:50:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 56095 states and 60700 transitions. [2019-09-07 20:50:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2019-09-07 20:50:26,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:50:26,047 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:50:26,047 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:50:26,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:50:26,047 INFO L82 PathProgramCache]: Analyzing trace with hash -741537992, now seen corresponding path program 1 times [2019-09-07 20:50:26,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:50:26,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:50:26,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:50:26,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:50:26,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:50:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:50:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 211 proven. 85 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2019-09-07 20:50:27,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:50:27,774 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 20:50:27,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:50:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:50:27,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:50:27,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:50:28,208 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 571 proven. 2 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-09-07 20:50:28,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:50:28,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:50:28,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:50:28,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:50:28,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:50:28,215 INFO L87 Difference]: Start difference. First operand 56095 states and 60700 transitions. Second operand 9 states. [2019-09-07 20:50:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:50:31,951 INFO L93 Difference]: Finished difference Result 111582 states and 120813 transitions. [2019-09-07 20:50:31,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 20:50:31,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 713 [2019-09-07 20:50:31,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:50:32,044 INFO L225 Difference]: With dead ends: 111582 [2019-09-07 20:50:32,045 INFO L226 Difference]: Without dead ends: 56111 [2019-09-07 20:50:32,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:50:32,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56111 states. [2019-09-07 20:50:32,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56111 to 53332. [2019-09-07 20:50:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53332 states. [2019-09-07 20:50:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53332 states to 53332 states and 56722 transitions. [2019-09-07 20:50:32,832 INFO L78 Accepts]: Start accepts. Automaton has 53332 states and 56722 transitions. Word has length 713 [2019-09-07 20:50:32,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:50:32,833 INFO L475 AbstractCegarLoop]: Abstraction has 53332 states and 56722 transitions. [2019-09-07 20:50:32,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:50:32,833 INFO L276 IsEmpty]: Start isEmpty. Operand 53332 states and 56722 transitions. [2019-09-07 20:50:32,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2019-09-07 20:50:32,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:50:32,856 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:50:32,856 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:50:32,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:50:32,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1588955464, now seen corresponding path program 1 times [2019-09-07 20:50:32,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:50:32,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:50:32,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:50:32,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:50:32,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:50:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:50:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2019-09-07 20:50:33,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:50:33,402 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 20:50:33,417 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 20:50:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:50:33,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 20:50:33,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:50:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 403 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2019-09-07 20:50:33,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:50:33,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 20:50:33,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:50:33,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:50:33,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:50:33,844 INFO L87 Difference]: Start difference. First operand 53332 states and 56722 transitions. Second operand 3 states. [2019-09-07 20:50:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:50:36,252 INFO L93 Difference]: Finished difference Result 121497 states and 129323 transitions. [2019-09-07 20:50:36,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:50:36,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 714 [2019-09-07 20:50:36,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:50:36,378 INFO L225 Difference]: With dead ends: 121497 [2019-09-07 20:50:36,378 INFO L226 Difference]: Without dead ends: 68789 [2019-09-07 20:50:36,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 714 SyntacticMatches, 1 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 20:50:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68789 states. [2019-09-07 20:50:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68789 to 61343. [2019-09-07 20:50:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61343 states. [2019-09-07 20:50:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61343 states to 61343 states and 64937 transitions. [2019-09-07 20:50:37,150 INFO L78 Accepts]: Start accepts. Automaton has 61343 states and 64937 transitions. Word has length 714 [2019-09-07 20:50:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:50:37,151 INFO L475 AbstractCegarLoop]: Abstraction has 61343 states and 64937 transitions. [2019-09-07 20:50:37,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:50:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 61343 states and 64937 transitions. [2019-09-07 20:50:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2019-09-07 20:50:37,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:50:37,164 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:50:37,165 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:50:37,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:50:37,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2048153584, now seen corresponding path program 1 times [2019-09-07 20:50:37,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:50:37,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:50:37,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:50:37,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:50:37,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:50:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:50:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 43 proven. 646 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-07 20:50:38,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:50:38,595 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 20:50:38,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:50:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:50:38,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 20:50:38,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:50:38,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:50:38,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:50:38,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:50:38,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:50:38,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:50:39,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:50:39,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:50:39,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:50:39,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 20:50:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 581 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-07 20:50:39,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:50:39,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-09-07 20:50:39,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 20:50:39,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 20:50:39,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:50:39,722 INFO L87 Difference]: Start difference. First operand 61343 states and 64937 transitions. Second operand 18 states. [2019-09-07 20:50:45,880 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-07 20:50:49,428 WARN L188 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-07 20:50:55,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:50:55,237 INFO L93 Difference]: Finished difference Result 128026 states and 135567 transitions. [2019-09-07 20:50:55,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-07 20:50:55,239 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 718 [2019-09-07 20:50:55,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:50:55,355 INFO L225 Difference]: With dead ends: 128026 [2019-09-07 20:50:55,356 INFO L226 Difference]: Without dead ends: 68854 [2019-09-07 20:50:55,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 863 GetRequests, 771 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3114 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1497, Invalid=7245, Unknown=0, NotChecked=0, Total=8742 [2019-09-07 20:50:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68854 states. [2019-09-07 20:50:56,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68854 to 64785. [2019-09-07 20:50:56,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64785 states. [2019-09-07 20:50:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64785 states to 64785 states and 68527 transitions. [2019-09-07 20:50:56,171 INFO L78 Accepts]: Start accepts. Automaton has 64785 states and 68527 transitions. Word has length 718 [2019-09-07 20:50:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:50:56,172 INFO L475 AbstractCegarLoop]: Abstraction has 64785 states and 68527 transitions. [2019-09-07 20:50:56,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 20:50:56,172 INFO L276 IsEmpty]: Start isEmpty. Operand 64785 states and 68527 transitions. [2019-09-07 20:50:56,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2019-09-07 20:50:56,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:50:56,184 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:50:56,184 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:50:56,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:50:56,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1954390366, now seen corresponding path program 1 times [2019-09-07 20:50:56,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:50:56,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:50:56,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:50:56,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:50:56,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:50:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:50:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 427 proven. 7 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2019-09-07 20:50:56,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:50:56,742 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:50:56,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:50:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:50:57,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:50:57,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:50:57,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:50:57,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:50:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 432 proven. 2 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2019-09-07 20:50:57,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:50:57,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:50:57,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:50:57,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:50:57,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:50:57,605 INFO L87 Difference]: Start difference. First operand 64785 states and 68527 transitions. Second operand 9 states. [2019-09-07 20:51:07,454 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-09-07 20:51:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:51:09,259 INFO L93 Difference]: Finished difference Result 148281 states and 156781 transitions. [2019-09-07 20:51:09,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 20:51:09,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 736 [2019-09-07 20:51:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:51:09,393 INFO L225 Difference]: With dead ends: 148281 [2019-09-07 20:51:09,394 INFO L226 Difference]: Without dead ends: 86594 [2019-09-07 20:51:09,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 774 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=412, Invalid=1940, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 20:51:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86594 states. [2019-09-07 20:51:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86594 to 76973. [2019-09-07 20:51:11,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76973 states. [2019-09-07 20:51:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76973 states to 76973 states and 81058 transitions. [2019-09-07 20:51:11,825 INFO L78 Accepts]: Start accepts. Automaton has 76973 states and 81058 transitions. Word has length 736 [2019-09-07 20:51:11,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:51:11,825 INFO L475 AbstractCegarLoop]: Abstraction has 76973 states and 81058 transitions. [2019-09-07 20:51:11,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:51:11,826 INFO L276 IsEmpty]: Start isEmpty. Operand 76973 states and 81058 transitions. [2019-09-07 20:51:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2019-09-07 20:51:11,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:51:11,845 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-09-07 20:51:11,845 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:51:11,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:51:11,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1882831684, now seen corresponding path program 1 times [2019-09-07 20:51:11,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:51:11,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:51:11,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:51:11,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:51:11,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:51:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:51:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 413 proven. 2 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 20:51:12,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:51:12,486 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 20:51:12,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:51:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:51:12,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:51:12,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:51:13,218 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 413 proven. 2 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 20:51:13,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:51:13,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 20:51:13,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:51:13,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:51:13,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:51:13,228 INFO L87 Difference]: Start difference. First operand 76973 states and 81058 transitions. Second operand 7 states. [2019-09-07 20:51:17,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:51:17,737 INFO L93 Difference]: Finished difference Result 157264 states and 166136 transitions. [2019-09-07 20:51:17,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 20:51:17,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 811 [2019-09-07 20:51:17,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:51:17,868 INFO L225 Difference]: With dead ends: 157264 [2019-09-07 20:51:17,868 INFO L226 Difference]: Without dead ends: 83389 [2019-09-07 20:51:17,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 815 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:51:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83389 states. [2019-09-07 20:51:18,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83389 to 80385. [2019-09-07 20:51:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80385 states. [2019-09-07 20:51:18,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80385 states to 80385 states and 84603 transitions. [2019-09-07 20:51:18,826 INFO L78 Accepts]: Start accepts. Automaton has 80385 states and 84603 transitions. Word has length 811 [2019-09-07 20:51:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:51:18,826 INFO L475 AbstractCegarLoop]: Abstraction has 80385 states and 84603 transitions. [2019-09-07 20:51:18,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:51:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 80385 states and 84603 transitions. [2019-09-07 20:51:18,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2019-09-07 20:51:18,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:51:18,840 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:51:18,840 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:51:18,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:51:18,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1677276299, now seen corresponding path program 1 times [2019-09-07 20:51:18,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:51:18,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:51:18,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:51:18,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:51:18,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:51:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:51:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2019-09-07 20:51:21,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:51:21,118 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 20:51:21,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:51:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:51:21,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:51:21,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:51:21,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:51:22,224 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 439 proven. 2 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2019-09-07 20:51:22,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:51:22,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 13 [2019-09-07 20:51:22,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:51:22,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:51:22,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=120, Unknown=1, NotChecked=0, Total=156 [2019-09-07 20:51:22,232 INFO L87 Difference]: Start difference. First operand 80385 states and 84603 transitions. Second operand 13 states. [2019-09-07 20:51:32,681 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-09-07 20:51:36,001 WARN L188 SmtUtils]: Spent 924.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-09-07 20:51:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:51:39,429 INFO L93 Difference]: Finished difference Result 195860 states and 206412 transitions. [2019-09-07 20:51:39,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 20:51:39,430 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 815 [2019-09-07 20:51:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:51:39,649 INFO L225 Difference]: With dead ends: 195860 [2019-09-07 20:51:39,649 INFO L226 Difference]: Without dead ends: 116715 [2019-09-07 20:51:39,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 840 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=398, Invalid=1490, Unknown=4, NotChecked=0, Total=1892 [2019-09-07 20:51:39,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116715 states. [2019-09-07 20:51:40,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116715 to 92863. [2019-09-07 20:51:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92863 states. [2019-09-07 20:51:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92863 states to 92863 states and 97474 transitions. [2019-09-07 20:51:40,989 INFO L78 Accepts]: Start accepts. Automaton has 92863 states and 97474 transitions. Word has length 815 [2019-09-07 20:51:40,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:51:40,990 INFO L475 AbstractCegarLoop]: Abstraction has 92863 states and 97474 transitions. [2019-09-07 20:51:40,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:51:40,990 INFO L276 IsEmpty]: Start isEmpty. Operand 92863 states and 97474 transitions. [2019-09-07 20:51:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2019-09-07 20:51:41,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:51:41,001 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:51:41,001 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:51:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:51:41,002 INFO L82 PathProgramCache]: Analyzing trace with hash 742251134, now seen corresponding path program 1 times [2019-09-07 20:51:41,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:51:41,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:51:41,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:51:41,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:51:41,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:51:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 20:51:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 20:51:41,433 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Int term has non-integral value at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInTermValues(ModelBuilder.java:93) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:66) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:745) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:108) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1221) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1090) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.getValues(SmtUtils.java:1813) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getValue(TraceCheck.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:344) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-07 20:51:41,438 INFO L168 Benchmark]: Toolchain (without parser) took 362585.87 ms. Allocated memory was 139.5 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 81.1 MB in the beginning and 372.5 MB in the end (delta: -291.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-09-07 20:51:41,439 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 104.4 MB in the beginning and 104.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 20:51:41,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1539.74 ms. Allocated memory was 139.5 MB in the beginning and 226.0 MB in the end (delta: 86.5 MB). Free memory was 80.9 MB in the beginning and 163.1 MB in the end (delta: -82.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. [2019-09-07 20:51:41,445 INFO L168 Benchmark]: Boogie Preprocessor took 212.07 ms. Allocated memory is still 226.0 MB. Free memory was 163.1 MB in the beginning and 150.8 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-09-07 20:51:41,447 INFO L168 Benchmark]: RCFGBuilder took 3544.11 ms. Allocated memory was 226.0 MB in the beginning and 276.3 MB in the end (delta: 50.3 MB). Free memory was 150.8 MB in the beginning and 183.4 MB in the end (delta: -32.6 MB). Peak memory consumption was 124.2 MB. Max. memory is 7.1 GB. [2019-09-07 20:51:41,448 INFO L168 Benchmark]: TraceAbstraction took 357285.33 ms. Allocated memory was 276.3 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 183.4 MB in the beginning and 372.5 MB in the end (delta: -189.2 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-09-07 20:51:41,459 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 104.4 MB in the beginning and 104.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1539.74 ms. Allocated memory was 139.5 MB in the beginning and 226.0 MB in the end (delta: 86.5 MB). Free memory was 80.9 MB in the beginning and 163.1 MB in the end (delta: -82.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 212.07 ms. Allocated memory is still 226.0 MB. Free memory was 163.1 MB in the beginning and 150.8 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3544.11 ms. Allocated memory was 226.0 MB in the beginning and 276.3 MB in the end (delta: 50.3 MB). Free memory was 150.8 MB in the beginning and 183.4 MB in the end (delta: -32.6 MB). Peak memory consumption was 124.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 357285.33 ms. Allocated memory was 276.3 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 183.4 MB in the beginning and 372.5 MB in the end (delta: -189.2 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Int term has non-integral value de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Int term has non-integral value: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInTermValues(ModelBuilder.java:93) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...