java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memset2_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:14:22,752 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:14:22,754 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:14:22,766 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:14:22,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:14:22,767 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:14:22,768 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:14:22,769 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:14:22,771 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:14:22,772 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:14:22,772 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:14:22,773 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:14:22,773 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:14:22,775 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:14:22,776 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:14:22,778 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:14:22,779 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:14:22,781 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:14:22,782 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:14:22,783 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:14:22,784 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:14:22,785 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:14:22,785 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:14:22,786 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:14:22,786 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:14:22,787 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:14:22,787 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:14:22,788 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:14:22,788 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:14:22,788 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:14:22,788 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:14:22,788 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:14:22,798 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:14:22,798 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:14:22,799 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:14:22,799 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:14:22,799 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:14:22,800 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:14:22,800 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:14:22,800 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:14:22,800 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:14:22,800 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:14:22,800 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:14:22,800 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:14:22,800 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:14:22,801 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:14:22,801 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:14:22,801 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:14:22,801 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:14:22,801 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:14:22,801 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:14:22,801 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:14:22,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:14:22,801 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:14:22,802 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:14:22,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:14:22,842 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:14:22,845 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:14:22,846 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:14:22,847 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:14:22,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memset2_true-valid-memsafety_true-termination.c [2018-02-02 10:14:22,955 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:14:22,956 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:14:22,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:14:22,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:14:22,961 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:14:22,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:14:22" (1/1) ... [2018-02-02 10:14:22,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d4a1c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:14:22, skipping insertion in model container [2018-02-02 10:14:22,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:14:22" (1/1) ... [2018-02-02 10:14:22,975 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:14:22,984 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:14:23,063 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:14:23,072 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:14:23,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:14:23 WrapperNode [2018-02-02 10:14:23,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:14:23,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:14:23,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:14:23,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:14:23,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:14:23" (1/1) ... [2018-02-02 10:14:23,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:14:23" (1/1) ... [2018-02-02 10:14:23,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:14:23" (1/1) ... [2018-02-02 10:14:23,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:14:23" (1/1) ... [2018-02-02 10:14:23,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:14:23" (1/1) ... [2018-02-02 10:14:23,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:14:23" (1/1) ... [2018-02-02 10:14:23,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:14:23" (1/1) ... [2018-02-02 10:14:23,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:14:23,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:14:23,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:14:23,096 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:14:23,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:14:23" (1/1) ... No working directory specified, using /home/ultimate/work/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 [2018-02-02 10:14:23,136 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:14:23,136 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:14:23,136 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:14:23,136 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:14:23,137 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:14:23,137 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:14:23,137 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 10:14:23,137 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 10:14:23,137 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 10:14:23,137 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:14:23,137 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:14:23,137 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:14:23,197 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 10:14:23,231 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:14:23,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:14:23 BoogieIcfgContainer [2018-02-02 10:14:23,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:14:23,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:14:23,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:14:23,234 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:14:23,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:14:22" (1/3) ... [2018-02-02 10:14:23,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bcf99f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:14:23, skipping insertion in model container [2018-02-02 10:14:23,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:14:23" (2/3) ... [2018-02-02 10:14:23,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bcf99f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:14:23, skipping insertion in model container [2018-02-02 10:14:23,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:14:23" (3/3) ... [2018-02-02 10:14:23,237 INFO L107 eAbstractionObserver]: Analyzing ICFG memset2_true-valid-memsafety_true-termination.c [2018-02-02 10:14:23,245 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:14:23,255 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-02 10:14:23,283 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:14:23,284 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:14:23,284 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:14:23,284 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:14:23,284 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:14:23,284 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:14:23,284 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:14:23,284 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:14:23,285 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:14:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-02-02 10:14:23,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 10:14:23,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:23,305 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:23,305 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:23,309 INFO L82 PathProgramCache]: Analyzing trace with hash 682221498, now seen corresponding path program 1 times [2018-02-02 10:14:23,359 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:23,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:14:23,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:14:23,458 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,459 INFO L182 omatonBuilderFactory]: Interpolants [25#true, 26#false, 27#(= 1 (select |#valid| |main_~#cstats~0.base|))] [2018-02-02 10:14:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:14:23,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:14:23,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:14:23,475 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-02-02 10:14:23,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:23,532 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-02-02 10:14:23,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:14:23,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 10:14:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:23,541 INFO L225 Difference]: With dead ends: 21 [2018-02-02 10:14:23,541 INFO L226 Difference]: Without dead ends: 18 [2018-02-02 10:14:23,543 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:14:23,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-02-02 10:14:23,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-02-02 10:14:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-02-02 10:14:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-02-02 10:14:23,566 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 7 [2018-02-02 10:14:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:23,566 INFO L432 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-02-02 10:14:23,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:14:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-02-02 10:14:23,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 10:14:23,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:23,567 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:23,567 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:23,567 INFO L82 PathProgramCache]: Analyzing trace with hash 682221499, now seen corresponding path program 1 times [2018-02-02 10:14:23,568 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:23,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:14:23,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:14:23,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:23,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,662 INFO L182 omatonBuilderFactory]: Interpolants [67#true, 68#false, 69#(and (= (select |#length| |main_~#cstats~0.base|) 40) (= |main_~#cstats~0.offset| 0))] [2018-02-02 10:14:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:14:23,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:14:23,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:14:23,664 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 3 states. [2018-02-02 10:14:23,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:23,673 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-02-02 10:14:23,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:14:23,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 10:14:23,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:23,674 INFO L225 Difference]: With dead ends: 17 [2018-02-02 10:14:23,674 INFO L226 Difference]: Without dead ends: 17 [2018-02-02 10:14:23,675 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:14:23,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-02-02 10:14:23,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-02-02 10:14:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-02-02 10:14:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-02-02 10:14:23,678 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 7 [2018-02-02 10:14:23,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:23,678 INFO L432 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-02-02 10:14:23,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:14:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-02-02 10:14:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:14:23,678 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:23,679 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:23,679 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:23,679 INFO L82 PathProgramCache]: Analyzing trace with hash -898824040, now seen corresponding path program 1 times [2018-02-02 10:14:23,680 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:23,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:14:23,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:14:23,728 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,729 INFO L182 omatonBuilderFactory]: Interpolants [104#true, 105#false, 106#(= |#Ultimate.C_memset_#t~loopctr5| 0), 107#(not (= |#Ultimate.C_memset_#amount| 40))] [2018-02-02 10:14:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:14:23,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:14:23,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:14:23,729 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 4 states. [2018-02-02 10:14:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:23,749 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-02-02 10:14:23,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:14:23,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 10:14:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:23,750 INFO L225 Difference]: With dead ends: 20 [2018-02-02 10:14:23,750 INFO L226 Difference]: Without dead ends: 18 [2018-02-02 10:14:23,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:14:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-02-02 10:14:23,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-02-02 10:14:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-02-02 10:14:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-02-02 10:14:23,754 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-02-02 10:14:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:23,754 INFO L432 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-02-02 10:14:23,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:14:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-02-02 10:14:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:14:23,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:23,755 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:23,755 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:23,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1616948477, now seen corresponding path program 1 times [2018-02-02 10:14:23,756 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:23,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:23,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:14:23,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,803 INFO L182 omatonBuilderFactory]: Interpolants [148#true, 149#false, 150#(= |#Ultimate.C_memset_#t~loopctr5| 0), 151#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 152#(not (= |#Ultimate.C_memset_#amount| 40))] [2018-02-02 10:14:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:14:23,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:14:23,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:14:23,804 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 5 states. [2018-02-02 10:14:23,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:23,826 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-02-02 10:14:23,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:14:23,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:14:23,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:23,827 INFO L225 Difference]: With dead ends: 21 [2018-02-02 10:14:23,827 INFO L226 Difference]: Without dead ends: 19 [2018-02-02 10:14:23,828 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:14:23,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-02-02 10:14:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-02-02 10:14:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-02-02 10:14:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-02-02 10:14:23,830 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-02-02 10:14:23,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:23,830 INFO L432 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-02-02 10:14:23,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:14:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-02-02 10:14:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:14:23,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:23,831 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:23,831 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:23,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1998482120, now seen corresponding path program 2 times [2018-02-02 10:14:23,832 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:23,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:23,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:23,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:14:23,890 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,890 INFO L182 omatonBuilderFactory]: Interpolants [193#true, 194#false, 195#(= |#Ultimate.C_memset_#t~loopctr5| 0), 196#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 197#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 198#(not (= |#Ultimate.C_memset_#amount| 40))] [2018-02-02 10:14:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:14:23,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:14:23,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:14:23,891 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 6 states. [2018-02-02 10:14:23,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:23,911 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-02-02 10:14:23,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:14:23,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 10:14:23,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:23,912 INFO L225 Difference]: With dead ends: 22 [2018-02-02 10:14:23,912 INFO L226 Difference]: Without dead ends: 20 [2018-02-02 10:14:23,912 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:14:23,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-02-02 10:14:23,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-02-02 10:14:23,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-02-02 10:14:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-02-02 10:14:23,914 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-02-02 10:14:23,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:23,915 INFO L432 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-02-02 10:14:23,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:14:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-02-02 10:14:23,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:14:23,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:23,915 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:23,915 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:23,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1887286365, now seen corresponding path program 3 times [2018-02-02 10:14:23,916 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:23,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:23,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:23,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:14:23,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,971 INFO L182 omatonBuilderFactory]: Interpolants [241#true, 242#false, 243#(= |#Ultimate.C_memset_#t~loopctr5| 0), 244#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 245#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 246#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 247#(not (= |#Ultimate.C_memset_#amount| 40))] [2018-02-02 10:14:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:23,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:14:23,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:14:23,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:14:23,972 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 7 states. [2018-02-02 10:14:23,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:23,996 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-02-02 10:14:23,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:14:23,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 10:14:23,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:23,997 INFO L225 Difference]: With dead ends: 23 [2018-02-02 10:14:23,997 INFO L226 Difference]: Without dead ends: 21 [2018-02-02 10:14:23,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:14:23,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-02-02 10:14:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-02-02 10:14:23,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-02-02 10:14:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-02-02 10:14:24,000 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-02-02 10:14:24,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:24,000 INFO L432 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-02-02 10:14:24,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:14:24,000 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-02-02 10:14:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:14:24,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:24,001 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:24,001 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:24,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2087025112, now seen corresponding path program 4 times [2018-02-02 10:14:24,002 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:24,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,069 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:24,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:14:24,069 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,070 INFO L182 omatonBuilderFactory]: Interpolants [292#true, 293#false, 294#(= |#Ultimate.C_memset_#t~loopctr5| 0), 295#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 296#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 297#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 298#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 299#(not (= |#Ultimate.C_memset_#amount| 40))] [2018-02-02 10:14:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:14:24,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:14:24,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:14:24,071 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2018-02-02 10:14:24,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:24,089 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-02-02 10:14:24,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:14:24,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-02 10:14:24,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:24,090 INFO L225 Difference]: With dead ends: 24 [2018-02-02 10:14:24,090 INFO L226 Difference]: Without dead ends: 22 [2018-02-02 10:14:24,090 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:14:24,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-02-02 10:14:24,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-02-02 10:14:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-02-02 10:14:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-02-02 10:14:24,093 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-02-02 10:14:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:24,094 INFO L432 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-02-02 10:14:24,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:14:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-02-02 10:14:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:14:24,094 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:24,095 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:24,095 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:24,095 INFO L82 PathProgramCache]: Analyzing trace with hash -311008323, now seen corresponding path program 5 times [2018-02-02 10:14:24,096 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:24,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:24,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:14:24,193 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,193 INFO L182 omatonBuilderFactory]: Interpolants [352#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 353#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 354#(not (= |#Ultimate.C_memset_#amount| 40)), 346#true, 347#false, 348#(= |#Ultimate.C_memset_#t~loopctr5| 0), 349#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 350#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 351#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:14:24,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:14:24,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:14:24,194 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 9 states. [2018-02-02 10:14:24,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:24,213 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-02-02 10:14:24,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:14:24,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-02 10:14:24,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:24,214 INFO L225 Difference]: With dead ends: 25 [2018-02-02 10:14:24,214 INFO L226 Difference]: Without dead ends: 23 [2018-02-02 10:14:24,214 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:14:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-02-02 10:14:24,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-02-02 10:14:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-02-02 10:14:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-02-02 10:14:24,216 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-02-02 10:14:24,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:24,216 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-02-02 10:14:24,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:14:24,216 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-02-02 10:14:24,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:14:24,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:24,217 INFO L351 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:24,217 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:24,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1635600776, now seen corresponding path program 6 times [2018-02-02 10:14:24,217 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:24,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:24,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:14:24,292 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,293 INFO L182 omatonBuilderFactory]: Interpolants [403#true, 404#false, 405#(= |#Ultimate.C_memset_#t~loopctr5| 0), 406#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 407#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 408#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 409#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 410#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 411#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 412#(not (= |#Ultimate.C_memset_#amount| 40))] [2018-02-02 10:14:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:14:24,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:14:24,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:14:24,294 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 10 states. [2018-02-02 10:14:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:24,311 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-02-02 10:14:24,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:14:24,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 10:14:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:24,312 INFO L225 Difference]: With dead ends: 26 [2018-02-02 10:14:24,313 INFO L226 Difference]: Without dead ends: 24 [2018-02-02 10:14:24,313 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:14:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-02-02 10:14:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-02-02 10:14:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-02 10:14:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-02-02 10:14:24,315 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-02-02 10:14:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:24,316 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-02-02 10:14:24,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:14:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-02-02 10:14:24,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:14:24,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:24,316 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:24,317 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:24,317 INFO L82 PathProgramCache]: Analyzing trace with hash 251706141, now seen corresponding path program 7 times [2018-02-02 10:14:24,318 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:24,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:24,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:14:24,432 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,432 INFO L182 omatonBuilderFactory]: Interpolants [464#false, 465#(= |#Ultimate.C_memset_#t~loopctr5| 0), 466#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 467#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 468#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 469#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 470#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 471#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 472#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 473#(not (= |#Ultimate.C_memset_#amount| 40)), 463#true] [2018-02-02 10:14:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:14:24,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:14:24,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:14:24,433 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 11 states. [2018-02-02 10:14:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:24,459 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-02-02 10:14:24,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:14:24,460 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-02 10:14:24,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:24,460 INFO L225 Difference]: With dead ends: 27 [2018-02-02 10:14:24,461 INFO L226 Difference]: Without dead ends: 25 [2018-02-02 10:14:24,461 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=56, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:14:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-02 10:14:24,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-02 10:14:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-02 10:14:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-02-02 10:14:24,463 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-02-02 10:14:24,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:24,463 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-02-02 10:14:24,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:14:24,463 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-02-02 10:14:24,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:14:24,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:24,464 INFO L351 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:24,464 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:24,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1371321576, now seen corresponding path program 8 times [2018-02-02 10:14:24,465 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:24,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:24,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:14:24,586 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,587 INFO L182 omatonBuilderFactory]: Interpolants [528#(= |#Ultimate.C_memset_#t~loopctr5| 0), 529#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 530#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 531#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 532#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 533#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 534#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 535#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 536#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 537#(not (= |#Ultimate.C_memset_#amount| 40)), 526#true, 527#false] [2018-02-02 10:14:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:14:24,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:14:24,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:14:24,587 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 12 states. [2018-02-02 10:14:24,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:24,624 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-02-02 10:14:24,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:14:24,625 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-02-02 10:14:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:24,626 INFO L225 Difference]: With dead ends: 28 [2018-02-02 10:14:24,626 INFO L226 Difference]: Without dead ends: 26 [2018-02-02 10:14:24,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=67, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:14:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-02 10:14:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-02 10:14:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-02 10:14:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-02-02 10:14:24,628 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-02-02 10:14:24,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:24,629 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-02-02 10:14:24,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:14:24,629 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-02-02 10:14:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:14:24,629 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:24,629 INFO L351 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:24,629 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:24,630 INFO L82 PathProgramCache]: Analyzing trace with hash -145573251, now seen corresponding path program 9 times [2018-02-02 10:14:24,630 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:24,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,745 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:24,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:14:24,745 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,745 INFO L182 omatonBuilderFactory]: Interpolants [592#true, 593#false, 594#(= |#Ultimate.C_memset_#t~loopctr5| 0), 595#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 596#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 597#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 598#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 599#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 600#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 601#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 602#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 603#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 604#(not (= |#Ultimate.C_memset_#amount| 40))] [2018-02-02 10:14:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:14:24,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:14:24,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:14:24,746 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 13 states. [2018-02-02 10:14:24,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:24,783 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-02-02 10:14:24,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:14:24,787 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-02-02 10:14:24,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:24,787 INFO L225 Difference]: With dead ends: 29 [2018-02-02 10:14:24,787 INFO L226 Difference]: Without dead ends: 27 [2018-02-02 10:14:24,788 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=79, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:14:24,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-02 10:14:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-02-02 10:14:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-02 10:14:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-02-02 10:14:24,790 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-02-02 10:14:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:24,790 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-02-02 10:14:24,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:14:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-02-02 10:14:24,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:14:24,791 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:24,791 INFO L351 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:24,791 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:24,791 INFO L82 PathProgramCache]: Analyzing trace with hash -802080840, now seen corresponding path program 10 times [2018-02-02 10:14:24,792 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:24,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:24,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:14:24,909 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,909 INFO L182 omatonBuilderFactory]: Interpolants [672#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 673#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 674#(not (= |#Ultimate.C_memset_#amount| 40)), 661#true, 662#false, 663#(= |#Ultimate.C_memset_#t~loopctr5| 0), 664#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 665#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 666#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 667#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 668#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 669#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 670#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 671#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:24,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:14:24,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:14:24,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:14:24,910 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-02-02 10:14:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:24,926 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-02-02 10:14:24,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:14:24,926 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-02-02 10:14:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:24,927 INFO L225 Difference]: With dead ends: 30 [2018-02-02 10:14:24,927 INFO L226 Difference]: Without dead ends: 28 [2018-02-02 10:14:24,927 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:14:24,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-02 10:14:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-02 10:14:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-02 10:14:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-02-02 10:14:24,929 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-02-02 10:14:24,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:24,929 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-02-02 10:14:24,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:14:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-02-02 10:14:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:14:24,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:24,929 INFO L351 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:24,929 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:24,929 INFO L82 PathProgramCache]: Analyzing trace with hash 321020381, now seen corresponding path program 11 times [2018-02-02 10:14:24,930 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:24,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:25,050 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:25,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:25,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:14:25,051 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:25,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:25,051 INFO L182 omatonBuilderFactory]: Interpolants [736#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 737#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 738#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 739#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 740#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 741#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 742#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 743#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 744#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 745#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 746#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 747#(not (= |#Ultimate.C_memset_#amount| 40)), 733#true, 734#false, 735#(= |#Ultimate.C_memset_#t~loopctr5| 0)] [2018-02-02 10:14:25,051 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:25,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:14:25,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:14:25,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=106, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:14:25,052 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 15 states. [2018-02-02 10:14:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:25,078 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-02-02 10:14:25,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:14:25,078 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-02-02 10:14:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:25,078 INFO L225 Difference]: With dead ends: 31 [2018-02-02 10:14:25,079 INFO L226 Difference]: Without dead ends: 29 [2018-02-02 10:14:25,079 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=106, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:14:25,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-02 10:14:25,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-02 10:14:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-02 10:14:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-02-02 10:14:25,080 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-02-02 10:14:25,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:25,080 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-02-02 10:14:25,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:14:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-02-02 10:14:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:14:25,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:25,081 INFO L351 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:25,081 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:25,081 INFO L82 PathProgramCache]: Analyzing trace with hash 777419864, now seen corresponding path program 12 times [2018-02-02 10:14:25,081 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:25,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:25,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:25,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:14:25,222 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:25,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:25,223 INFO L182 omatonBuilderFactory]: Interpolants [808#true, 809#false, 810#(= |#Ultimate.C_memset_#t~loopctr5| 0), 811#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 812#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 813#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 814#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 815#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 816#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 817#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 818#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 819#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 820#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 821#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 822#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 823#(not (= |#Ultimate.C_memset_#amount| 40))] [2018-02-02 10:14:25,223 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:25,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:14:25,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:14:25,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=121, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:14:25,224 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-02-02 10:14:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:25,254 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-02-02 10:14:25,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:14:25,255 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-02-02 10:14:25,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:25,256 INFO L225 Difference]: With dead ends: 32 [2018-02-02 10:14:25,256 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 10:14:25,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=121, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:14:25,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 10:14:25,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-02 10:14:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-02 10:14:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-02-02 10:14:25,258 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-02-02 10:14:25,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:25,258 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-02-02 10:14:25,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:14:25,258 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-02-02 10:14:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:14:25,259 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:25,259 INFO L351 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:25,259 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:25,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2040901949, now seen corresponding path program 13 times [2018-02-02 10:14:25,260 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:25,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:25,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:25,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:14:25,415 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:25,415 INFO L182 omatonBuilderFactory]: Interpolants [896#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 897#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 898#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 899#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 900#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 901#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 902#(not (= |#Ultimate.C_memset_#amount| 40)), 886#true, 887#false, 888#(= |#Ultimate.C_memset_#t~loopctr5| 0), 889#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 890#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 891#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 892#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 893#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 894#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 895#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:25,416 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:25,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:14:25,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:14:25,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=137, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:14:25,416 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 17 states. [2018-02-02 10:14:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:25,445 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-02-02 10:14:25,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:14:25,445 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-02-02 10:14:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:25,446 INFO L225 Difference]: With dead ends: 33 [2018-02-02 10:14:25,446 INFO L226 Difference]: Without dead ends: 31 [2018-02-02 10:14:25,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=137, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:14:25,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-02 10:14:25,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-02 10:14:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 10:14:25,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-02-02 10:14:25,448 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-02-02 10:14:25,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:25,449 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-02-02 10:14:25,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:14:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-02-02 10:14:25,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:14:25,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:25,449 INFO L351 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:25,450 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:25,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1740826376, now seen corresponding path program 14 times [2018-02-02 10:14:25,450 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:25,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:25,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:25,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:14:25,585 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:25,586 INFO L182 omatonBuilderFactory]: Interpolants [967#true, 968#false, 969#(= |#Ultimate.C_memset_#t~loopctr5| 0), 970#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 971#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 972#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 973#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 974#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 975#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 976#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 977#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 978#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 979#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 980#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 981#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 982#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 983#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 984#(not (= |#Ultimate.C_memset_#amount| 40))] [2018-02-02 10:14:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:25,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:14:25,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:14:25,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:14:25,587 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 18 states. [2018-02-02 10:14:25,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:25,610 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-02-02 10:14:25,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:14:25,610 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-02-02 10:14:25,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:25,611 INFO L225 Difference]: With dead ends: 34 [2018-02-02 10:14:25,611 INFO L226 Difference]: Without dead ends: 32 [2018-02-02 10:14:25,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=154, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:14:25,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-02 10:14:25,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-02 10:14:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-02 10:14:25,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-02-02 10:14:25,614 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-02-02 10:14:25,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:25,614 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-02-02 10:14:25,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:14:25,614 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-02-02 10:14:25,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:14:25,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:25,615 INFO L351 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:25,615 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:25,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1284679837, now seen corresponding path program 15 times [2018-02-02 10:14:25,616 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:25,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:25,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:25,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:14:25,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:25,835 INFO L182 omatonBuilderFactory]: Interpolants [1056#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 1057#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 1058#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 1059#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 1060#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 1061#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 1062#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 1063#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 1064#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 1065#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 1066#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 1067#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 1068#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 1069#(not (= |#Ultimate.C_memset_#amount| 40)), 1051#true, 1052#false, 1053#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1054#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 1055#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:25,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:14:25,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:14:25,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:14:25,836 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 19 states. [2018-02-02 10:14:25,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:25,882 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-02-02 10:14:25,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:14:25,883 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2018-02-02 10:14:25,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:25,884 INFO L225 Difference]: With dead ends: 35 [2018-02-02 10:14:25,884 INFO L226 Difference]: Without dead ends: 33 [2018-02-02 10:14:25,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=172, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:14:25,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-02-02 10:14:25,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-02-02 10:14:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-02 10:14:25,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-02-02 10:14:25,890 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-02-02 10:14:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:25,890 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-02-02 10:14:25,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:14:25,891 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-02-02 10:14:25,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:14:25,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:25,891 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:25,891 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:25,891 INFO L82 PathProgramCache]: Analyzing trace with hash 586091928, now seen corresponding path program 16 times [2018-02-02 10:14:25,892 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:25,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:26,131 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:26,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:26,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:14:26,131 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:26,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:26,131 INFO L182 omatonBuilderFactory]: Interpolants [1152#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 1153#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 1154#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 1155#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 1156#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 1157#(not (= |#Ultimate.C_memset_#amount| 40)), 1138#true, 1139#false, 1140#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1141#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 1142#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 1143#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 1144#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 1145#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 1146#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 1147#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 1148#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 1149#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 1150#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 1151#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:26,131 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:26,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:14:26,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:14:26,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=191, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:14:26,132 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 20 states. [2018-02-02 10:14:26,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:26,154 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-02-02 10:14:26,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:14:26,154 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2018-02-02 10:14:26,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:26,155 INFO L225 Difference]: With dead ends: 36 [2018-02-02 10:14:26,155 INFO L226 Difference]: Without dead ends: 34 [2018-02-02 10:14:26,155 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=191, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:14:26,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-02 10:14:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-02-02 10:14:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-02 10:14:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-02-02 10:14:26,158 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-02-02 10:14:26,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:26,158 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-02-02 10:14:26,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:14:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-02-02 10:14:26,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 10:14:26,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:26,159 INFO L351 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:26,159 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:26,159 INFO L82 PathProgramCache]: Analyzing trace with hash 404703229, now seen corresponding path program 17 times [2018-02-02 10:14:26,160 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:26,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:26,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:26,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:14:26,361 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:26,362 INFO L182 omatonBuilderFactory]: Interpolants [1248#(not (= |#Ultimate.C_memset_#amount| 40)), 1228#true, 1229#false, 1230#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1231#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 1232#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 1233#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 1234#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 1235#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 1236#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 1237#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 1238#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 1239#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 1240#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 1241#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 1242#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 1243#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 1244#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 1245#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 1246#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 1247#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:26,362 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:26,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:14:26,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:14:26,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:14:26,363 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 21 states. [2018-02-02 10:14:26,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:26,387 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-02-02 10:14:26,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:14:26,387 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-02-02 10:14:26,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:26,387 INFO L225 Difference]: With dead ends: 37 [2018-02-02 10:14:26,388 INFO L226 Difference]: Without dead ends: 35 [2018-02-02 10:14:26,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=209, Invalid=211, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:14:26,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-02 10:14:26,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-02 10:14:26,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-02 10:14:26,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-02-02 10:14:26,390 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-02-02 10:14:26,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:26,390 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-02-02 10:14:26,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:14:26,391 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-02-02 10:14:26,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:14:26,391 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:26,391 INFO L351 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:26,391 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:26,391 INFO L82 PathProgramCache]: Analyzing trace with hash -923379144, now seen corresponding path program 18 times [2018-02-02 10:14:26,392 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:26,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:26,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:26,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:14:26,580 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:26,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:26,580 INFO L182 omatonBuilderFactory]: Interpolants [1321#true, 1322#false, 1323#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1324#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 1325#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 1326#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 1327#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 1328#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 1329#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 1330#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 1331#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 1332#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 1333#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 1334#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 1335#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 1336#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 1337#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 1338#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 1339#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 1340#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 1341#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 1342#(not (= |#Ultimate.C_memset_#amount| 40))] [2018-02-02 10:14:26,580 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:26,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:14:26,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:14:26,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=232, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:14:26,581 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 22 states. [2018-02-02 10:14:26,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:26,606 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-02-02 10:14:26,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:14:26,606 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 34 [2018-02-02 10:14:26,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:26,607 INFO L225 Difference]: With dead ends: 38 [2018-02-02 10:14:26,607 INFO L226 Difference]: Without dead ends: 36 [2018-02-02 10:14:26,607 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=230, Invalid=232, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:14:26,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-02 10:14:26,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-02 10:14:26,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 10:14:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-02-02 10:14:26,609 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-02-02 10:14:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:26,609 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-02-02 10:14:26,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:14:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-02-02 10:14:26,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:14:26,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:26,610 INFO L351 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:26,610 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:26,610 INFO L82 PathProgramCache]: Analyzing trace with hash 855740253, now seen corresponding path program 19 times [2018-02-02 10:14:26,610 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:26,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:26,831 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:26,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:26,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:14:26,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:26,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:26,832 INFO L182 omatonBuilderFactory]: Interpolants [1417#true, 1418#false, 1419#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1420#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 1421#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 1422#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 1423#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 1424#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 1425#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 1426#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 1427#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 1428#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 1429#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 1430#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 1431#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 1432#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 1433#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 1434#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 1435#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 1436#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 1437#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 1438#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 1439#(not (= |#Ultimate.C_memset_#amount| 40))] [2018-02-02 10:14:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:26,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:14:26,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:14:26,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:14:26,832 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 23 states. [2018-02-02 10:14:26,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:26,873 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-02-02 10:14:26,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:14:26,873 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2018-02-02 10:14:26,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:26,875 INFO L225 Difference]: With dead ends: 39 [2018-02-02 10:14:26,875 INFO L226 Difference]: Without dead ends: 37 [2018-02-02 10:14:26,875 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=252, Invalid=254, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:14:26,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-02 10:14:26,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-02 10:14:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 10:14:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-02-02 10:14:26,877 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-02-02 10:14:26,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:26,878 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-02-02 10:14:26,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:14:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-02-02 10:14:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:14:26,878 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:26,878 INFO L351 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:26,879 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:26,879 INFO L82 PathProgramCache]: Analyzing trace with hash 173866712, now seen corresponding path program 20 times [2018-02-02 10:14:26,879 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:26,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:27,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:27,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:14:27,143 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:27,144 INFO L182 omatonBuilderFactory]: Interpolants [1536#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 1537#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 1538#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 1539#(not (= |#Ultimate.C_memset_#amount| 40)), 1516#true, 1517#false, 1518#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1519#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 1520#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 1521#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 1522#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 1523#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 1524#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 1525#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 1526#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 1527#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 1528#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 1529#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 1530#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 1531#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 1532#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 1533#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 1534#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 1535#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:27,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:14:27,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:14:27,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=277, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:14:27,144 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 24 states. [2018-02-02 10:14:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:27,172 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-02-02 10:14:27,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:14:27,172 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 36 [2018-02-02 10:14:27,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:27,172 INFO L225 Difference]: With dead ends: 40 [2018-02-02 10:14:27,172 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 10:14:27,172 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=277, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:14:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 10:14:27,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-02 10:14:27,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 10:14:27,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-02-02 10:14:27,174 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-02-02 10:14:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:27,174 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-02-02 10:14:27,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:14:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-02-02 10:14:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:14:27,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:27,174 INFO L351 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:27,174 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:27,174 INFO L82 PathProgramCache]: Analyzing trace with hash 510623421, now seen corresponding path program 21 times [2018-02-02 10:14:27,175 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:27,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:27,385 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:27,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:14:27,385 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:27,386 INFO L182 omatonBuilderFactory]: Interpolants [1618#true, 1619#false, 1620#(= |#Ultimate.C_memset_#t~loopctr5| 0), 1621#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 1622#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 1623#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 1624#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 1625#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 1626#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 1627#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 1628#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 1629#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 1630#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 1631#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 1632#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 1633#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 1634#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 1635#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 1636#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 1637#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 1638#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 1639#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 1640#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 1641#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 1642#(not (= |#Ultimate.C_memset_#amount| 40))] [2018-02-02 10:14:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:27,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:14:27,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:14:27,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=301, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:14:27,387 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 25 states. [2018-02-02 10:14:27,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:27,407 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-02-02 10:14:27,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:14:27,407 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2018-02-02 10:14:27,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:27,408 INFO L225 Difference]: With dead ends: 41 [2018-02-02 10:14:27,408 INFO L226 Difference]: Without dead ends: 39 [2018-02-02 10:14:27,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=299, Invalid=301, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:14:27,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-02 10:14:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-02 10:14:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 10:14:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-02-02 10:14:27,410 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-02-02 10:14:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:27,411 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-02-02 10:14:27,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:14:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-02-02 10:14:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:14:27,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:27,411 INFO L351 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:27,411 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:27,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1934820488, now seen corresponding path program 22 times [2018-02-02 10:14:27,412 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:27,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:27,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:27,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:14:27,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:27,646 INFO L182 omatonBuilderFactory]: Interpolants [1728#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 1729#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 1730#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 1731#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 1732#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 1733#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 1734#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 1735#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 1736#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 1737#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 1738#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 1739#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 1740#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 1741#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 1742#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 1743#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 1744#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 1745#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 1746#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 1747#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40))), 1748#(not (= |#Ultimate.C_memset_#amount| 40)), 1723#true, 1724#false, 1725#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40))), 1726#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 1727#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:27,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:14:27,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:14:27,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:14:27,647 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 26 states. [2018-02-02 10:14:27,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:27,684 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-02-02 10:14:27,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:14:27,685 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-02-02 10:14:27,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:27,685 INFO L225 Difference]: With dead ends: 42 [2018-02-02 10:14:27,685 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 10:14:27,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:14:27,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 10:14:27,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-02 10:14:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 10:14:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-02-02 10:14:27,686 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-02-02 10:14:27,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:27,687 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-02-02 10:14:27,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:14:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-02-02 10:14:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:14:27,687 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:27,687 INFO L351 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:27,687 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:27,687 INFO L82 PathProgramCache]: Analyzing trace with hash -434170339, now seen corresponding path program 23 times [2018-02-02 10:14:27,688 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:27,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:27,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:27,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:14:27,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:27,899 INFO L182 omatonBuilderFactory]: Interpolants [1856#(or (<= |#Ultimate.C_memset_#t~loopctr5| 23) (not (= |#Ultimate.C_memset_#amount| 40))), 1857#(not (= |#Ultimate.C_memset_#amount| 40)), 1831#true, 1832#false, 1833#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40))), 1834#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 1835#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 1836#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 1837#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 1838#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 1839#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 1840#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 1841#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 1842#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 1843#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 1844#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 1845#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 1846#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 1847#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 1848#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 1849#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 1850#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 1851#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 1852#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 1853#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 1854#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 1855#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:27,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:14:27,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:14:27,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:14:27,900 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 27 states. [2018-02-02 10:14:27,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:27,923 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-02 10:14:27,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:14:27,923 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 39 [2018-02-02 10:14:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:27,923 INFO L225 Difference]: With dead ends: 43 [2018-02-02 10:14:27,923 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 10:14:27,924 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:14:27,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 10:14:27,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-02 10:14:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 10:14:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-02-02 10:14:27,925 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-02-02 10:14:27,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:27,925 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-02-02 10:14:27,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:14:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-02-02 10:14:27,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:14:27,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:27,925 INFO L351 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:27,925 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:27,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1158655976, now seen corresponding path program 24 times [2018-02-02 10:14:27,926 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:27,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:28,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:28,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:14:28,209 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:28,210 INFO L182 omatonBuilderFactory]: Interpolants [1942#true, 1943#false, 1944#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40))), 1945#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 1946#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 1947#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 1948#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 1949#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 1950#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 1951#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 1952#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 1953#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 1954#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 1955#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 1956#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 1957#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 1958#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 1959#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 1960#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 1961#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 1962#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 1963#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 1964#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 1965#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 1966#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40))), 1967#(or (<= |#Ultimate.C_memset_#t~loopctr5| 23) (not (= |#Ultimate.C_memset_#amount| 40))), 1968#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 40))), 1969#(not (= |#Ultimate.C_memset_#amount| 40))] [2018-02-02 10:14:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:28,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:14:28,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:14:28,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:14:28,215 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 28 states. [2018-02-02 10:14:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:28,283 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-02-02 10:14:28,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:14:28,283 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 40 [2018-02-02 10:14:28,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:28,283 INFO L225 Difference]: With dead ends: 44 [2018-02-02 10:14:28,283 INFO L226 Difference]: Without dead ends: 42 [2018-02-02 10:14:28,284 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:14:28,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-02 10:14:28,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-02 10:14:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 10:14:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-02-02 10:14:28,285 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-02-02 10:14:28,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:28,286 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-02-02 10:14:28,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:14:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-02-02 10:14:28,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:14:28,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:28,286 INFO L351 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:28,286 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:28,287 INFO L82 PathProgramCache]: Analyzing trace with hash -2142874243, now seen corresponding path program 25 times [2018-02-02 10:14:28,287 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:28,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:28,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:28,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 10:14:28,562 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:28,562 INFO L182 omatonBuilderFactory]: Interpolants [2056#true, 2057#false, 2058#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40))), 2059#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 2060#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 2061#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 2062#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 2063#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 2064#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 2065#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 2066#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 2067#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 2068#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 2069#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 2070#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 2071#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 2072#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 2073#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 2074#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 2075#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 2076#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 2077#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 2078#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 2079#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 2080#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40))), 2081#(or (<= |#Ultimate.C_memset_#t~loopctr5| 23) (not (= |#Ultimate.C_memset_#amount| 40))), 2082#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 40))), 2083#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 40))), 2084#(not (= |#Ultimate.C_memset_#amount| 40))] [2018-02-02 10:14:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:28,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:14:28,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:14:28,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:14:28,563 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 29 states. [2018-02-02 10:14:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:28,615 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-02-02 10:14:28,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:14:28,616 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 41 [2018-02-02 10:14:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:28,617 INFO L225 Difference]: With dead ends: 45 [2018-02-02 10:14:28,617 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 10:14:28,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:14:28,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 10:14:28,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-02 10:14:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 10:14:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-02-02 10:14:28,620 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-02-02 10:14:28,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:28,620 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-02-02 10:14:28,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:14:28,620 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-02-02 10:14:28,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:14:28,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:28,621 INFO L351 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:28,621 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:28,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1706097848, now seen corresponding path program 26 times [2018-02-02 10:14:28,622 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:28,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:28,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:28,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:14:28,914 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:28,914 INFO L182 omatonBuilderFactory]: Interpolants [2176#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 2177#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 2178#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 2179#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 2180#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 2181#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 2182#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 2183#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 2184#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 2185#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 2186#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 2187#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 2188#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 2189#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 2190#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 2191#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 2192#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 2193#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 2194#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 2195#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 2196#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 2197#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40))), 2198#(or (<= |#Ultimate.C_memset_#t~loopctr5| 23) (not (= |#Ultimate.C_memset_#amount| 40))), 2199#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 40))), 2200#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 40))), 2201#(or (<= |#Ultimate.C_memset_#t~loopctr5| 26) (not (= |#Ultimate.C_memset_#amount| 40))), 2202#(not (= |#Ultimate.C_memset_#amount| 40)), 2173#true, 2174#false, 2175#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:28,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:14:28,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:14:28,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:14:28,915 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 30 states. [2018-02-02 10:14:28,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:28,953 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-02-02 10:14:28,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:14:28,953 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2018-02-02 10:14:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:28,954 INFO L225 Difference]: With dead ends: 46 [2018-02-02 10:14:28,954 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 10:14:28,954 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:14:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 10:14:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-02 10:14:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 10:14:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-02-02 10:14:28,955 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-02-02 10:14:28,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:28,955 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-02-02 10:14:28,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:14:28,955 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-02-02 10:14:28,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:14:28,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:28,955 INFO L351 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:28,955 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:28,956 INFO L82 PathProgramCache]: Analyzing trace with hash 765148381, now seen corresponding path program 27 times [2018-02-02 10:14:28,956 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:28,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:29,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:29,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 10:14:29,266 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:29,266 INFO L182 omatonBuilderFactory]: Interpolants [2304#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 2305#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 2306#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 2307#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 2308#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 2309#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 2310#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 2311#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 2312#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 2313#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 2314#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 2315#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 2316#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 2317#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40))), 2318#(or (<= |#Ultimate.C_memset_#t~loopctr5| 23) (not (= |#Ultimate.C_memset_#amount| 40))), 2319#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 40))), 2320#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 40))), 2321#(or (<= |#Ultimate.C_memset_#t~loopctr5| 26) (not (= |#Ultimate.C_memset_#amount| 40))), 2322#(or (<= |#Ultimate.C_memset_#t~loopctr5| 27) (not (= |#Ultimate.C_memset_#amount| 40))), 2323#(not (= |#Ultimate.C_memset_#amount| 40)), 2293#true, 2294#false, 2295#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40))), 2296#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 2297#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 2298#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 2299#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 2300#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 2301#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 2302#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 2303#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:29,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 10:14:29,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 10:14:29,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:14:29,267 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 31 states. [2018-02-02 10:14:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:29,305 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-02-02 10:14:29,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:14:29,305 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 43 [2018-02-02 10:14:29,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:29,305 INFO L225 Difference]: With dead ends: 47 [2018-02-02 10:14:29,305 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 10:14:29,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:14:29,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 10:14:29,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 10:14:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 10:14:29,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-02-02 10:14:29,307 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-02-02 10:14:29,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:29,307 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-02-02 10:14:29,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 10:14:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-02-02 10:14:29,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:14:29,307 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:29,307 INFO L351 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:29,307 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:29,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1660485976, now seen corresponding path program 28 times [2018-02-02 10:14:29,308 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:29,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:29,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:29,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:14:29,595 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:29,595 INFO L182 omatonBuilderFactory]: Interpolants [2432#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 2433#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 2434#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 2435#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 2436#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 2437#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 2438#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 2439#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 2440#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40))), 2441#(or (<= |#Ultimate.C_memset_#t~loopctr5| 23) (not (= |#Ultimate.C_memset_#amount| 40))), 2442#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 40))), 2443#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 40))), 2444#(or (<= |#Ultimate.C_memset_#t~loopctr5| 26) (not (= |#Ultimate.C_memset_#amount| 40))), 2445#(or (<= |#Ultimate.C_memset_#t~loopctr5| 27) (not (= |#Ultimate.C_memset_#amount| 40))), 2446#(or (<= |#Ultimate.C_memset_#t~loopctr5| 28) (not (= |#Ultimate.C_memset_#amount| 40))), 2447#(not (= |#Ultimate.C_memset_#amount| 40)), 2416#true, 2417#false, 2418#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40))), 2419#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 2420#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 2421#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 2422#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 2423#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 2424#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 2425#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 2426#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 2427#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 2428#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 2429#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 2430#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 2431#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:29,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:14:29,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:14:29,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:14:29,596 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 32 states. [2018-02-02 10:14:29,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:29,631 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-02-02 10:14:29,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:14:29,631 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 44 [2018-02-02 10:14:29,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:29,632 INFO L225 Difference]: With dead ends: 48 [2018-02-02 10:14:29,632 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 10:14:29,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:14:29,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 10:14:29,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-02 10:14:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 10:14:29,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-02-02 10:14:29,633 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-02-02 10:14:29,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:29,633 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-02-02 10:14:29,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:14:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-02-02 10:14:29,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:14:29,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:29,634 INFO L351 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:29,634 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:29,634 INFO L82 PathProgramCache]: Analyzing trace with hash -648819651, now seen corresponding path program 29 times [2018-02-02 10:14:29,635 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:29,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:29,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:29,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 10:14:29,977 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:29,978 INFO L182 omatonBuilderFactory]: Interpolants [2560#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 2561#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 2562#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 2563#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 2564#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 2565#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 2566#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40))), 2567#(or (<= |#Ultimate.C_memset_#t~loopctr5| 23) (not (= |#Ultimate.C_memset_#amount| 40))), 2568#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 40))), 2569#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 40))), 2570#(or (<= |#Ultimate.C_memset_#t~loopctr5| 26) (not (= |#Ultimate.C_memset_#amount| 40))), 2571#(or (<= |#Ultimate.C_memset_#t~loopctr5| 27) (not (= |#Ultimate.C_memset_#amount| 40))), 2572#(or (<= |#Ultimate.C_memset_#t~loopctr5| 28) (not (= |#Ultimate.C_memset_#amount| 40))), 2573#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 40))), 2574#(not (= |#Ultimate.C_memset_#amount| 40)), 2542#true, 2543#false, 2544#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40))), 2545#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 2546#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 2547#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 2548#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 2549#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 2550#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 2551#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 2552#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 2553#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 2554#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 2555#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 2556#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 2557#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 2558#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 2559#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:29,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 10:14:29,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 10:14:29,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:14:29,979 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 33 states. [2018-02-02 10:14:30,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:30,023 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-02-02 10:14:30,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:14:30,027 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 45 [2018-02-02 10:14:30,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:30,029 INFO L225 Difference]: With dead ends: 49 [2018-02-02 10:14:30,029 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 10:14:30,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:14:30,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 10:14:30,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 10:14:30,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 10:14:30,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-02-02 10:14:30,031 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-02-02 10:14:30,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:30,031 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-02-02 10:14:30,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 10:14:30,031 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-02-02 10:14:30,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:14:30,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:30,032 INFO L351 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:30,032 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:30,032 INFO L82 PathProgramCache]: Analyzing trace with hash 777149944, now seen corresponding path program 30 times [2018-02-02 10:14:30,033 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:30,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:30,400 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:30,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:30,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 10:14:30,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:30,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:30,401 INFO L182 omatonBuilderFactory]: Interpolants [2688#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 2689#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 2690#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 2691#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 2692#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 2693#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 2694#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 2695#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40))), 2696#(or (<= |#Ultimate.C_memset_#t~loopctr5| 23) (not (= |#Ultimate.C_memset_#amount| 40))), 2697#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 40))), 2698#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 40))), 2699#(or (<= |#Ultimate.C_memset_#t~loopctr5| 26) (not (= |#Ultimate.C_memset_#amount| 40))), 2700#(or (<= |#Ultimate.C_memset_#t~loopctr5| 27) (not (= |#Ultimate.C_memset_#amount| 40))), 2701#(or (<= |#Ultimate.C_memset_#t~loopctr5| 28) (not (= |#Ultimate.C_memset_#amount| 40))), 2702#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 40))), 2703#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 40))), 2704#(not (= |#Ultimate.C_memset_#amount| 40)), 2671#true, 2672#false, 2673#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40))), 2674#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 2675#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 2676#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 2677#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 2678#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 2679#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 2680#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 2681#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 2682#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 2683#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 2684#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 2685#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 2686#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 2687#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:30,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 10:14:30,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 10:14:30,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:14:30,402 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 34 states. [2018-02-02 10:14:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:30,432 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-02-02 10:14:30,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:14:30,432 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 46 [2018-02-02 10:14:30,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:30,432 INFO L225 Difference]: With dead ends: 50 [2018-02-02 10:14:30,432 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 10:14:30,433 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:14:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 10:14:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-02 10:14:30,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 10:14:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-02-02 10:14:30,434 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-02-02 10:14:30,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:30,434 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-02-02 10:14:30,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 10:14:30,434 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-02-02 10:14:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:14:30,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:30,435 INFO L351 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:30,435 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2032534429, now seen corresponding path program 31 times [2018-02-02 10:14:30,436 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:30,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:30,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:30,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 10:14:30,789 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:30,789 INFO L182 omatonBuilderFactory]: Interpolants [2816#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 2817#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 2818#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 2819#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 2820#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 2821#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 2822#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 2823#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 2824#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 2825#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 2826#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 2827#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40))), 2828#(or (<= |#Ultimate.C_memset_#t~loopctr5| 23) (not (= |#Ultimate.C_memset_#amount| 40))), 2829#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 40))), 2830#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 40))), 2831#(or (<= |#Ultimate.C_memset_#t~loopctr5| 26) (not (= |#Ultimate.C_memset_#amount| 40))), 2832#(or (<= |#Ultimate.C_memset_#t~loopctr5| 27) (not (= |#Ultimate.C_memset_#amount| 40))), 2833#(or (<= |#Ultimate.C_memset_#t~loopctr5| 28) (not (= |#Ultimate.C_memset_#amount| 40))), 2834#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 40))), 2835#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 40))), 2836#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 40))), 2837#(not (= |#Ultimate.C_memset_#amount| 40)), 2803#true, 2804#false, 2805#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40))), 2806#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 2807#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 2808#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 2809#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 2810#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 2811#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 2812#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 2813#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 2814#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 2815#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:30,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 10:14:30,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 10:14:30,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:14:30,790 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 35 states. [2018-02-02 10:14:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:30,824 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-02-02 10:14:30,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:14:30,824 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 47 [2018-02-02 10:14:30,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:30,824 INFO L225 Difference]: With dead ends: 51 [2018-02-02 10:14:30,824 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 10:14:30,825 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:14:30,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 10:14:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 10:14:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 10:14:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-02-02 10:14:30,826 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-02-02 10:14:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:30,826 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-02-02 10:14:30,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 10:14:30,826 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-02-02 10:14:30,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:14:30,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:30,826 INFO L351 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:30,826 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:30,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2000219496, now seen corresponding path program 32 times [2018-02-02 10:14:30,827 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:30,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:31,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:31,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 10:14:31,293 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:31,294 INFO L182 omatonBuilderFactory]: Interpolants [2944#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 2945#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 2946#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 2947#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 2948#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 2949#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 2950#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 2951#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 2952#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 2953#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 2954#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 2955#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 2956#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 2957#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 2958#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 2959#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 2960#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 2961#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 2962#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40))), 2963#(or (<= |#Ultimate.C_memset_#t~loopctr5| 23) (not (= |#Ultimate.C_memset_#amount| 40))), 2964#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 40))), 2965#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 40))), 2966#(or (<= |#Ultimate.C_memset_#t~loopctr5| 26) (not (= |#Ultimate.C_memset_#amount| 40))), 2967#(or (<= |#Ultimate.C_memset_#t~loopctr5| 27) (not (= |#Ultimate.C_memset_#amount| 40))), 2968#(or (<= |#Ultimate.C_memset_#t~loopctr5| 28) (not (= |#Ultimate.C_memset_#amount| 40))), 2969#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 40))), 2970#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 40))), 2971#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 40))), 2972#(or (<= |#Ultimate.C_memset_#t~loopctr5| 32) (not (= |#Ultimate.C_memset_#amount| 40))), 2973#(not (= |#Ultimate.C_memset_#amount| 40)), 2938#true, 2939#false, 2940#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40))), 2941#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 2942#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 2943#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:31,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 10:14:31,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 10:14:31,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:14:31,295 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 36 states. [2018-02-02 10:14:31,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:31,357 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-02-02 10:14:31,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 10:14:31,357 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 48 [2018-02-02 10:14:31,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:31,358 INFO L225 Difference]: With dead ends: 52 [2018-02-02 10:14:31,358 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 10:14:31,358 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:14:31,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 10:14:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 10:14:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 10:14:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-02-02 10:14:31,359 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-02-02 10:14:31,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:31,359 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-02-02 10:14:31,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 10:14:31,359 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-02-02 10:14:31,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:14:31,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:31,360 INFO L351 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:31,360 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:31,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1833427709, now seen corresponding path program 33 times [2018-02-02 10:14:31,360 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:31,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:31,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:31,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 10:14:31,773 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:31,773 INFO L182 omatonBuilderFactory]: Interpolants [3076#true, 3077#false, 3078#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40))), 3079#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 3080#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 3081#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 3082#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 3083#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 3084#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 3085#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 3086#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 3087#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 3088#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 3089#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 3090#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 3091#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 3092#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 3093#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 3094#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 3095#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 3096#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 3097#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 3098#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 3099#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 3100#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40))), 3101#(or (<= |#Ultimate.C_memset_#t~loopctr5| 23) (not (= |#Ultimate.C_memset_#amount| 40))), 3102#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 40))), 3103#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 40))), 3104#(or (<= |#Ultimate.C_memset_#t~loopctr5| 26) (not (= |#Ultimate.C_memset_#amount| 40))), 3105#(or (<= |#Ultimate.C_memset_#t~loopctr5| 27) (not (= |#Ultimate.C_memset_#amount| 40))), 3106#(or (<= |#Ultimate.C_memset_#t~loopctr5| 28) (not (= |#Ultimate.C_memset_#amount| 40))), 3107#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 40))), 3108#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 40))), 3109#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 40))), 3110#(or (<= |#Ultimate.C_memset_#t~loopctr5| 32) (not (= |#Ultimate.C_memset_#amount| 40))), 3111#(or (<= |#Ultimate.C_memset_#t~loopctr5| 33) (not (= |#Ultimate.C_memset_#amount| 40))), 3112#(not (= |#Ultimate.C_memset_#amount| 40))] [2018-02-02 10:14:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:31,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 10:14:31,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 10:14:31,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:14:31,774 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 37 states. [2018-02-02 10:14:31,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:31,821 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-02-02 10:14:31,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:14:31,821 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 49 [2018-02-02 10:14:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:31,821 INFO L225 Difference]: With dead ends: 53 [2018-02-02 10:14:31,821 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 10:14:31,822 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:14:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 10:14:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 10:14:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 10:14:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-02-02 10:14:31,823 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-02-02 10:14:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:31,824 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-02-02 10:14:31,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 10:14:31,824 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-02-02 10:14:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:14:31,824 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:31,824 INFO L351 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:31,824 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:31,824 INFO L82 PathProgramCache]: Analyzing trace with hash 417406776, now seen corresponding path program 34 times [2018-02-02 10:14:31,825 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:31,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:32,309 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:32,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:32,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-02 10:14:32,310 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:32,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:32,310 INFO L182 omatonBuilderFactory]: Interpolants [3217#true, 3218#false, 3219#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40))), 3220#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 3221#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 3222#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 3223#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 3224#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 3225#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 3226#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 3227#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 3228#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 3229#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 3230#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 3231#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 3232#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 3233#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 3234#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 3235#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 3236#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 3237#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 3238#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 3239#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 3240#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 3241#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40))), 3242#(or (<= |#Ultimate.C_memset_#t~loopctr5| 23) (not (= |#Ultimate.C_memset_#amount| 40))), 3243#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 40))), 3244#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 40))), 3245#(or (<= |#Ultimate.C_memset_#t~loopctr5| 26) (not (= |#Ultimate.C_memset_#amount| 40))), 3246#(or (<= |#Ultimate.C_memset_#t~loopctr5| 27) (not (= |#Ultimate.C_memset_#amount| 40))), 3247#(or (<= |#Ultimate.C_memset_#t~loopctr5| 28) (not (= |#Ultimate.C_memset_#amount| 40))), 3248#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 40))), 3249#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 40))), 3250#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 40))), 3251#(or (<= |#Ultimate.C_memset_#t~loopctr5| 32) (not (= |#Ultimate.C_memset_#amount| 40))), 3252#(or (<= |#Ultimate.C_memset_#t~loopctr5| 33) (not (= |#Ultimate.C_memset_#amount| 40))), 3253#(or (<= |#Ultimate.C_memset_#t~loopctr5| 34) (not (= |#Ultimate.C_memset_#amount| 40))), 3254#(not (= |#Ultimate.C_memset_#amount| 40))] [2018-02-02 10:14:32,310 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:32,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 10:14:32,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 10:14:32,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:14:32,311 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 38 states. [2018-02-02 10:14:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:32,386 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-02-02 10:14:32,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 10:14:32,388 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 50 [2018-02-02 10:14:32,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:32,388 INFO L225 Difference]: With dead ends: 54 [2018-02-02 10:14:32,388 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 10:14:32,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:14:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 10:14:32,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 10:14:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 10:14:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-02-02 10:14:32,390 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-02-02 10:14:32,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:32,390 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-02-02 10:14:32,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 10:14:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-02-02 10:14:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:14:32,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:32,390 INFO L351 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:32,390 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:32,391 INFO L82 PathProgramCache]: Analyzing trace with hash -529569187, now seen corresponding path program 35 times [2018-02-02 10:14:32,391 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:32,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:32,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:32,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-02 10:14:32,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:32,803 INFO L182 omatonBuilderFactory]: Interpolants [3392#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 40))), 3393#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 40))), 3394#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 40))), 3395#(or (<= |#Ultimate.C_memset_#t~loopctr5| 32) (not (= |#Ultimate.C_memset_#amount| 40))), 3396#(or (<= |#Ultimate.C_memset_#t~loopctr5| 33) (not (= |#Ultimate.C_memset_#amount| 40))), 3397#(or (<= |#Ultimate.C_memset_#t~loopctr5| 34) (not (= |#Ultimate.C_memset_#amount| 40))), 3398#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 40))), 3399#(not (= |#Ultimate.C_memset_#amount| 40)), 3361#true, 3362#false, 3363#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40))), 3364#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 3365#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 3366#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 3367#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 3368#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 3369#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 3370#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 3371#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 3372#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 3373#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 3374#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 3375#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 3376#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 3377#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 3378#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 3379#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 3380#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 3381#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 3382#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 3383#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 3384#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 3385#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40))), 3386#(or (<= |#Ultimate.C_memset_#t~loopctr5| 23) (not (= |#Ultimate.C_memset_#amount| 40))), 3387#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 40))), 3388#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 40))), 3389#(or (<= |#Ultimate.C_memset_#t~loopctr5| 26) (not (= |#Ultimate.C_memset_#amount| 40))), 3390#(or (<= |#Ultimate.C_memset_#t~loopctr5| 27) (not (= |#Ultimate.C_memset_#amount| 40))), 3391#(or (<= |#Ultimate.C_memset_#t~loopctr5| 28) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:32,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 10:14:32,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 10:14:32,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:14:32,804 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 39 states. [2018-02-02 10:14:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:32,830 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-02-02 10:14:32,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:14:32,831 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 51 [2018-02-02 10:14:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:32,831 INFO L225 Difference]: With dead ends: 55 [2018-02-02 10:14:32,831 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 10:14:32,831 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:14:32,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 10:14:32,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-02 10:14:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 10:14:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-02-02 10:14:32,832 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-02-02 10:14:32,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:32,833 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-02-02 10:14:32,833 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 10:14:32,833 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-02-02 10:14:32,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:14:32,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:32,833 INFO L351 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:32,833 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:32,833 INFO L82 PathProgramCache]: Analyzing trace with hash 178947032, now seen corresponding path program 36 times [2018-02-02 10:14:32,834 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:32,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:33,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:33,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-02 10:14:33,243 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:33,243 INFO L182 omatonBuilderFactory]: Interpolants [3520#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 3521#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 3522#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 3523#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 3524#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 3525#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 3526#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 3527#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 3528#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 3529#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 3530#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 3531#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 3532#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40))), 3533#(or (<= |#Ultimate.C_memset_#t~loopctr5| 23) (not (= |#Ultimate.C_memset_#amount| 40))), 3534#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 40))), 3535#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 40))), 3536#(or (<= |#Ultimate.C_memset_#t~loopctr5| 26) (not (= |#Ultimate.C_memset_#amount| 40))), 3537#(or (<= |#Ultimate.C_memset_#t~loopctr5| 27) (not (= |#Ultimate.C_memset_#amount| 40))), 3538#(or (<= |#Ultimate.C_memset_#t~loopctr5| 28) (not (= |#Ultimate.C_memset_#amount| 40))), 3539#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 40))), 3540#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 40))), 3541#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 40))), 3542#(or (<= |#Ultimate.C_memset_#t~loopctr5| 32) (not (= |#Ultimate.C_memset_#amount| 40))), 3543#(or (<= |#Ultimate.C_memset_#t~loopctr5| 33) (not (= |#Ultimate.C_memset_#amount| 40))), 3544#(or (<= |#Ultimate.C_memset_#t~loopctr5| 34) (not (= |#Ultimate.C_memset_#amount| 40))), 3545#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 40))), 3546#(or (<= |#Ultimate.C_memset_#t~loopctr5| 36) (not (= |#Ultimate.C_memset_#amount| 40))), 3547#(not (= |#Ultimate.C_memset_#amount| 40)), 3508#true, 3509#false, 3510#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40))), 3511#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 3512#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 3513#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 3514#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 3515#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 3516#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 3517#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 3518#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 3519#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:33,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 10:14:33,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 10:14:33,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:14:33,244 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 40 states. [2018-02-02 10:14:33,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:33,291 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-02-02 10:14:33,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 10:14:33,292 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 52 [2018-02-02 10:14:33,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:33,292 INFO L225 Difference]: With dead ends: 56 [2018-02-02 10:14:33,292 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 10:14:33,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:14:33,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 10:14:33,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 10:14:33,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 10:14:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-02-02 10:14:33,293 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-02-02 10:14:33,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:33,294 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-02-02 10:14:33,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 10:14:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-02-02 10:14:33,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:14:33,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:33,294 INFO L351 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:33,294 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:33,294 INFO L82 PathProgramCache]: Analyzing trace with hash 668113341, now seen corresponding path program 37 times [2018-02-02 10:14:33,295 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:33,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:33,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:33,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 10:14:33,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:33,812 INFO L182 omatonBuilderFactory]: Interpolants [3658#true, 3659#false, 3660#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40))), 3661#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 3662#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 3663#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 3664#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 3665#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 3666#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 3667#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 3668#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 3669#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 3670#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 3671#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 3672#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 3673#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 3674#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 3675#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 3676#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 3677#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 3678#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 3679#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 3680#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 3681#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 3682#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40))), 3683#(or (<= |#Ultimate.C_memset_#t~loopctr5| 23) (not (= |#Ultimate.C_memset_#amount| 40))), 3684#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 40))), 3685#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 40))), 3686#(or (<= |#Ultimate.C_memset_#t~loopctr5| 26) (not (= |#Ultimate.C_memset_#amount| 40))), 3687#(or (<= |#Ultimate.C_memset_#t~loopctr5| 27) (not (= |#Ultimate.C_memset_#amount| 40))), 3688#(or (<= |#Ultimate.C_memset_#t~loopctr5| 28) (not (= |#Ultimate.C_memset_#amount| 40))), 3689#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 40))), 3690#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 40))), 3691#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 40))), 3692#(or (<= |#Ultimate.C_memset_#t~loopctr5| 32) (not (= |#Ultimate.C_memset_#amount| 40))), 3693#(or (<= |#Ultimate.C_memset_#t~loopctr5| 33) (not (= |#Ultimate.C_memset_#amount| 40))), 3694#(or (<= |#Ultimate.C_memset_#t~loopctr5| 34) (not (= |#Ultimate.C_memset_#amount| 40))), 3695#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 40))), 3696#(or (<= |#Ultimate.C_memset_#t~loopctr5| 36) (not (= |#Ultimate.C_memset_#amount| 40))), 3697#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 40))), 3698#(not (= |#Ultimate.C_memset_#amount| 40))] [2018-02-02 10:14:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:33,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 10:14:33,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 10:14:33,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:14:33,813 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 41 states. [2018-02-02 10:14:33,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:33,862 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-02-02 10:14:33,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 10:14:33,862 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 53 [2018-02-02 10:14:33,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:33,862 INFO L225 Difference]: With dead ends: 57 [2018-02-02 10:14:33,862 INFO L226 Difference]: Without dead ends: 55 [2018-02-02 10:14:33,863 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:14:33,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-02 10:14:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-02 10:14:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 10:14:33,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-02-02 10:14:33,864 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-02-02 10:14:33,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:33,864 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-02-02 10:14:33,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 10:14:33,864 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-02-02 10:14:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:14:33,865 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:33,865 INFO L351 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:33,865 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:33,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1347600264, now seen corresponding path program 38 times [2018-02-02 10:14:33,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:33,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:34,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:34,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-02 10:14:34,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:34,347 INFO L182 omatonBuilderFactory]: Interpolants [3840#(or (<= |#Ultimate.C_memset_#t~loopctr5| 27) (not (= |#Ultimate.C_memset_#amount| 40))), 3841#(or (<= |#Ultimate.C_memset_#t~loopctr5| 28) (not (= |#Ultimate.C_memset_#amount| 40))), 3842#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 40))), 3843#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 40))), 3844#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 40))), 3845#(or (<= |#Ultimate.C_memset_#t~loopctr5| 32) (not (= |#Ultimate.C_memset_#amount| 40))), 3846#(or (<= |#Ultimate.C_memset_#t~loopctr5| 33) (not (= |#Ultimate.C_memset_#amount| 40))), 3847#(or (<= |#Ultimate.C_memset_#t~loopctr5| 34) (not (= |#Ultimate.C_memset_#amount| 40))), 3848#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 40))), 3849#(or (<= |#Ultimate.C_memset_#t~loopctr5| 36) (not (= |#Ultimate.C_memset_#amount| 40))), 3850#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 40))), 3851#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 40))), 3852#(not (= |#Ultimate.C_memset_#amount| 40)), 3811#true, 3812#false, 3813#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40))), 3814#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 3815#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 3816#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 3817#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 3818#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 3819#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 3820#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 3821#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 3822#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 3823#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 3824#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 3825#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 3826#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 3827#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 3828#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 3829#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 3830#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 3831#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 3832#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 3833#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 3834#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 3835#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40))), 3836#(or (<= |#Ultimate.C_memset_#t~loopctr5| 23) (not (= |#Ultimate.C_memset_#amount| 40))), 3837#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 40))), 3838#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 40))), 3839#(or (<= |#Ultimate.C_memset_#t~loopctr5| 26) (not (= |#Ultimate.C_memset_#amount| 40)))] [2018-02-02 10:14:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:34,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 10:14:34,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 10:14:34,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:14:34,348 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 42 states. [2018-02-02 10:14:34,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:34,379 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-02-02 10:14:34,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 10:14:34,379 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 54 [2018-02-02 10:14:34,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:34,379 INFO L225 Difference]: With dead ends: 58 [2018-02-02 10:14:34,379 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 10:14:34,380 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:14:34,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 10:14:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-02 10:14:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 10:14:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-02-02 10:14:34,381 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-02-02 10:14:34,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:34,381 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-02-02 10:14:34,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 10:14:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-02-02 10:14:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:14:34,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:34,381 INFO L351 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:34,381 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:34,381 INFO L82 PathProgramCache]: Analyzing trace with hash 589787421, now seen corresponding path program 39 times [2018-02-02 10:14:34,382 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:34,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:34,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:14:34,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 10:14:34,878 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:34,878 INFO L182 omatonBuilderFactory]: Interpolants [3968#false, 3969#(or (= |#Ultimate.C_memset_#t~loopctr5| 0) (not (= |#Ultimate.C_memset_#amount| 40))), 3970#(or (<= |#Ultimate.C_memset_#t~loopctr5| 1) (not (= |#Ultimate.C_memset_#amount| 40))), 3971#(or (<= |#Ultimate.C_memset_#t~loopctr5| 2) (not (= |#Ultimate.C_memset_#amount| 40))), 3972#(or (<= |#Ultimate.C_memset_#t~loopctr5| 3) (not (= |#Ultimate.C_memset_#amount| 40))), 3973#(or (<= |#Ultimate.C_memset_#t~loopctr5| 4) (not (= |#Ultimate.C_memset_#amount| 40))), 3974#(or (<= |#Ultimate.C_memset_#t~loopctr5| 5) (not (= |#Ultimate.C_memset_#amount| 40))), 3975#(or (<= |#Ultimate.C_memset_#t~loopctr5| 6) (not (= |#Ultimate.C_memset_#amount| 40))), 3976#(or (<= |#Ultimate.C_memset_#t~loopctr5| 7) (not (= |#Ultimate.C_memset_#amount| 40))), 3977#(or (<= |#Ultimate.C_memset_#t~loopctr5| 8) (not (= |#Ultimate.C_memset_#amount| 40))), 3978#(or (<= |#Ultimate.C_memset_#t~loopctr5| 9) (not (= |#Ultimate.C_memset_#amount| 40))), 3979#(or (<= |#Ultimate.C_memset_#t~loopctr5| 10) (not (= |#Ultimate.C_memset_#amount| 40))), 3980#(or (<= |#Ultimate.C_memset_#t~loopctr5| 11) (not (= |#Ultimate.C_memset_#amount| 40))), 3981#(or (<= |#Ultimate.C_memset_#t~loopctr5| 12) (not (= |#Ultimate.C_memset_#amount| 40))), 3982#(or (<= |#Ultimate.C_memset_#t~loopctr5| 13) (not (= |#Ultimate.C_memset_#amount| 40))), 3983#(or (<= |#Ultimate.C_memset_#t~loopctr5| 14) (not (= |#Ultimate.C_memset_#amount| 40))), 3984#(or (<= |#Ultimate.C_memset_#t~loopctr5| 15) (not (= |#Ultimate.C_memset_#amount| 40))), 3985#(or (<= |#Ultimate.C_memset_#t~loopctr5| 16) (not (= |#Ultimate.C_memset_#amount| 40))), 3986#(or (<= |#Ultimate.C_memset_#t~loopctr5| 17) (not (= |#Ultimate.C_memset_#amount| 40))), 3987#(or (<= |#Ultimate.C_memset_#t~loopctr5| 18) (not (= |#Ultimate.C_memset_#amount| 40))), 3988#(or (<= |#Ultimate.C_memset_#t~loopctr5| 19) (not (= |#Ultimate.C_memset_#amount| 40))), 3989#(or (<= |#Ultimate.C_memset_#t~loopctr5| 20) (not (= |#Ultimate.C_memset_#amount| 40))), 3990#(or (<= |#Ultimate.C_memset_#t~loopctr5| 21) (not (= |#Ultimate.C_memset_#amount| 40))), 3991#(or (<= |#Ultimate.C_memset_#t~loopctr5| 22) (not (= |#Ultimate.C_memset_#amount| 40))), 3992#(or (<= |#Ultimate.C_memset_#t~loopctr5| 23) (not (= |#Ultimate.C_memset_#amount| 40))), 3993#(or (<= |#Ultimate.C_memset_#t~loopctr5| 24) (not (= |#Ultimate.C_memset_#amount| 40))), 3994#(or (<= |#Ultimate.C_memset_#t~loopctr5| 25) (not (= |#Ultimate.C_memset_#amount| 40))), 3995#(or (<= |#Ultimate.C_memset_#t~loopctr5| 26) (not (= |#Ultimate.C_memset_#amount| 40))), 3996#(or (<= |#Ultimate.C_memset_#t~loopctr5| 27) (not (= |#Ultimate.C_memset_#amount| 40))), 3997#(or (<= |#Ultimate.C_memset_#t~loopctr5| 28) (not (= |#Ultimate.C_memset_#amount| 40))), 3998#(or (<= |#Ultimate.C_memset_#t~loopctr5| 29) (not (= |#Ultimate.C_memset_#amount| 40))), 3999#(or (<= |#Ultimate.C_memset_#t~loopctr5| 30) (not (= |#Ultimate.C_memset_#amount| 40))), 4000#(or (<= |#Ultimate.C_memset_#t~loopctr5| 31) (not (= |#Ultimate.C_memset_#amount| 40))), 4001#(or (<= |#Ultimate.C_memset_#t~loopctr5| 32) (not (= |#Ultimate.C_memset_#amount| 40))), 4002#(or (<= |#Ultimate.C_memset_#t~loopctr5| 33) (not (= |#Ultimate.C_memset_#amount| 40))), 4003#(or (<= |#Ultimate.C_memset_#t~loopctr5| 34) (not (= |#Ultimate.C_memset_#amount| 40))), 4004#(or (<= |#Ultimate.C_memset_#t~loopctr5| 35) (not (= |#Ultimate.C_memset_#amount| 40))), 4005#(or (<= |#Ultimate.C_memset_#t~loopctr5| 36) (not (= |#Ultimate.C_memset_#amount| 40))), 4006#(or (<= |#Ultimate.C_memset_#t~loopctr5| 37) (not (= |#Ultimate.C_memset_#amount| 40))), 4007#(or (<= |#Ultimate.C_memset_#t~loopctr5| 38) (not (= |#Ultimate.C_memset_#amount| 40))), 4008#(or (<= |#Ultimate.C_memset_#t~loopctr5| 39) (not (= |#Ultimate.C_memset_#amount| 40))), 4009#(not (= |#Ultimate.C_memset_#amount| 40)), 3967#true] [2018-02-02 10:14:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:34,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 10:14:34,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 10:14:34,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:14:34,879 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 43 states. [2018-02-02 10:14:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:34,938 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-02-02 10:14:34,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 10:14:34,938 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 55 [2018-02-02 10:14:34,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:34,938 INFO L225 Difference]: With dead ends: 59 [2018-02-02 10:14:34,938 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 10:14:34,939 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:14:34,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 10:14:34,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 10:14:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 10:14:34,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-02-02 10:14:34,940 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-02-02 10:14:34,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:34,940 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-02-02 10:14:34,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 10:14:34,940 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-02-02 10:14:34,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:14:34,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:14:34,940 INFO L351 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:14:34,940 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:14:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash 519263512, now seen corresponding path program 40 times [2018-02-02 10:14:34,941 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:14:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:14:34,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:14:35,008 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-02-02 10:14:35,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:14:35,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:14:35,009 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:14:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:14:35,009 INFO L182 omatonBuilderFactory]: Interpolants [4128#(= |#valid| |old(#valid)|), 4129#(= (store |#valid| |main_~#cstats~0.base| 0) |old(#valid)|), 4126#true, 4127#false] [2018-02-02 10:14:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-02-02 10:14:35,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:14:35,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:14:35,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:14:35,010 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 4 states. [2018-02-02 10:14:35,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:14:35,024 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-02-02 10:14:35,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:14:35,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-02-02 10:14:35,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:14:35,024 INFO L225 Difference]: With dead ends: 56 [2018-02-02 10:14:35,024 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 10:14:35,024 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:14:35,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 10:14:35,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 10:14:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 10:14:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 10:14:35,025 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2018-02-02 10:14:35,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:14:35,025 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 10:14:35,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:14:35,025 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 10:14:35,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 10:14:35,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:14:35 BoogieIcfgContainer [2018-02-02 10:14:35,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:14:35,031 INFO L168 Benchmark]: Toolchain (without parser) took 12075.47 ms. Allocated memory was 403.2 MB in the beginning and 879.8 MB in the end (delta: 476.6 MB). Free memory was 361.1 MB in the beginning and 580.2 MB in the end (delta: -219.1 MB). Peak memory consumption was 257.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:14:35,032 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 403.2 MB. Free memory is still 366.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:14:35,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 119.63 ms. Allocated memory is still 403.2 MB. Free memory was 361.1 MB in the beginning and 353.2 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:14:35,032 INFO L168 Benchmark]: Boogie Preprocessor took 19.67 ms. Allocated memory is still 403.2 MB. Free memory was 353.2 MB in the beginning and 351.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:14:35,032 INFO L168 Benchmark]: RCFGBuilder took 135.40 ms. Allocated memory is still 403.2 MB. Free memory was 351.9 MB in the beginning and 338.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:14:35,032 INFO L168 Benchmark]: TraceAbstraction took 11798.26 ms. Allocated memory was 403.2 MB in the beginning and 879.8 MB in the end (delta: 476.6 MB). Free memory was 337.3 MB in the beginning and 580.2 MB in the end (delta: -242.8 MB). Peak memory consumption was 233.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:14:35,034 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 403.2 MB. Free memory is still 366.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 119.63 ms. Allocated memory is still 403.2 MB. Free memory was 361.1 MB in the beginning and 353.2 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.67 ms. Allocated memory is still 403.2 MB. Free memory was 353.2 MB in the beginning and 351.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 135.40 ms. Allocated memory is still 403.2 MB. Free memory was 351.9 MB in the beginning and 338.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 11798.26 ms. Allocated memory was 403.2 MB in the beginning and 879.8 MB in the end (delta: 476.6 MB). Free memory was 337.3 MB in the beginning and 580.2 MB in the end (delta: -242.8 MB). Peak memory consumption was 233.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 3 error locations. SAFE Result, 11.7s OverallTime, 43 OverallIterations, 40 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 646 SDtfs, 71 SDslu, 7217 SDs, 0 SdLazy, 2724 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 950 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 866 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 820/11480 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 43 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 1490 NumberOfCodeBlocks, 1490 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1447 ConstructedInterpolants, 0 QuantifiedInterpolants, 298079 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 4 PerfectInterpolantSequences, 820/11480 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memset2_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-14-35-040.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memset2_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-14-35-040.csv Received shutdown request...