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/Problem18_label33.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 22:36:07,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 22:36:07,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 22:36:07,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 22:36:07,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 22:36:07,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 22:36:07,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 22:36:07,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 22:36:07,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 22:36:07,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 22:36:07,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 22:36:07,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 22:36:07,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 22:36:07,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 22:36:07,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 22:36:07,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 22:36:07,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 22:36:07,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 22:36:07,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 22:36:08,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 22:36:08,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 22:36:08,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 22:36:08,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 22:36:08,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 22:36:08,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 22:36:08,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 22:36:08,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 22:36:08,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 22:36:08,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 22:36:08,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 22:36:08,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 22:36:08,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 22:36:08,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 22:36:08,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 22:36:08,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 22:36:08,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 22:36:08,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 22:36:08,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 22:36:08,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 22:36:08,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 22:36:08,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 22:36:08,020 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 22:36:08,050 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 22:36:08,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 22:36:08,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 22:36:08,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 22:36:08,052 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 22:36:08,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 22:36:08,053 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 22:36:08,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 22:36:08,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 22:36:08,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 22:36:08,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 22:36:08,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 22:36:08,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 22:36:08,056 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 22:36:08,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 22:36:08,056 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 22:36:08,056 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 22:36:08,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 22:36:08,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 22:36:08,057 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 22:36:08,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 22:36:08,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 22:36:08,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 22:36:08,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 22:36:08,058 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 22:36:08,058 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 22:36:08,059 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 22:36:08,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 22:36:08,059 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 22:36:08,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 22:36:08,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 22:36:08,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 22:36:08,136 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 22:36:08,137 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 22:36:08,138 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label33.c [2019-09-07 22:36:08,210 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3be0644b2/b4b3a07bc3f74b329504175fe2d66991/FLAGfa0ea5496 [2019-09-07 22:36:08,936 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 22:36:08,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label33.c [2019-09-07 22:36:08,971 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3be0644b2/b4b3a07bc3f74b329504175fe2d66991/FLAGfa0ea5496 [2019-09-07 22:36:09,062 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3be0644b2/b4b3a07bc3f74b329504175fe2d66991 [2019-09-07 22:36:09,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 22:36:09,076 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 22:36:09,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 22:36:09,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 22:36:09,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 22:36:09,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:36:09" (1/1) ... [2019-09-07 22:36:09,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a3b942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:09, skipping insertion in model container [2019-09-07 22:36:09,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:36:09" (1/1) ... [2019-09-07 22:36:09,095 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 22:36:09,223 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 22:36:10,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:36:10,339 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 22:36:10,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:36:10,933 INFO L192 MainTranslator]: Completed translation [2019-09-07 22:36:10,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:10 WrapperNode [2019-09-07 22:36:10,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 22:36:10,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 22:36:10,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 22:36:10,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 22:36:10,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:10" (1/1) ... [2019-09-07 22:36:10,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:10" (1/1) ... [2019-09-07 22:36:11,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:10" (1/1) ... [2019-09-07 22:36:11,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:10" (1/1) ... [2019-09-07 22:36:11,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:10" (1/1) ... [2019-09-07 22:36:11,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:10" (1/1) ... [2019-09-07 22:36:11,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:10" (1/1) ... [2019-09-07 22:36:11,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 22:36:11,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 22:36:11,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 22:36:11,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 22:36:11,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:10" (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 22:36:11,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 22:36:11,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 22:36:11,372 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 22:36:11,372 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 22:36:11,372 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 22:36:11,372 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 22:36:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 22:36:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 22:36:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 22:36:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 22:36:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 22:36:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 22:36:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 22:36:11,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 22:36:11,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 22:36:15,682 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 22:36:15,682 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 22:36:15,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:36:15 BoogieIcfgContainer [2019-09-07 22:36:15,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 22:36:15,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 22:36:15,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 22:36:15,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 22:36:15,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:36:09" (1/3) ... [2019-09-07 22:36:15,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58db1d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:36:15, skipping insertion in model container [2019-09-07 22:36:15,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:36:10" (2/3) ... [2019-09-07 22:36:15,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58db1d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:36:15, skipping insertion in model container [2019-09-07 22:36:15,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:36:15" (3/3) ... [2019-09-07 22:36:15,697 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem18_label33.c [2019-09-07 22:36:15,710 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 22:36:15,721 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 22:36:15,740 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 22:36:15,798 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 22:36:15,799 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 22:36:15,799 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 22:36:15,799 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 22:36:15,799 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 22:36:15,799 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 22:36:15,800 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 22:36:15,800 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 22:36:15,800 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 22:36:15,845 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states. [2019-09-07 22:36:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 22:36:15,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:36:15,855 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:36:15,857 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:36:15,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:36:15,864 INFO L82 PathProgramCache]: Analyzing trace with hash -666712142, now seen corresponding path program 1 times [2019-09-07 22:36:15,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:36:15,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:36:15,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:15,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:15,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:16,212 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 22:36:16,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:36:16,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:36:16,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:36:16,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:36:16,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:36:16,239 INFO L87 Difference]: Start difference. First operand 774 states. Second operand 3 states. [2019-09-07 22:36:20,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:36:20,786 INFO L93 Difference]: Finished difference Result 2248 states and 4319 transitions. [2019-09-07 22:36:20,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:36:20,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-07 22:36:20,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:36:20,820 INFO L225 Difference]: With dead ends: 2248 [2019-09-07 22:36:20,821 INFO L226 Difference]: Without dead ends: 1412 [2019-09-07 22:36:20,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 22:36:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2019-09-07 22:36:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2019-09-07 22:36:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-09-07 22:36:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2630 transitions. [2019-09-07 22:36:20,981 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2630 transitions. Word has length 29 [2019-09-07 22:36:20,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:36:20,982 INFO L475 AbstractCegarLoop]: Abstraction has 1412 states and 2630 transitions. [2019-09-07 22:36:20,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:36:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2630 transitions. [2019-09-07 22:36:20,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-07 22:36:20,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:36:20,988 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:20,988 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:36:20,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:36:20,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1928488255, now seen corresponding path program 1 times [2019-09-07 22:36:20,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:36:20,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:36:20,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:20,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:20,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:36:21,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:36:21,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:36:21,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:36:21,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:36:21,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:36:21,272 INFO L87 Difference]: Start difference. First operand 1412 states and 2630 transitions. Second operand 6 states. [2019-09-07 22:36:26,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:36:26,764 INFO L93 Difference]: Finished difference Result 4288 states and 8023 transitions. [2019-09-07 22:36:26,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:36:26,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-09-07 22:36:26,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:36:26,790 INFO L225 Difference]: With dead ends: 4288 [2019-09-07 22:36:26,790 INFO L226 Difference]: Without dead ends: 2882 [2019-09-07 22:36:26,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:36:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2019-09-07 22:36:26,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2858. [2019-09-07 22:36:26,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2858 states. [2019-09-07 22:36:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 5137 transitions. [2019-09-07 22:36:26,880 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 5137 transitions. Word has length 118 [2019-09-07 22:36:26,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:36:26,881 INFO L475 AbstractCegarLoop]: Abstraction has 2858 states and 5137 transitions. [2019-09-07 22:36:26,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:36:26,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 5137 transitions. [2019-09-07 22:36:26,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 22:36:26,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:36:26,891 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:26,891 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:36:26,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:36:26,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1383839650, now seen corresponding path program 1 times [2019-09-07 22:36:26,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:36:26,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:36:26,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:26,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:26,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:36:27,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:36:27,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:36:27,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:36:27,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:36:27,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:36:27,070 INFO L87 Difference]: Start difference. First operand 2858 states and 5137 transitions. Second operand 6 states. [2019-09-07 22:36:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:36:36,652 INFO L93 Difference]: Finished difference Result 11626 states and 21824 transitions. [2019-09-07 22:36:36,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 22:36:36,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-09-07 22:36:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:36:36,701 INFO L225 Difference]: With dead ends: 11626 [2019-09-07 22:36:36,701 INFO L226 Difference]: Without dead ends: 8774 [2019-09-07 22:36:36,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:36:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8774 states. [2019-09-07 22:36:36,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8774 to 8718. [2019-09-07 22:36:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8718 states. [2019-09-07 22:36:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8718 states to 8718 states and 13633 transitions. [2019-09-07 22:36:36,968 INFO L78 Accepts]: Start accepts. Automaton has 8718 states and 13633 transitions. Word has length 119 [2019-09-07 22:36:36,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:36:36,969 INFO L475 AbstractCegarLoop]: Abstraction has 8718 states and 13633 transitions. [2019-09-07 22:36:36,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:36:36,970 INFO L276 IsEmpty]: Start isEmpty. Operand 8718 states and 13633 transitions. [2019-09-07 22:36:36,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-07 22:36:36,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:36:36,974 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:36:36,974 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:36:36,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:36:36,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1243491523, now seen corresponding path program 1 times [2019-09-07 22:36:36,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:36:36,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:36:36,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:36,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:36,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 44 proven. 65 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 22:36:37,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:36:37,091 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 22:36:37,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:37,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 22:36:37,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:36:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-07 22:36:37,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:36:37,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 22:36:37,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:36:37,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:36:37,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:36:37,302 INFO L87 Difference]: Start difference. First operand 8718 states and 13633 transitions. Second operand 8 states. [2019-09-07 22:36:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:36:45,261 INFO L93 Difference]: Finished difference Result 28575 states and 46363 transitions. [2019-09-07 22:36:45,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 22:36:45,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 188 [2019-09-07 22:36:45,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:36:45,369 INFO L225 Difference]: With dead ends: 28575 [2019-09-07 22:36:45,369 INFO L226 Difference]: Without dead ends: 19863 [2019-09-07 22:36:45,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-07 22:36:45,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19863 states. [2019-09-07 22:36:45,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19863 to 19106. [2019-09-07 22:36:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19106 states. [2019-09-07 22:36:46,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19106 states to 19106 states and 25578 transitions. [2019-09-07 22:36:46,875 INFO L78 Accepts]: Start accepts. Automaton has 19106 states and 25578 transitions. Word has length 188 [2019-09-07 22:36:46,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:36:46,876 INFO L475 AbstractCegarLoop]: Abstraction has 19106 states and 25578 transitions. [2019-09-07 22:36:46,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:36:46,876 INFO L276 IsEmpty]: Start isEmpty. Operand 19106 states and 25578 transitions. [2019-09-07 22:36:46,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-07 22:36:46,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:36:46,883 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:46,884 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:36:46,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:36:46,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1231504927, now seen corresponding path program 1 times [2019-09-07 22:36:46,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:36:46,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:36:46,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:46,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:46,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 141 proven. 73 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-07 22:36:47,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:36:47,129 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 22:36:47,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:47,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:36:47,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:36:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 277 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-07 22:36:47,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:36:47,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:36:47,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:36:47,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:36:47,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:36:47,371 INFO L87 Difference]: Start difference. First operand 19106 states and 25578 transitions. Second operand 9 states. [2019-09-07 22:36:59,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:36:59,915 INFO L93 Difference]: Finished difference Result 54934 states and 85524 transitions. [2019-09-07 22:36:59,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 22:36:59,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 314 [2019-09-07 22:36:59,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:37:00,069 INFO L225 Difference]: With dead ends: 54934 [2019-09-07 22:37:00,069 INFO L226 Difference]: Without dead ends: 32480 [2019-09-07 22:37:00,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2019-09-07 22:37:00,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32480 states. [2019-09-07 22:37:01,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32480 to 30962. [2019-09-07 22:37:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30962 states. [2019-09-07 22:37:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30962 states to 30962 states and 40722 transitions. [2019-09-07 22:37:01,236 INFO L78 Accepts]: Start accepts. Automaton has 30962 states and 40722 transitions. Word has length 314 [2019-09-07 22:37:01,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:37:01,238 INFO L475 AbstractCegarLoop]: Abstraction has 30962 states and 40722 transitions. [2019-09-07 22:37:01,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:37:01,239 INFO L276 IsEmpty]: Start isEmpty. Operand 30962 states and 40722 transitions. [2019-09-07 22:37:01,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-09-07 22:37:01,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:37:01,246 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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 22:37:01,246 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:37:01,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:37:01,247 INFO L82 PathProgramCache]: Analyzing trace with hash 530072598, now seen corresponding path program 1 times [2019-09-07 22:37:01,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:37:01,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:37:01,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:01,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:01,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 156 proven. 110 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 22:37:01,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:37:01,775 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) [2019-09-07 22:37:01,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:37:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:01,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:37:01,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:37:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 247 proven. 2 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 22:37:02,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:37:02,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 22:37:02,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 22:37:02,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 22:37:02,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-07 22:37:02,016 INFO L87 Difference]: Start difference. First operand 30962 states and 40722 transitions. Second operand 11 states. [2019-09-07 22:37:12,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:37:12,373 INFO L93 Difference]: Finished difference Result 64310 states and 86794 transitions. [2019-09-07 22:37:12,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 22:37:12,373 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 347 [2019-09-07 22:37:12,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:37:12,495 INFO L225 Difference]: With dead ends: 64310 [2019-09-07 22:37:12,495 INFO L226 Difference]: Without dead ends: 35451 [2019-09-07 22:37:12,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 355 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-07 22:37:12,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35451 states. [2019-09-07 22:37:13,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35451 to 30937. [2019-09-07 22:37:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30937 states. [2019-09-07 22:37:13,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30937 states to 30937 states and 37148 transitions. [2019-09-07 22:37:13,336 INFO L78 Accepts]: Start accepts. Automaton has 30937 states and 37148 transitions. Word has length 347 [2019-09-07 22:37:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:37:13,338 INFO L475 AbstractCegarLoop]: Abstraction has 30937 states and 37148 transitions. [2019-09-07 22:37:13,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 22:37:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 30937 states and 37148 transitions. [2019-09-07 22:37:13,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2019-09-07 22:37:13,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:37:13,349 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:13,349 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:37:13,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:37:13,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1395119438, now seen corresponding path program 1 times [2019-09-07 22:37:13,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:37:13,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:37:13,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:13,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:13,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 276 proven. 21 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-07 22:37:14,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:37:14,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 22:37:14,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:37:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:14,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 22:37:14,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:37:14,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:37:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-09-07 22:37:14,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:37:14,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-07 22:37:14,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 22:37:14,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 22:37:14,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-07 22:37:14,814 INFO L87 Difference]: Start difference. First operand 30937 states and 37148 transitions. Second operand 13 states. [2019-09-07 22:37:46,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:37:46,185 INFO L93 Difference]: Finished difference Result 106077 states and 136050 transitions. [2019-09-07 22:37:46,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-07 22:37:46,185 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 407 [2019-09-07 22:37:46,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:37:46,437 INFO L225 Difference]: With dead ends: 106077 [2019-09-07 22:37:46,438 INFO L226 Difference]: Without dead ends: 75122 [2019-09-07 22:37:46,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 452 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=599, Invalid=3307, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 22:37:46,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75122 states. [2019-09-07 22:37:47,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75122 to 68385. [2019-09-07 22:37:47,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68385 states. [2019-09-07 22:37:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68385 states to 68385 states and 80214 transitions. [2019-09-07 22:37:47,987 INFO L78 Accepts]: Start accepts. Automaton has 68385 states and 80214 transitions. Word has length 407 [2019-09-07 22:37:47,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:37:47,988 INFO L475 AbstractCegarLoop]: Abstraction has 68385 states and 80214 transitions. [2019-09-07 22:37:47,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 22:37:47,988 INFO L276 IsEmpty]: Start isEmpty. Operand 68385 states and 80214 transitions. [2019-09-07 22:37:47,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2019-09-07 22:37:47,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:37:47,997 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:37:47,997 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:37:47,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:37:47,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1430478673, now seen corresponding path program 1 times [2019-09-07 22:37:47,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:37:47,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:37:47,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:47,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:47,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:49,712 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 23 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:37:49,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:37:49,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 22:37:49,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:37:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:49,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:37:49,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:37:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-07 22:37:49,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:37:49,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 22:37:49,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:37:49,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:37:49,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:37:49,941 INFO L87 Difference]: Start difference. First operand 68385 states and 80214 transitions. Second operand 9 states. [2019-09-07 22:37:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:37:59,377 INFO L93 Difference]: Finished difference Result 138475 states and 160710 transitions. [2019-09-07 22:37:59,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 22:37:59,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 426 [2019-09-07 22:37:59,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:37:59,582 INFO L225 Difference]: With dead ends: 138475 [2019-09-07 22:37:59,582 INFO L226 Difference]: Without dead ends: 73622 [2019-09-07 22:37:59,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2019-09-07 22:37:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73622 states. [2019-09-07 22:38:00,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73622 to 57105. [2019-09-07 22:38:00,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57105 states. [2019-09-07 22:38:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57105 states to 57105 states and 62387 transitions. [2019-09-07 22:38:00,661 INFO L78 Accepts]: Start accepts. Automaton has 57105 states and 62387 transitions. Word has length 426 [2019-09-07 22:38:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:38:00,662 INFO L475 AbstractCegarLoop]: Abstraction has 57105 states and 62387 transitions. [2019-09-07 22:38:00,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:38:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 57105 states and 62387 transitions. [2019-09-07 22:38:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1074 [2019-09-07 22:38:00,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:38:00,759 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:00,759 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:38:00,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:38:00,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1718549037, now seen corresponding path program 1 times [2019-09-07 22:38:00,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:38:00,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:38:00,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:00,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:38:00,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:38:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 357 proven. 332 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2019-09-07 22:38:02,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:38:02,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:38:02,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:38:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:38:03,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:38:03,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:38:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 873 proven. 2 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2019-09-07 22:38:03,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:38:03,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-09-07 22:38:03,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 22:38:03,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 22:38:03,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-09-07 22:38:03,689 INFO L87 Difference]: Start difference. First operand 57105 states and 62387 transitions. Second operand 18 states. [2019-09-07 22:38:15,117 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-07 22:38:38,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:38:38,543 INFO L93 Difference]: Finished difference Result 146346 states and 167335 transitions. [2019-09-07 22:38:38,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-07 22:38:38,543 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1073 [2019-09-07 22:38:38,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:38:38,698 INFO L225 Difference]: With dead ends: 146346 [2019-09-07 22:38:38,698 INFO L226 Difference]: Without dead ends: 86370 [2019-09-07 22:38:38,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1275 GetRequests, 1158 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5060 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2200, Invalid=11842, Unknown=0, NotChecked=0, Total=14042 [2019-09-07 22:38:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86370 states. [2019-09-07 22:38:39,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86370 to 83325. [2019-09-07 22:38:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83325 states. [2019-09-07 22:38:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83325 states to 83325 states and 88072 transitions. [2019-09-07 22:38:39,911 INFO L78 Accepts]: Start accepts. Automaton has 83325 states and 88072 transitions. Word has length 1073 [2019-09-07 22:38:39,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:38:39,912 INFO L475 AbstractCegarLoop]: Abstraction has 83325 states and 88072 transitions. [2019-09-07 22:38:39,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 22:38:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 83325 states and 88072 transitions. [2019-09-07 22:38:40,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1216 [2019-09-07 22:38:40,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:38:40,018 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:40,018 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:38:40,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:38:40,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1677288676, now seen corresponding path program 1 times [2019-09-07 22:38:40,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:38:40,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:38:40,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:40,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:38:40,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:38:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 348 proven. 74 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2019-09-07 22:38:41,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:38:41,354 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 22:38:41,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:38:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:38:41,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 1570 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:38:41,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:38:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 1015 proven. 2 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2019-09-07 22:38:42,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:38:42,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:38:42,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:38:42,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:38:42,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:38:42,440 INFO L87 Difference]: Start difference. First operand 83325 states and 88072 transitions. Second operand 9 states. [2019-09-07 22:38:56,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:38:56,659 INFO L93 Difference]: Finished difference Result 193635 states and 215143 transitions. [2019-09-07 22:38:56,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 22:38:56,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1215 [2019-09-07 22:38:56,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:38:56,922 INFO L225 Difference]: With dead ends: 193635 [2019-09-07 22:38:56,922 INFO L226 Difference]: Without dead ends: 108887 [2019-09-07 22:38:57,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1246 GetRequests, 1226 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-07 22:38:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108887 states. [2019-09-07 22:38:58,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108887 to 106481. [2019-09-07 22:38:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106481 states. [2019-09-07 22:38:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106481 states to 106481 states and 116492 transitions. [2019-09-07 22:38:58,358 INFO L78 Accepts]: Start accepts. Automaton has 106481 states and 116492 transitions. Word has length 1215 [2019-09-07 22:38:58,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:38:58,359 INFO L475 AbstractCegarLoop]: Abstraction has 106481 states and 116492 transitions. [2019-09-07 22:38:58,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:38:58,360 INFO L276 IsEmpty]: Start isEmpty. Operand 106481 states and 116492 transitions. [2019-09-07 22:38:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1250 [2019-09-07 22:38:58,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:38:58,525 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:38:58,525 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:38:58,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:38:58,526 INFO L82 PathProgramCache]: Analyzing trace with hash -30154317, now seen corresponding path program 1 times [2019-09-07 22:38:58,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:38:58,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:38:58,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:58,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:38:58,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1507 backedges. 555 proven. 268 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-07 22:39:00,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:39:00,408 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 22:39:00,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:00,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 1608 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:39:00,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:39:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1507 backedges. 1256 proven. 2 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2019-09-07 22:39:02,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:39:02,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:39:02,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:39:02,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:39:02,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:39:02,269 INFO L87 Difference]: Start difference. First operand 106481 states and 116492 transitions. Second operand 9 states. [2019-09-07 22:39:09,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:39:09,818 INFO L93 Difference]: Finished difference Result 214515 states and 234027 transitions. [2019-09-07 22:39:09,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 22:39:09,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1249 [2019-09-07 22:39:09,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:39:10,003 INFO L225 Difference]: With dead ends: 214515 [2019-09-07 22:39:10,003 INFO L226 Difference]: Without dead ends: 108750 [2019-09-07 22:39:10,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1284 GetRequests, 1262 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2019-09-07 22:39:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108750 states. [2019-09-07 22:39:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108750 to 105374. [2019-09-07 22:39:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105374 states. [2019-09-07 22:39:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105374 states to 105374 states and 110455 transitions. [2019-09-07 22:39:11,217 INFO L78 Accepts]: Start accepts. Automaton has 105374 states and 110455 transitions. Word has length 1249 [2019-09-07 22:39:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:39:11,218 INFO L475 AbstractCegarLoop]: Abstraction has 105374 states and 110455 transitions. [2019-09-07 22:39:11,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:39:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 105374 states and 110455 transitions. [2019-09-07 22:39:11,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1870 [2019-09-07 22:39:11,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:39:11,299 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:39:11,299 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:39:11,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:39:11,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1849799273, now seen corresponding path program 1 times [2019-09-07 22:39:11,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:39:11,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:39:11,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:11,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:11,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:15,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3344 backedges. 370 proven. 341 refuted. 0 times theorem prover too weak. 2633 trivial. 0 not checked. [2019-09-07 22:39:15,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:39:15,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:39:15,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:15,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 2350 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 22:39:16,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:39:16,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:39:16,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:39:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3344 backedges. 2520 proven. 2 refuted. 0 times theorem prover too weak. 822 trivial. 0 not checked. [2019-09-07 22:39:17,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:39:17,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 22:39:17,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:39:17,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:39:17,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:39:17,306 INFO L87 Difference]: Start difference. First operand 105374 states and 110455 transitions. Second operand 8 states. [2019-09-07 22:39:31,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:39:31,568 INFO L93 Difference]: Finished difference Result 233421 states and 246106 transitions. [2019-09-07 22:39:31,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 22:39:31,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1869 [2019-09-07 22:39:31,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:39:31,812 INFO L225 Difference]: With dead ends: 233421 [2019-09-07 22:39:31,813 INFO L226 Difference]: Without dead ends: 128763 [2019-09-07 22:39:31,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1905 GetRequests, 1883 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2019-09-07 22:39:31,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128763 states. [2019-09-07 22:39:33,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128763 to 127171. [2019-09-07 22:39:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127171 states. [2019-09-07 22:39:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127171 states to 127171 states and 132142 transitions. [2019-09-07 22:39:33,215 INFO L78 Accepts]: Start accepts. Automaton has 127171 states and 132142 transitions. Word has length 1869 [2019-09-07 22:39:33,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:39:33,216 INFO L475 AbstractCegarLoop]: Abstraction has 127171 states and 132142 transitions. [2019-09-07 22:39:33,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:39:33,217 INFO L276 IsEmpty]: Start isEmpty. Operand 127171 states and 132142 transitions. [2019-09-07 22:39:33,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2045 [2019-09-07 22:39:33,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:39:33,303 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:39:33,303 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:39:33,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:39:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1107334245, now seen corresponding path program 1 times [2019-09-07 22:39:33,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:39:33,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:39:33,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:33,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:33,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3666 backedges. 1630 proven. 2 refuted. 0 times theorem prover too weak. 2034 trivial. 0 not checked. [2019-09-07 22:39:38,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:39:38,233 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 22:39:38,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:38,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 2499 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 22:39:38,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:39:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3666 backedges. 1630 proven. 2 refuted. 0 times theorem prover too weak. 2034 trivial. 0 not checked. [2019-09-07 22:39:40,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:39:40,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 22:39:40,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 22:39:40,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 22:39:40,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 22:39:40,231 INFO L87 Difference]: Start difference. First operand 127171 states and 132142 transitions. Second operand 7 states. [2019-09-07 22:39:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:39:47,204 INFO L93 Difference]: Finished difference Result 250115 states and 259968 transitions. [2019-09-07 22:39:47,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 22:39:47,205 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2044 [2019-09-07 22:39:47,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:39:47,453 INFO L225 Difference]: With dead ends: 250115 [2019-09-07 22:39:47,453 INFO L226 Difference]: Without dead ends: 123660 [2019-09-07 22:39:47,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2061 GetRequests, 2050 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-09-07 22:39:47,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123660 states. [2019-09-07 22:39:48,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123660 to 122902. [2019-09-07 22:39:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122902 states. [2019-09-07 22:39:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122902 states to 122902 states and 127252 transitions. [2019-09-07 22:39:48,980 INFO L78 Accepts]: Start accepts. Automaton has 122902 states and 127252 transitions. Word has length 2044 [2019-09-07 22:39:48,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:39:48,981 INFO L475 AbstractCegarLoop]: Abstraction has 122902 states and 127252 transitions. [2019-09-07 22:39:48,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 22:39:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 122902 states and 127252 transitions. [2019-09-07 22:39:49,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2290 [2019-09-07 22:39:49,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:39:49,091 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:39:49,092 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:39:49,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:39:49,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1372561758, now seen corresponding path program 1 times [2019-09-07 22:39:49,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:39:49,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:39:49,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:49,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:49,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4776 backedges. 2018 proven. 813 refuted. 0 times theorem prover too weak. 1945 trivial. 0 not checked. [2019-09-07 22:39:53,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:39:53,952 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:39:53,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:54,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 2784 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 22:39:54,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:39:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4776 backedges. 1903 proven. 5 refuted. 0 times theorem prover too weak. 2868 trivial. 0 not checked. [2019-09-07 22:39:56,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:39:56,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-07 22:39:56,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 22:39:56,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 22:39:56,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-09-07 22:39:56,349 INFO L87 Difference]: Start difference. First operand 122902 states and 127252 transitions. Second operand 14 states. [2019-09-07 22:40:11,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:40:11,004 INFO L93 Difference]: Finished difference Result 301614 states and 313509 transitions. [2019-09-07 22:40:11,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 22:40:11,004 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 2289 [2019-09-07 22:40:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:40:11,323 INFO L225 Difference]: With dead ends: 301614 [2019-09-07 22:40:11,324 INFO L226 Difference]: Without dead ends: 179428 [2019-09-07 22:40:11,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2359 GetRequests, 2316 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=345, Invalid=1635, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 22:40:11,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179428 states. [2019-09-07 22:40:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179428 to 174219. [2019-09-07 22:40:12,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174219 states. [2019-09-07 22:40:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174219 states to 174219 states and 179982 transitions. [2019-09-07 22:40:13,058 INFO L78 Accepts]: Start accepts. Automaton has 174219 states and 179982 transitions. Word has length 2289 [2019-09-07 22:40:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:40:13,059 INFO L475 AbstractCegarLoop]: Abstraction has 174219 states and 179982 transitions. [2019-09-07 22:40:13,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 22:40:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 174219 states and 179982 transitions. [2019-09-07 22:40:13,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2319 [2019-09-07 22:40:13,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:40:13,180 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:40:13,180 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:40:13,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:40:13,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1335462294, now seen corresponding path program 1 times [2019-09-07 22:40:13,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:40:13,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:40:13,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:13,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:13,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5039 backedges. 2815 proven. 32 refuted. 0 times theorem prover too weak. 2192 trivial. 0 not checked. [2019-09-07 22:40:19,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:40:19,184 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 22:40:19,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:19,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 2830 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 22:40:19,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:40:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5039 backedges. 1935 proven. 5 refuted. 0 times theorem prover too weak. 3099 trivial. 0 not checked. [2019-09-07 22:40:21,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:40:21,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:40:21,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:40:21,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:40:21,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:40:21,695 INFO L87 Difference]: Start difference. First operand 174219 states and 179982 transitions. Second operand 9 states. [2019-09-07 22:40:27,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:40:27,940 INFO L93 Difference]: Finished difference Result 347017 states and 358754 transitions. [2019-09-07 22:40:27,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 22:40:27,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2318 [2019-09-07 22:40:27,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:40:28,240 INFO L225 Difference]: With dead ends: 347017 [2019-09-07 22:40:28,240 INFO L226 Difference]: Without dead ends: 170682 [2019-09-07 22:40:28,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2345 GetRequests, 2330 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-09-07 22:40:28,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170682 states. [2019-09-07 22:40:30,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170682 to 164879. [2019-09-07 22:40:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164879 states. [2019-09-07 22:40:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164879 states to 164879 states and 168560 transitions. [2019-09-07 22:40:30,390 INFO L78 Accepts]: Start accepts. Automaton has 164879 states and 168560 transitions. Word has length 2318 [2019-09-07 22:40:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:40:30,391 INFO L475 AbstractCegarLoop]: Abstraction has 164879 states and 168560 transitions. [2019-09-07 22:40:30,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:40:30,392 INFO L276 IsEmpty]: Start isEmpty. Operand 164879 states and 168560 transitions. [2019-09-07 22:40:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2857 [2019-09-07 22:40:30,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:40:30,557 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:40:30,557 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:40:30,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:40:30,558 INFO L82 PathProgramCache]: Analyzing trace with hash -618362046, now seen corresponding path program 1 times [2019-09-07 22:40:30,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:40:30,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:40:30,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:30,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:30,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 22:40:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 22:40:31,441 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 22:40:31,453 INFO L168 Benchmark]: Toolchain (without parser) took 262372.03 ms. Allocated memory was 142.1 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 78.4 MB in the beginning and 935.2 MB in the end (delta: -856.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-09-07 22:40:31,454 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 142.1 MB. Free memory is still 106.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-07 22:40:31,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1855.57 ms. Allocated memory was 142.1 MB in the beginning and 234.9 MB in the end (delta: 92.8 MB). Free memory was 78.4 MB in the beginning and 96.0 MB in the end (delta: -17.5 MB). Peak memory consumption was 82.6 MB. Max. memory is 7.1 GB. [2019-09-07 22:40:31,456 INFO L168 Benchmark]: Boogie Preprocessor took 360.30 ms. Allocated memory was 234.9 MB in the beginning and 264.8 MB in the end (delta: 29.9 MB). Free memory was 96.0 MB in the beginning and 202.6 MB in the end (delta: -106.7 MB). Peak memory consumption was 36.4 MB. Max. memory is 7.1 GB. [2019-09-07 22:40:31,457 INFO L168 Benchmark]: RCFGBuilder took 4388.36 ms. Allocated memory was 264.8 MB in the beginning and 341.8 MB in the end (delta: 77.1 MB). Free memory was 202.6 MB in the beginning and 267.7 MB in the end (delta: -65.0 MB). Peak memory consumption was 204.0 MB. Max. memory is 7.1 GB. [2019-09-07 22:40:31,461 INFO L168 Benchmark]: TraceAbstraction took 255761.20 ms. Allocated memory was 341.8 MB in the beginning and 3.2 GB in the end (delta: 2.8 GB). Free memory was 267.7 MB in the beginning and 935.2 MB in the end (delta: -667.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-09-07 22:40:31,473 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.48 ms. Allocated memory is still 142.1 MB. Free memory is still 106.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1855.57 ms. Allocated memory was 142.1 MB in the beginning and 234.9 MB in the end (delta: 92.8 MB). Free memory was 78.4 MB in the beginning and 96.0 MB in the end (delta: -17.5 MB). Peak memory consumption was 82.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 360.30 ms. Allocated memory was 234.9 MB in the beginning and 264.8 MB in the end (delta: 29.9 MB). Free memory was 96.0 MB in the beginning and 202.6 MB in the end (delta: -106.7 MB). Peak memory consumption was 36.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4388.36 ms. Allocated memory was 264.8 MB in the beginning and 341.8 MB in the end (delta: 77.1 MB). Free memory was 202.6 MB in the beginning and 267.7 MB in the end (delta: -65.0 MB). Peak memory consumption was 204.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 255761.20 ms. Allocated memory was 341.8 MB in the beginning and 3.2 GB in the end (delta: 2.8 GB). Free memory was 267.7 MB in the beginning and 935.2 MB in the end (delta: -667.5 MB). Peak memory consumption was 2.2 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...